By Topic

IEEE Transactions on Knowledge and Data Engineering

Issue 2 • Date Feb. 2009

Filter Results

Displaying Results 1 - 17 of 17
  • [Front cover]

    Publication Year: 2009, Page(s): c1
    Request permission for commercial reuse | PDF file iconPDF (142 KB)
    Freely Available from IEEE
  • [Inside front cover]

    Publication Year: 2009, Page(s): c2
    Request permission for commercial reuse | PDF file iconPDF (78 KB)
    Freely Available from IEEE
  • Learning Image-Text Associations

    Publication Year: 2009, Page(s):161 - 177
    Cited by:  Papers (3)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (3344 KB) | HTML iconHTML

    Web information fusion can be defined as the problem of collating and tracking information related to specific topics on the World Wide Web. Whereas most existing work on Web information fusion has focused on text-based multidocument summarization, this paper concerns the topic of image and text association, a cornerstone of cross-media Web information fusion. Specifically, we present two learning... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Decompositional Rule Extraction from Support Vector Machines by Active Learning

    Publication Year: 2009, Page(s):178 - 191
    Cited by:  Papers (17)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (3932 KB) | HTML iconHTML

    Support vector machines (SVMs) are currently state-of-the-art for the classification task and, generally speaking, exhibit good predictive performance due to their ability to model nonlinearities. However, their strength is also their main weakness, as the generated nonlinear models are typically regarded as incomprehensible black-box models. In this paper, we propose a new active learning-based a... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Multiclass MTS for Simultaneous Feature Selection and Classification

    Publication Year: 2009, Page(s):192 - 205
    Cited by:  Papers (11)  |  Patents (3)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (3499 KB) | HTML iconHTML

    Multiclass Mahalanobis-Taguchi system (MMTS), the extension of MTS, is developed for simultaneous multiclass classification and feature selection. In MMTS, the multiclass measurement scale is constructed by establishing an individual Mahalanobis space for each class. To increase the validity of the measurement scale, the Gram-Schmidt process is performed to mutually orthogonalize the features and ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • k-Anonymization with Minimal Loss of Information

    Publication Year: 2009, Page(s):206 - 219
    Cited by:  Papers (9)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (437 KB) | HTML iconHTML

    The technique of k-anonymization allows the releasing of databases that contain personal information while ensuring some degree of individual privacy. Anonymization is usually performed by generalizing database entries. We formally study the concept of generalization, and propose three information-theoretic measures for capturing the amount of information that is lost during the anonymizati... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Cost-Based Predictive Spatiotemporal Join

    Publication Year: 2009, Page(s):220 - 233
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (3431 KB) | HTML iconHTML

    A predictive spatiotemporal join finds all pairs of moving objects satisfying a join condition on future time and space. In this paper, we present CoPST, the first and foremost algorithm for such a join using two spatiotemporal indexes. In a predictive spatiotemporal join, the bounding boxes of the outer index are used to perform window searches on the inner index, and these bounding boxes enclose... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • BMQ-Processor: A High-Performance Border-Crossing Event Detection Framework for Large-Scale Monitoring Applications

    Publication Year: 2009, Page(s):234 - 252
    Cited by:  Papers (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (3361 KB) | HTML iconHTML

    In this paper, we present BMQ-Processor, a high-performance border-crossing event (BCE) detection framework for large-scale monitoring applications. We first characterize a new query semantics, namely, border monitoring query (BMQ), which is useful for BCE detection in many monitoring applications. It monitors the values of data streams and reports them only when data streams cross the borders of ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Privacy-Preserving Kth Element Score over Vertically Partitioned Data

    Publication Year: 2009, Page(s):253 - 258
    Cited by:  Papers (34)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (245 KB) | HTML iconHTML Multimedia Media

    Given a large integer data set shared vertically by two parties, we consider the problem of securely computing a score separating the kth and the (k + 1) to compute such a score while revealing little additional information. The proposed protocol is implemented using the Fairplay system and experimental results are reported. We show a real application of this protocol as a component used in the se... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Semantic Access to Multichannel M-Services

    Publication Year: 2009, Page(s):259 - 272
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (2295 KB) | HTML iconHTML

    M-services provide mobile users wireless access to Web services. In this paper, we present a novel infrastructure for supporting M-services in wireless broadcast systems. The proposed infrastructure provides a generic framework for mobile users to look up, access, and execute Web services over wireless broadcast channels. Access efficiency is an important issue in wireless broadcast systems. We di... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Online Scheduling Sequential Objects with Periodicity for Dynamic Information Dissemination

    Publication Year: 2009, Page(s):273 - 286
    Cited by:  Papers (6)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (3681 KB) | HTML iconHTML

    The scalability of data broadcasting has been manifested by prior studies on the base of the traditional data management systems where data objects, mapped to a pair of state and value in the database, are independent, persistent, and static against simple queries. However, many modern information applications spread dynamic data objects and process complex queries for retrieving multiple data obj... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Storing and Indexing Spatial Data in P2P Systems

    Publication Year: 2009, Page(s):287 - 300
    Cited by:  Papers (6)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (2793 KB) | HTML iconHTML

    The peer-to-peer (P2P) paradigm has become very popular for storing and sharing information in a totally decentralized manner. At first, research focused on P2P systems that host 1D data. Nowadays, the need for P2P applications with multidimensional data has emerged, motivating research on P2P systems that manage such data. The majority of the proposed techniques are based either on the distributi... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Call for Papers for Special Issue on Domain-Driven Data Mining

    Publication Year: 2009, Page(s): 301
    Request permission for commercial reuse | PDF file iconPDF (47 KB)
    Freely Available from IEEE
  • Call for Papers for Special Issue on Mining Large Uncertain and Probabilistic Databases

    Publication Year: 2009, Page(s): 302
    Request permission for commercial reuse | PDF file iconPDF (30 KB)
    Freely Available from IEEE
  • Call for Papers for Special Issue on Rule Representation, Interchange, and Reasoning in Distributed, Heterogeneous Environments

    Publication Year: 2009, Page(s): 303
    Request permission for commercial reuse | PDF file iconPDF (40 KB)
    Freely Available from IEEE
  • TKDE Information for authors

    Publication Year: 2009, Page(s): c3
    Request permission for commercial reuse | PDF file iconPDF (78 KB)
    Freely Available from IEEE
  • [Back cover]

    Publication Year: 2009, Page(s): c4
    Request permission for commercial reuse | PDF file iconPDF (142 KB)
    Freely Available from IEEE

Aims & Scope

IEEE Transactions on Knowledge and Data Engineering (TKDE) informs researchers, developers, managers, strategic planners, users, and others interested in state-of-the-art and state-of-the-practice activities in the knowledge and data engineering area.

Full Aims & Scope

Meet Our Editors

Editor-in-Chief
Jian Pei
Simon Fraser University

Associate Editor-in-Chief
Xuemin Lin
University of New South Wales

Associate Editor-in-Chief
Lei Chen
Hong Kong University of Science and Technology