By Topic

IEEE Transactions on Knowledge and Data Engineering

Issue 9 • Date Sept. 2012

Filter Results

Displaying Results 1 - 20 of 20
  • [Table of contents]

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

    Publication Year: 2012, Page(s): c2
    Request permission for commercial reuse | PDF file iconPDF (202 KB)
    Freely Available from IEEE
  • A Survey of Indexing Techniques for Scalable Record Linkage and Deduplication

    Publication Year: 2012, Page(s):1537 - 1555
    Cited by:  Papers (34)  |  Patents (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1819 KB) | HTML iconHTML

    Record linkage is the process of matching records from several databases that refer to the same entities. When applied on a single database, this process is known as deduplication. Increasingly, matched data are becoming important in many application areas, because they can contain information that is not available otherwise, or that is too costly to acquire. Removing duplicate records in a single... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Distributed Line Graphs: A Universal Technique for Designing DHTs Based on Arbitrary Regular Graphs

    Publication Year: 2012, Page(s):1556 - 1569
    Cited by:  Papers (2)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1507 KB) | HTML iconHTML

    Most proposed DHTs engage certain topology maintenance mechanisms specific to the static graphs on which they are based. The designs of these mechanisms are complicated and repeated with graph-relevant concerns. In this paper, we propose the “distributed line graphs” (DLG), a universal technique for designing DHTs based on arbitrary regular graphs. Using DLG, the main feature... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Efficient Iceberg Query Evaluation Using Compressed Bitmap Index

    Publication Year: 2012, Page(s):1570 - 1583
    Cited by:  Papers (5)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1235 KB) | HTML iconHTML

    Decision support and knowledge discovery systems often compute aggregate values of interesting attributes by processing a huge amount of data in very large databases and/or warehouses. In particular, iceberg query is a special type of aggregation query that computes aggregate values above a user-provided threshold. Usually, only a small number of results will satisfy the threshold constraint. Yet,... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Efficient Multidimensional Fuzzy Search for Personal Information Management Systems

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

    With the explosion in the amount of semistructured data users access and store in personal information management systems, there is a critical need for powerful search tools to retrieve often very heterogeneous data in a simple and efficient way. Existing tools typically support some IR-style ranking on the textual part of the query, but only consider structure (e.g., file directory) and metadata ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Enabling Multilevel Trust in Privacy Preserving Data Mining

    Publication Year: 2012, Page(s):1598 - 1612
    Cited by:  Papers (16)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1251 KB) | HTML iconHTML Multimedia Media

    Privacy Preserving Data Mining (PPDM) addresses the problem of developing accurate models about aggregated data without access to precise information in individual data record. A widely studied perturbation-based PPDM approach introduces random perturbation to individual values to preserve privacy before data are published. Previous solutions of this approach are limited in their tacit assumption ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Evaluating Tag-Based Preference Obfuscation Systems

    Publication Year: 2012, Page(s):1613 - 1623
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (977 KB) | HTML iconHTML Multimedia Media

    While personalization is key to increase the usability of online services, disclosing one's preferences is undesirable from a privacy perspective, because it enables profiling through the linkage of what may otherwise be unlinkable service invocations. This paper considers an easily implementable class of obfuscation strategies as a means to mitigate these risks, and examines its privacy/utility t... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Flag Commit: Supporting Efficient Transaction Recovery in Flash-Based DBMSs

    Publication Year: 2012, Page(s):1624 - 1639
    Cited by:  Papers (8)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1664 KB) | HTML iconHTML Multimedia Media

    Owing to recent advances in semiconductor technologies, flash disks have been a competitive alternative to traditional magnetic disks as external storage media. In this paper, we study how transaction recovery can be efficiently supported in database management systems (dbmss) running on slc flash disks. Inspired by the classical shadow-paging approach, we propose a new commit scheme, called flagc... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Indexing Uncertain Data in General Metric Spaces

    Publication Year: 2012, Page(s):1640 - 1657
    Cited by:  Papers (3)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1441 KB) | HTML iconHTML

    In this study, we deal with the problem of efficiently answering range queries over uncertain objects in a general metric space. In this study, an uncertain object is an object that always exists but its actual value is uncertain and modeled by a multivariate probability density function. As a major contribution, this is the first work providing an effective technique for indexing uncertain object... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Mining Social Emotions from Affective Text

    Publication Year: 2012, Page(s):1658 - 1670
    Cited by:  Papers (23)  |  Patents (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (2429 KB) | HTML iconHTML

    This paper is concerned with the problem of mining social emotions from text. Recently, with the fast development of web 2.0, more and more documents are assigned by social users with emotion labels such as happiness, sadness, and surprise. Such emotions can provide a new aspect for document categorization, and therefore help online users to select related documents based on their emotional prefer... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • One Size Does Not Fit All: Toward User- and Query-Dependent Ranking for Web Databases

    Publication Year: 2012, Page(s):1671 - 1685
    Cited by:  Papers (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (2372 KB) | HTML iconHTML

    With the emergence of the deep web, searching web databases in domains such as vehicles, real estate, etc., has become a routine task. One of the problems in this context is ranking the results of a user query. Earlier approaches for addressing this problem have used frequencies of database values, query logs, and user profiles. A common thread in most of these approaches is that ranking is done i... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Particle Competition and Cooperation in Networks for Semi-Supervised Learning

    Publication Year: 2012, Page(s):1686 - 1698
    Cited by:  Papers (16)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (2769 KB) | HTML iconHTML

    Semi-supervised learning is one of the important topics in machine learning, concerning with pattern classification where only a small subset of data is labeled. In this paper, a new network-based (or graph-based) semi-supervised classification model is proposed. It employs a combined random-greedy walk of particles, with competition and cooperation mechanisms, to propagate class labels to the who... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Toward Private Joins on Outsourced Data

    Publication Year: 2012, Page(s):1699 - 1710
    Cited by:  Papers (5)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (745 KB) | HTML iconHTML

    In an outsourced database framework, clients place data management responsibilities with specialized service providers. Of essential concern in such frameworks is data privacy. Potential clients are reluctant to outsource sensitive data to a foreign party without strong privacy assurances beyond policy “fine prints.” In this paper, we introduce a mechanism for executing gener... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Using Graphics Processors for High Performance SimRank Computation

    Publication Year: 2012, Page(s):1711 - 1725
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1259 KB) | HTML iconHTML

    Recently there has been a lot of interest in graph-based analysis. One of the most important aspects of graph-based analysis is to measure similarity between nodes in a graph. SimRank is a simple and influential measure of this kind, based on a solid graph theoretical model. However, existing methods on SimRank computation suffer from two limitations: 1) the computing cost can be very high in prac... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • IEEE Computer Society OnlinePlus Coming Soon to TKDE

    Publication Year: 2012, Page(s): 1726
    Request permission for commercial reuse | PDF file iconPDF (225 KB)
    Freely Available from IEEE
  • What's new in Transactions [advertisement]

    Publication Year: 2012, Page(s): 1727
    Request permission for commercial reuse | PDF file iconPDF (348 KB)
    Freely Available from IEEE
  • Stay Connected with the IEEE Computer Society [advertisement]

    Publication Year: 2012, Page(s): 1728
    Request permission for commercial reuse | PDF file iconPDF (300 KB)
    Freely Available from IEEE
  • [Inside back cover]

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

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