By Topic

IEEE Transactions on Knowledge and Data Engineering

Issue 1 • Jan. 2009

Filter Results

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

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

    Publication Year: 2009, Page(s): c2
    Request permission for commercial reuse | PDF file iconPDF (129 KB)
    Freely Available from IEEE
  • EIC Editorial: Introducing the New Editor-in-Chief and Four New Associate Editors

    Publication Year: 2009, Page(s):1 - 3
    Cited by:  Papers (1)
    Request permission for commercial reuse | PDF file iconPDF (164 KB)
    Freely Available from IEEE
  • New EIC Editorial

    Publication Year: 2009, Page(s):4 - 5
    Request permission for commercial reuse | PDF file iconPDF (67 KB) | HTML iconHTML
    Freely Available from IEEE
  • Unsupervised Multiway Data Analysis: A Literature Survey

    Publication Year: 2009, Page(s):6 - 20
    Cited by:  Papers (135)  |  Patents (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1453 KB) | HTML iconHTML

    Two-way arrays or matrices are often not enough to represent all the information in the data and standard two-way analysis techniques commonly applied on matrices may fail to find the underlying structures in multi-modal datasets. Multiway data analysis has recently become popular as an exploratory analysis tool in discovering the structures in higher-order datasets, where data have more than two ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Comparing Scores Intended for Ranking

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

    Often, ranking is performed on the the basis of some scores available for each item. The existing practice for comparing scoring functions is to compare the induced rankings by one of the multitude of rank comparison methods available in the literature. We suggest that it may be better to compare the underlying scores themselves. To this end, a generalized Kendall distance is defined, which takes ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Online Skyline Analysis with Dynamic Preferences on Nominal Attributes

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

    The importance of skyline analysis has been well recognized in multi-criteria decision making applications. All of the previous studies assume a fixed order on the attributes in question. However, in some applications, users may be interested in skylines with respect to various total or partial orders on nominal attributes. In this paper, we identify and tackle the problem of online skyline analys... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Self-Learning Disk Scheduling

    Publication Year: 2009, Page(s):50 - 65
    Cited by:  Papers (11)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (3092 KB) | HTML iconHTML

    Performance of disk I/O schedulers is affected by many factors, such as workloads, file systems, and disk systems. Disk scheduling performance can be improved by tuning scheduler parameters, such as the length of read timers. Scheduler performance tuning is mostly done manually. To automate this process, we propose four self-learning disk scheduling schemes: change-sensing Round-Robin, feedback le... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Discriminative Training of the Hidden Vector State Model for Semantic Parsing

    Publication Year: 2009, Page(s):66 - 77
    Cited by:  Papers (11)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (2395 KB) | HTML iconHTML

    In this paper, we discuss how discriminative training can be applied to the hidden vector state (HVS) model in different task domains. The HVS model is a discrete hidden Markov model (HMM) in which each HMM state represents the state of a push-down automaton with a finite stack size. In previous applications, maximum-likelihood estimation (MLE) is used to derive the parameters of the HVS model. Ho... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Efficient Range Query Processing in Peer-to-Peer Systems

    Publication Year: 2009, Page(s):78 - 91
    Cited by:  Papers (24)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (3527 KB) | HTML iconHTML Multimedia Media

    With the increasing popularity of the peer-to-peer (P2P) computing paradigm, many general range query schemes for distributed hash table (DHT)-based P2P systems have been proposed. Although those schemes can provide range query capability without modifying the underlying DHTs, they have the query delay depending on both the scale of the system and the size of the query space or the specific query,... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • SPOT Databases: Efficient Consistency Checking and Optimistic Selection in Probabilistic Spatial Databases

    Publication Year: 2009, Page(s):92 - 107
    Cited by:  Papers (2)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (2534 KB) | HTML iconHTML

    Spatial probabilistic temporal (SPOT) databases are a paradigm for reasoning with probabilistic statements about where a vehicle may be now or in the future. They express statements of the form "Object O is in spatial region R at some time t with some probability in the interval [L,U]." Past work on SPOT databases has developed selection operators based on selecting SPOT atoms that are entailed by... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Efficient Evaluation of Probabilistic Advanced Spatial Queries on Existentially Uncertain Data

    Publication Year: 2009, Page(s):108 - 122
    Cited by:  Papers (22)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1901 KB) | HTML iconHTML

    We study the problem of answering spatial queries in databases where objects exist with some uncertainty and they are associated with an existential probability. The goal of a thresholding probabilistic spatial query is to retrieve the objects that qualify the spatial predicates with probability that exceeds a threshold. Accordingly, a ranking probabilistic spatial query selects the objects with t... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A Relation-Based Page Rank Algorithm for Semantic Web Search Engines

    Publication Year: 2009, Page(s):123 - 136
    Cited by:  Papers (30)  |  Patents (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (4987 KB) | HTML iconHTML

    With the tremendous growth of information available to end users through the Web, search engines come to play ever a more critical role. Nevertheless, because of their general-purpose approach, it is always less uncommon that obtained result sets provide a burden of useless pages. The next-generation Web architecture, represented by the Semantic Web, provides the layered architecture possibly allo... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • CDNs Content Outsourcing via Generalized Communities

    Publication Year: 2009, Page(s):137 - 151
    Cited by:  Papers (12)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (3028 KB) | HTML iconHTML

    Content distribution networks (CDNs) balance costs and quality in services related to content delivery. Devising an efficient content outsourcing policy is crucial since, based on such policies, CDN providers can provide client-tailored content, improve performance, and result in significant economical gains. Earlier content outsourcing approaches may often prove ineffective since they drive prefe... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • 2008 TKDE Reviewers List

    Publication Year: 2009, Page(s):152 - 157
    Request permission for commercial reuse | PDF file iconPDF (53 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):158 - 159
    Request permission for commercial reuse | PDF file iconPDF (40 KB)
    Freely Available from IEEE
  • Call for Papers for Special Issue on Mining Large Uncertain and Probabilistic Databases

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

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

    Publication Year: 2009, Page(s): c4
    Request permission for commercial reuse | PDF file iconPDF (155 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
Xuemin Lin
University of New South Wales

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