Scheduled System Maintenance
On Friday, October 20, IEEE Xplore will be unavailable from 9:00 PM-midnight ET. We apologize for the inconvenience.
Notice: There is currently an issue with the citation download feature. Learn more.

IEEE Transactions on Knowledge and Data Engineering

Issue 11 • Nov. 2010

Filter Results

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

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

    Publication Year: 2010, Page(s): c2
    Request permission for commercial reuse | PDF file iconPDF (197 KB)
    Freely Available from IEEE
  • Guest Editors' Introduction: Rule Representation, Interchange, and Reasoning in Distributed, Heterogeneous Environments

    Publication Year: 2010, Page(s):1489 - 1491
    Cited by:  Papers (3)
    Request permission for commercial reuse | PDF file iconPDF (124 KB) | HTML iconHTML
    Freely Available from IEEE
  • Defeasible Contextual Reasoning with Arguments in Ambient Intelligence

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

    The imperfect nature of context in Ambient Intelligence environments and the special characteristics of the entities that possess and share the available context information render contextual reasoning a very challenging task. The accomplishment of this task requires formal models that handle the involved entities as autonomous logic-based agents and provide methods for handling the imperfect and ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A Rule-Based Trust Negotiation System

    Publication Year: 2010, Page(s):1507 - 1520
    Cited by:  Papers (8)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1347 KB) | HTML iconHTML

    Open distributed environments, such as the World Wide Web, facilitate information sharing but provide limited support to the protection of sensitive information and resources. Trust negotiation (TN) frameworks have been proposed as a better solution for open environments, in which parties may get in touch and interact without being previously known to each other. In this paper, we illustrate Protu... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Efficient Lazy Evaluation of Rule-Based Programs

    Publication Year: 2010, Page(s):1521 - 1534
    Cited by:  Papers (4)  |  Patents (2)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1462 KB) | HTML iconHTML

    Thirty years after Forgy's seminal dissertation, Rete remains the de facto standard matching algorithm. Despite promising research results, alternative algorithms such as TREAT and LEAPS have had little impact on modern production rule engines. Constraint Handling Rules (CHR) is a high-level, declarative programming language, similar to production rules. In recent years, CHR has increasingly been ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A Configurable Rete-OO Engine for Reasoning with Different Types of Imperfect Information

    Publication Year: 2010, Page(s):1535 - 1548
    Cited by:  Papers (17)  |  Patents (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1826 KB) | HTML iconHTML

    The RETE algorithm is a very efficient option for the development of a rule-based system, but it supports only boolean, first order logic. Many real-world contexts, instead, require some degree of vagueness or uncertainty to be handled in a robust and efficient manner, imposing a trade-off between the number of rules and the cases that can be handled with sufficient accuracy. Thus, in the first pa... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Integrated Rule-Based Learning and Inference

    Publication Year: 2010, Page(s):1549 - 1562
    Cited by:  Papers (6)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1777 KB) | HTML iconHTML

    Neurules are a kind of integrated rules integrating neurocomputing and production rules. Each neurule is represented as an adaline unit. Thus, the corresponding neurule base consists of a number of autonomous adaline units (neurules). In this paper, we present the construction process and the inference mechanism of neurules and explore their generalization capabilities. The construction process, w... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A Deductive Spreadsheet System for End Users

    Publication Year: 2010, Page(s):1563 - 1576
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (2755 KB) | HTML iconHTML

    We exploit the spreadsheet metaphor to make deductive problem-solving methods available to the vast population of spreadsheet end users. In particular, we show how the function-based problem-solving capabilities of spreadsheets can be extended to include logical deductive methods in a way that is consistent with the existing spreadsheet "look and feel." We also show a spreadsheet-based framework f... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A Novel Combination of Answer Set Programming with Description Logics for the Semantic Web

    Publication Year: 2010, Page(s):1577 - 1592
    Cited by:  Papers (13)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (624 KB) | HTML iconHTML Multimedia Media

    We present a novel combination of disjunctive programs under the answer set semantics with description logics for the Semantic Web. The combination is based on a well-balanced interface between disjunctive programs and description logics, which guarantees the decidability of the resulting formalism without assuming syntactic restrictions. We show that the new formalism has very nice semantic prope... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A Guide to the Basic Logic Dialect for Rule Interchange on the Web

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

    The W3C Rule Interchange Format (RIF) is a forthcoming standard for exchanging rules among different systems and developing intelligent rule-based applications for the Semantic Web. The RIF architecture is conceived as a family of languages, called dialects. A RIF dialect is a rule-based language with an XML syntax and a well-defined semantics. The RIF Basic Logic Dialect (RIF-BLD) semantically co... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Dictionary-Based Compression for Long Time-Series Similarity

    Publication Year: 2010, Page(s):1609 - 1622
    Cited by:  Papers (9)  |  Patents (3)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1928 KB) | HTML iconHTML

    Long time-series data sets are common in many domains, especially scientific domains. Applications in these fields often require comparing trajectories using similarity measures. Existing methods perform well for short time series but their evaluation cost degrades rapidly for longer time series. In this work, we develop a new time-series similarity measure called the Dictionary Compression Score ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • From t-Closeness-Like Privacy to Postrandomization via Information Theory

    Publication Year: 2010, Page(s):1623 - 1636
    Cited by:  Papers (35)  |  Patents (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1483 KB) | HTML iconHTML

    t-Closeness is a privacy model recently defined for data anonymization. A data set is said to satisfy t-closeness if, for each group of records sharing a combination of key attributes, the distance between the distribution of a confidential attribute in the group and the distribution of the attribute in the entire data set is no more than a threshold t. Here, we define a privacy measure in terms o... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Unsupervised Semantic Similarity Computation between Terms Using Web Documents

    Publication Year: 2010, Page(s):1637 - 1647
    Cited by:  Papers (26)  |  Patents (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1830 KB) | HTML iconHTML

    In this work, Web-based metrics that compute the semantic similarity between words or terms are presented and compared with the state of the art. Starting from the fundamental assumption that similarity of context implies similarity of meaning, relevant Web documents are downloaded via a Web search engine and the contextual information of words of interest is compared (context-based similarity met... View full abstract»

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

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

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

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