By Topic

Knowledge and Data Engineering, IEEE Transactions on

Issue 3 • Date March 2008

Filter Results

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

    Publication Year: 2008 , Page(s): c1
    Save to Project icon | Request Permissions | PDF file iconPDF (97 KB)  
    Freely Available from IEEE
  • [Inside front cover]

    Publication Year: 2008 , Page(s): c2
    Save to Project icon | Request Permissions | PDF file iconPDF (81 KB)  
    Freely Available from IEEE
  • Using Incremental PLSI for Threshold-Resilient Online Event Analysis

    Publication Year: 2008 , Page(s): 289 - 299
    Cited by:  Papers (13)  |  Patents (1)
    Save to Project icon | Request Permissions | Click to expandAbstract | PDF file iconPDF (2458 KB) |  | HTML iconHTML  

    The goal of online event analysis is to detect events and track their associated documents in real time from a continuous stream of documents generated by multiple information sources. Unlike traditional text categorization methods, event analysis approaches consider the temporal relations among documents. However, such methods suffer from the threshold-dependency problem, so they only perform wel... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • DryadeParent, An Efficient and Robust Closed Attribute Tree Mining Algorithm

    Publication Year: 2008 , Page(s): 300 - 320
    Cited by:  Papers (11)
    Save to Project icon | Request Permissions | Click to expandAbstract | PDF file iconPDF (4762 KB) |  | HTML iconHTML  

    In this paper, we present a new tree mining algorithm, DryadeParent, based on the hooking principle first introduced in DRYADE. In the experiments, we demonstrate that the branching factor and depth of the frequent patterns to find are key factors of complexity for tree mining algorithms, even if often overlooked in previous work. We show that DryadeParent outperforms the current fastest algorithm... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Efficient Similarity Search in Nonmetric Spaces with Local Constant Embedding

    Publication Year: 2008 , Page(s): 321 - 336
    Cited by:  Papers (4)
    Save to Project icon | Request Permissions | Click to expandAbstract | PDF file iconPDF (3714 KB) |  | HTML iconHTML  

    Similarity-based search has been a key factor for many applications such as multimedia retrieval, data mining, Web search and retrieval, and so on. There are two important issues related to the similarity search, namely, the design of a distance function to measure the similarity and improving the search efficiency. Many distance functions have been proposed, which attempt to closely mimic human r... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Materialized Sample Views for Database Approximation

    Publication Year: 2008 , Page(s): 337 - 351
    Cited by:  Papers (6)
    Save to Project icon | Request Permissions | Click to expandAbstract | PDF file iconPDF (2494 KB) |  | HTML iconHTML  

    We consider the problem of creating a sample view of a database table. A sample view is an indexed materialized view that permits efficient sampling from an arbitrary range query over the view. Such "sample views" are very useful in applications that require random samples from a database: approximate query processing, online aggregation, data mining, and randomized algorithms are a few examples. ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Long-Term Cross-Session Relevance Feedback Using Virtual Features

    Publication Year: 2008 , Page(s): 352 - 368
    Cited by:  Papers (10)
    Save to Project icon | Request Permissions | Click to expandAbstract | PDF file iconPDF (5544 KB) |  | HTML iconHTML  

    Relevance feedback (RF) is an iterative process, which refines the retrievals by utilizing the user's feedback on previously retrieved results. Traditional RF techniques solely use the short-term learning experience and do not exploit the knowledge created during cross sessions with multiple users. In this paper, we propose a novel RF framework, which facilitates the combination of short-term and ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • On the Design of Distributed Object Placement and Load Balancing Strategies in Large-Scale Networked Multimedia Storage Systems

    Publication Year: 2008 , Page(s): 369 - 382
    Cited by:  Papers (4)
    Save to Project icon | Request Permissions | Click to expandAbstract | PDF file iconPDF (3571 KB) |  | HTML iconHTML  

    In a large-scale multimedia storage system (LMSS) where client requests for different multimedia objects may have different demands, the placement and replication of the objects is an important factor, as it may result in an imbalance in server loading across the system. Since replication management and load balancing are all the more crucial issues in multimedia systems, in the literature, these ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A Lagrangian Approach for Multiple Personalized Campaigns

    Publication Year: 2008 , Page(s): 383 - 396
    Cited by:  Papers (2)
    Save to Project icon | Request Permissions | Click to expandAbstract | PDF file iconPDF (2763 KB) |  | HTML iconHTML  

    The multicampaign assignment problem is a campaign model to overcome the multiple-recommendation problem that occurs when conducting several personalized campaigns simultaneously. In this paper, we propose a Lagrangian method for the problem. The original problem space is transformed to another simpler one by introducing Lagrange multipliers, which relax the constraints of the multicampaign assign... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A Rule-Based Object-Oriented OWL Reasoner

    Publication Year: 2008 , Page(s): 397 - 410
    Cited by:  Papers (13)  |  Patents (1)
    Save to Project icon | Request Permissions | Click to expandAbstract | PDF file iconPDF (2797 KB) |  | HTML iconHTML  

    In this paper, we describe O-DEVICE, a memory-based knowledge-based system for reasoning and querying OWL ontologies by implementing RDF/OWL entailments in the form of production rules in order to apply the formal semantics of the language. Our approach is based on a transformation procedure of OWL ontologies into an object-oriented schema and the application of inference production rules over the... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Beyond Single-Page Web Search Results

    Publication Year: 2008 , Page(s): 411 - 424
    Cited by:  Papers (11)
    Save to Project icon | Request Permissions | Click to expandAbstract | PDF file iconPDF (6117 KB) |  | HTML iconHTML  

    Given a user keyword query, current Web search engines return a list of individual Web pages ranked by their "goodness" with respect to the query. Thus, the basic unit for search and retrieval is an individual page, even though information on a topic is often spread across multiple pages. This degrades the quality of search results, especially for long or uncorrelated (multitopic) queries (in whic... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Characterizing the MVDs That Hold in a Connected Subtree of a Join Tree: A Correction

    Publication Year: 2008 , Page(s): 425 - 426
    Save to Project icon | Request Permissions | Click to expandAbstract | PDF file iconPDF (117 KB) |  | HTML iconHTML  

    Given an acyclic database scheme R and a connected subtree T of a join tree for R, this paper provides a characterization of the set of multivalued dependencies (MVDs) that hold over T with respect to infinR, the corresponding join dependency (JD) of R. This result corrects an error in one of my previous papers "A Comparative Study of Various Nested Normal Forms," which was published in vol. 14, n... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • The Efficacy of Commutativity-Based Semantic Locking in a Real-World Application

    Publication Year: 2008 , Page(s): 427 - 431
    Cited by:  Papers (2)
    Save to Project icon | Request Permissions | Click to expandAbstract | PDF file iconPDF (1018 KB) |  | HTML iconHTML  

    While the dominant approach to persistent storage in practice is to use a relational DBMS, there are some specialist applications that rely on object stores. The performance of these applications depends on the efficiency of the object store's concurrency control mechanism. Today's predominant concurrency control mechanism is strict two-phase object locking. In the 1980s, an interesting alternativ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • In this issue - Technically

    Publication Year: 2008 , Page(s): 432
    Save to Project icon | Request Permissions | PDF file iconPDF (41 KB)  
    Freely Available from IEEE
  • TKDE Information for authors

    Publication Year: 2008 , Page(s): c3
    Save to Project icon | Request Permissions | PDF file iconPDF (81 KB)  
    Freely Available from IEEE
  • [Back cover]

    Publication Year: 2008 , Page(s): c4
    Save to Project icon | Request Permissions | PDF file iconPDF (97 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