By Topic

IEEE Transactions on Knowledge and Data Engineering

Issue 8 • Date Aug. 2009

Filter Results

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

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

    Publication Year: 2009, Page(s): c2
    Request permission for commercial reuse | PDF file iconPDF (128 KB)
    Freely Available from IEEE
  • Introduction of New Associate Editors

    Publication Year: 2009, Page(s):1089 - 1090
    Request permission for commercial reuse | PDF file iconPDF (118 KB)
    Freely Available from IEEE
  • Lanczos Vectors versus Singular Vectors for Effective Dimension Reduction

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

    This paper takes an in-depth look at a technique for computing filtered matrix-vector (mat-vec) products which are required in many data analysis applications. In these applications, the data matrix is multiplied by a vector and we wish to perform this product accurately in the space spanned by a few of the major singular vectors of the matrix. We examine the use of the Lanczos algorithm for this ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Multirelational k-Anonymity

    Publication Year: 2009, Page(s):1104 - 1117
    Cited by:  Papers (13)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (2505 KB) | HTML iconHTML

    k-anonymity protects privacy by ensuring that data cannot be linked to a single individual. In a k-anonymous data set, any identifying information occurs in at least k tuples. Much research has been done to modify a single-table data set to satisfy anonymity constraints. This paper extends the definitions of k-anonymity to multiple relations and shows that previously proposed methodologies either ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Olex: Effective Rule Learning for Text Categorization

    Publication Year: 2009, Page(s):1118 - 1132
    Cited by:  Papers (8)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (3069 KB) | HTML iconHTML

    This paper describes Olex, a novel method for the automatic induction of rule-based text classifiers. Olex supports a hypothesis language of the form "if T1 or hellip or Tn occurs in document d, and none of T1+n,... Tn+m occurs in d, then classify d under category c," where each Ti is a conjunction of terms. The proposed method is simple and e... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Ranking and Suggesting Popular Items

    Publication Year: 2009, Page(s):1133 - 1146
    Cited by:  Papers (14)  |  Patents (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1717 KB) | HTML iconHTML

    We consider the problem of ranking the popularity of items and suggesting popular items based on user feedback. User feedback is obtained by iteratively presenting a set of suggested items, and users selecting items based on their own preferences either from this suggestion set or from the set of all possible items. The goal is to quickly learn the true popularity ranking of items (unbiased by the... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Similarity-Profiled Temporal Association Mining

    Publication Year: 2009, Page(s):1147 - 1161
    Cited by:  Papers (5)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (3197 KB) | HTML iconHTML

    Given a time stamped transaction database and a user-defined reference sequence of interest over time, similarity-profiled temporal association mining discovers all associated item sets whose prevalence variations over time are similar to the reference sequence. The similar temporal association patterns can reveal interesting relationships of data items which co-occur with a particular event over ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Optimal-Location-Selection Query Processing in Spatial Databases

    Publication Year: 2009, Page(s):1162 - 1177
    Cited by:  Papers (3)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (3599 KB) | HTML iconHTML

    This paper introduces and solves a novel type of spatial queries, namely, optimal-location-selection (OLS) search, which has many applications in real life. Given a data object set DA, a target object set DB, a spatial region R, and a critical distance dc in a multidimensional space, an OLS query retrieves those target objects in DB that are outside R bu... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Evaluating the Effectiveness of Personalized Web Search

    Publication Year: 2009, Page(s):1178 - 1190
    Cited by:  Papers (17)  |  Patents (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (2187 KB) | HTML iconHTML

    Although personalized search has been under way for many years and many personalization algorithms have been investigated, it is still unclear whether personalization is consistently effective on different queries for different users and under different search contexts. In this paper, we study this problem and provide some findings. We present a large-scale evaluation framework for personalized se... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Extracting Takagi-Sugeno Fuzzy Rules with Interpretable Submodels via Regularization of Linguistic Modifiers

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

    In this paper, a method for constructing Takagi-Sugeno (TS) fuzzy system from data is proposed with the objective of preserving TS submodel comprehensibility, in which linguistic modifiers are suggested to characterize the fuzzy sets. A good property held by the proposed linguistic modifiers is that they can broaden the cores of fuzzy sets while contracting the overlaps of adjoining membership fun... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Development of a Software Engineering Ontology for Multisite Software Development

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

    This paper aims to present an ontology model of software engineering to represent its knowledge. The fundamental knowledge relating to software engineering is well described in the textbook entitled Software Engineering by Sommerville that is now in its eighth edition (2004) and the white paper, Software Engineering Body of Knowledge (SWEBOK), by the IEEE (203) upon which software engineering onto... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • RiMOM: A Dynamic Multistrategy Ontology Alignment Framework

    Publication Year: 2009, Page(s):1218 - 1232
    Cited by:  Papers (76)  |  Patents (3)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (2726 KB) | HTML iconHTML

    Ontology alignment identifies semantically matching entities in different ontologies. Various ontology alignment strategies have been proposed; however, few systems have explored how to automatically combine multiple strategies to improve the matching effectiveness. This paper presents a dynamic multistrategy ontology alignment framework, named RiMOM. The key insight in this framework is that simi... 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: 2009, Page(s): c3
    Request permission for commercial reuse | PDF file iconPDF (128 KB)
    Freely Available from IEEE
  • [Back cover]

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