By Topic

IEEE Transactions on Knowledge and Data Engineering

Issue 10 • Date Oct. 2011

Filter Results

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

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

    Publication Year: 2011, Page(s): c2
    Request permission for commercial reuse | PDF file iconPDF (156 KB)
    Freely Available from IEEE
  • A Cumulative Belief Degree-Based Approach for Missing Values in Nuclear Safeguards Evaluation

    Publication Year: 2011, Page(s):1441 - 1454
    Cited by:  Papers (5)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (3091 KB) | HTML iconHTML

    Nuclear safeguards are a set of activities to verify that a State is living up to its international undertakings not to use nuclear programs for nuclear weapons purposes. Nuclear safeguards experts of International Atomic Energy Agency (IAEA) evaluate indicators by benefitting from several sources such as State declarations, on-site inspections, the IAEA databases, and other open sources. The IAEA... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Alpha-Level Aggregation: A Practical Approach to Type-1 OWA Operation for Aggregating Uncertain Information with Applications to Breast Cancer Treatments

    Publication Year: 2011, Page(s):1455 - 1468
    Cited by:  Papers (31)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1350 KB) | HTML iconHTML

    Type-1 Ordered Weighted Averaging (OWA) operator provides us with a new technique for directly aggregating uncertain information with uncertain weights via OWA mechanism in soft decision making and data mining, in which uncertain objects are modeled by fuzzy sets. The Direct Approach to performing type-1 OWA operation involves high computational overhead. In this paper, we define a type-1 OWA oper... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Efficient Evaluation of Continuous Text Search Queries

    Publication Year: 2011, Page(s):1469 - 1482
    Cited by:  Papers (2)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1769 KB) | HTML iconHTML

    Consider a text filtering server that monitors a stream of incoming documents for a set of users, who register their interests in the form of continuous text search queries. The task of the server is to constantly maintain for each query a ranked result list, comprising the recent documents (drawn from a sliding window) with the highest similarity to the query. Such a system underlies many text mo... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Efficient Hidden Vector Encryption for Conjunctive Queries on Encrypted Data

    Publication Year: 2011, Page(s):1483 - 1497
    Cited by:  Papers (13)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (923 KB) | HTML iconHTML

    Predicate encryption has received considerable attention in applications where private and sensitive data about users can be stored in untrusted database (DB) servers. It allows users to store encrypted data at DB servers, and yet retain the ability to search those databases without revealing anything else about the encrypted data. Hidden Vector Encryption (HVE) is a type of predicate encryption t... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Estimating the Helpfulness and Economic Impact of Product Reviews: Mining Text and Reviewer Characteristics

    Publication Year: 2011, Page(s):1498 - 1512
    Cited by:  Papers (133)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1782 KB) | HTML iconHTML

    With the rapid growth of the Internet, the ability of users to create and publish content has created active electronic communities that provide a wealth of product information. However, the high volume of reviews that are typically published for a single product makes harder for individuals as well as manufacturers to locate the best reviews and understand the true underlying quality of a product... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Exact Top-K Queries in Wireless Sensor Networks

    Publication Year: 2011, Page(s):1513 - 1525
    Cited by:  Papers (16)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1269 KB) | HTML iconHTML

    In this paper, we consider the exact top-k query problem in wireless sensor networks, i.e., where one seeks to find the k highest reported values as well as the complete set of nodes that reported them. Our primary contribution in this context is EXTOK, a provably correct and topology-independent new filtering-based algorithm for processing exact top-k queries. As a secondary contribution we confi... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Group Enclosing Queries

    Publication Year: 2011, Page(s):1526 - 1540
    Cited by:  Papers (7)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1260 KB) | HTML iconHTML

    Given a set of points P and a query set Q, a group enclosing query (Geq) fetches the point p* ∈ P such that the maximum distance of p* to all points in Q is minimized. This problem is equivalent to the Min-Max case (minimizing the maximum distance) of aggregate nearest neighbor queries for spatial databases. This work first designs a new exact solution by exploring new geometric insights, s... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Optimal Symbol Alignment Distance: A New Distance for Sequences of Symbols

    Publication Year: 2011, Page(s):1541 - 1554
    Cited by:  Papers (5)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1249 KB) | HTML iconHTML

    Comparison functions for sequences (of symbols) are important components of many applications, for example, clustering, data cleansing, and integration. For years, many efforts have been made to improve the performance of such comparison functions. Improvements have been done either at the cost of reducing the accuracy of the comparison, or by compromising certain basic characteristics of the func... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Relevance-Based Retrieval on Hidden-Web Text Databases without Ranking Support

    Publication Year: 2011, Page(s):1555 - 1568
    Cited by:  Papers (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1350 KB) | HTML iconHTML

    Many online or local data sources provide powerful querying mechanisms but limited ranking capabilities. For instance, PubMed allows users to submit highly expressive Boolean keyword queries, but ranks the query results by date only. However, a user would typically prefer a ranking by relevance, measured by an information retrieval (IR) ranking function. A naive approach would be to submit a disju... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Static and Dynamic Delegation in the Role Graph Model

    Publication Year: 2011, Page(s):1569 - 1582
    Cited by:  Papers (3)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1577 KB) | HTML iconHTML

    Delegation in access control is used to deal with exceptional circumstances, when a regular user is unable to perform their normal job and delegates all or part of it to others. These situations can be anticipated and built into the security design as static delegation; however, unforseen circumstances can still occur requiring dynamic delegation to be specified at runtime. This paper presents bot... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • XPath Query Relaxation through Rewriting Rules

    Publication Year: 2011, Page(s):1583 - 1600
    Cited by:  Papers (3)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (2044 KB) | HTML iconHTML Multimedia Media

    Query relaxation is the process of weakening a query to a more general one, and it is frequently employed to support approximate query answering. In this paper, rewriting systems for a wide fragment of XPath are investigated, which accomplish query relaxation through the application of simple rewriting rules transforming navigational axes and node tests into relaxed ones. Specifically, a general y... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • TKDE Information for authors

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

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