By Topic

IEEE Transactions on Knowledge and Data Engineering

Issue 7 • Date July 2010

Filter Results

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

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

    Publication Year: 2010, Page(s): c2
    Request permission for commercial reuse | PDF file iconPDF (205 KB)
    Freely Available from IEEE
  • An UpDown Directed Acyclic Graph Approach for Sequential Pattern Mining

    Publication Year: 2010, Page(s):913 - 928
    Cited by:  Papers (7)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (3695 KB) | HTML iconHTML

    Traditional pattern growth-based approaches for sequential pattern mining derive length-(k+1) patterns based on the projected databases of length-k patterns recursively. At each level of recursion, they unidirectionally grow the length of detected patterns by one along the suffix of detected patterns, which needs k levels of recursion to find a length-k pattern. In this paper, a novel data structu... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Bregman Divergence-Based Regularization for Transfer Subspace Learning

    Publication Year: 2010, Page(s):929 - 942
    Cited by:  Papers (55)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (3220 KB) | HTML iconHTML

    The regularization principals [31] lead approximation schemes to deal with various learning problems, e.g., the regularization of the norm in a reproducing kernel Hilbert space for the ill-posed problem. In this paper, we present a family of subspace learning algorithms based on a new form of regularization, which transfers the knowledge gained in training samples to testing samples. In particular... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Closeness: A New Privacy Measure for Data Publishing

    Publication Year: 2010, Page(s):943 - 956
    Cited by:  Papers (23)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (2509 KB) | HTML iconHTML

    The k-anonymity privacy requirement for publishing microdata requires that each equivalence class (i.e., a set of records that are indistinguishable from each other with respect to certain “identifying” attributes) contains at least k records. Recently, several authors have recognized that k-anonymity cannot prevent attribute disclosure. The notion of ℓ-diversity has been prop... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Conic Programming for Multitask Learning

    Publication Year: 2010, Page(s):957 - 968
    Cited by:  Papers (9)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1695 KB) | HTML iconHTML

    When we have several related tasks, solving them simultaneously has been shown to be more effective than solving them individually. This approach is called multitask learning (MTL). In this paper, we propose a novel MTL algorithm. Our method controls the relatedness among the tasks locally, so all pairs of related tasks are guaranteed to have similar solutions. We apply the above idea to support v... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Deriving Concept-Based User Profiles from Search Engine Logs

    Publication Year: 2010, Page(s):969 - 982
    Cited by:  Papers (20)  |  Patents (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (3820 KB) | HTML iconHTML

    User profiling is a fundamental component of any personalization applications. Most existing user profiling strategies are based on objects that users are interested in (i.e., positive preferences), but not the objects that users dislike (i.e., negative preferences). In this paper, we focus on search engine personalization and develop several concept-based user profiling methods that are based on ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Incremental and General Evaluation of Reverse Nearest Neighbors

    Publication Year: 2010, Page(s):983 - 999
    Cited by:  Papers (8)  |  Patents (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (2927 KB) | HTML iconHTML

    This paper presents a novel algorithm for Incremental and General Evaluation of continuous Reverse Nearest neighbor queries (IGERN, for short). The IGERN algorithm is general in that it is applicable for both continuous monochromatic and bichromatic reverse nearest neighbor queries. This problem is faced in a number of applications such as enhanced 911 services and in army strategic planning. A ma... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • P2P Reputation Management Using Distributed Identities and Decentralized Recommendation Chains

    Publication Year: 2010, Page(s):1000 - 1013
    Cited by:  Papers (20)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1219 KB) | HTML iconHTML

    Peer-to-peer (P2P) networks are vulnerable to peers who cheat, propagate malicious code, leech on the network, or simply do not cooperate. The traditional security techniques developed for the centralized distributed systems like client-server networks are insufficient for P2P networks by the virtue of their centralized nature. The absence of a central authority in a P2P network poses unique chall... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Performance Comparison of the {rm R}^{ast}-Tree and the Quadtree for kNN and Distance Join Queries

    Publication Year: 2010, Page(s):1014 - 1027
    Cited by:  Papers (12)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (3638 KB) | HTML iconHTML

    Multidimensional point indexing plays a critical role in a variety of data-centric applications, including image retrieval, sequence matching, and moving object database search. A common choice of indexing method for these applications is often the "ubiquitous” R*-tree. Choosing the right indexing method requires careful consideration of various factors such as query operations and index co... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Probabilistic Topic Models for Learning Terminological Ontologies

    Publication Year: 2010, Page(s):1028 - 1040
    Cited by:  Papers (23)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1688 KB) | HTML iconHTML

    Probabilistic topic models were originally developed and utilized for document modeling and topic extraction in Information Retrieval. In this paper, we describe a new approach for automatic learning of terminological ontologies from text corpus based on such models. In our approach, topic models are used as efficient dimension reduction techniques, which are able to capture semantic relationships... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Superseding Nearest Neighbor Search on Uncertain Spatial Databases

    Publication Year: 2010, Page(s):1041 - 1055
    Cited by:  Papers (13)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (5239 KB) | HTML iconHTML

    This paper proposes a new problem, called superseding nearest neighbor search, on uncertain spatial databases, where each object is described by a multidimensional probability density function. Given a query point q, an object is a nearest neighbor (NN) candidate if it has a nonzero probability to be the NN of q. Given two NN-candidates o1 and o2, o1 supersedes o... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Join the IEEE Computer Society [advertisement]

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

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

    Publication Year: 2010, Page(s): c4
    Request permission for commercial reuse | PDF file iconPDF (153 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