By Topic

IEEE Transactions on Knowledge and Data Engineering

Issue 1 • Date Jan. 2004

Filter Results

Displaying Results 1 - 17 of 17
  • Performance evaluation of an optimal cache replacement policy for wireless data dissemination

    Publication Year: 2004, Page(s):125 - 139
    Cited by:  Papers (42)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1173 KB) | HTML iconHTML

    Data caching at mobile clients is an important technique for improving the performance of wireless data dissemination systems. However, variable data sizes, data updates, limited client resources, and frequent client disconnections make cache management a challenge. We propose a gain-based cache replacement policy, Min-SAUD, for wireless data dissemination when cache consistency must be enforced b... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Demand-driven caching in multiuser environment

    Publication Year: 2004, Page(s):112 - 124
    Cited by:  Papers (3)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (950 KB) | HTML iconHTML

    We propose a novel demand-driven caching framework, called cache-on-demand (CoD). In CoD, intermediate/final answers of existing running queries are viewed as virtual caches that can be materialized if they are beneficial to incoming queries. Such an approach is essentially nonspeculative: the exact cost of investment and the return on investment are known, and the cache is certain to be reused! W... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Mining Web informative structures and contents based on entropy analysis

    Publication Year: 2004, Page(s):41 - 55
    Cited by:  Papers (33)  |  Patents (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (2033 KB) | HTML iconHTML

    We study the problem of mining the informative structure of a news Web site that consists of thousands of hyperlinked documents. We define the informative structure of a news Web site as a set of index pages (or referred to as TOC, i.e., table of contents, pages) and a set of article pages linked by these TOC pages. Based on the Hyperlink Induced Topics Search (HITS) algorithm, we propose an entro... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Domain-specific Web search with keyword spices

    Publication Year: 2004, Page(s):17 - 27
    Cited by:  Papers (40)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (526 KB) | HTML iconHTML

    Domain-specific Web search engines are effective tools for reducing the difficulty experienced when acquiring information from the Web. Existing methods for building domain-specific Web search engines require human expertise or specific facilities. However, we can build a domain-specific search engine simply by adding domain-specific keywords, called "keyword spices," to the user's input query and... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • An enhanced concurrency control scheme for multidimensional index structures

    Publication Year: 2004, Page(s):97 - 111
    Cited by:  Papers (10)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1492 KB) | HTML iconHTML

    We propose an enhanced concurrency control algorithm that maximizes the concurrency of multidimensional index structures. The factors that deteriorate the concurrency of index structures are node splits and minimum bounding region (MBR) updates in multidimensional index structures. The properties of our concurrency control algorithm are as follows: First, to increase the concurrency by avoiding lo... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Probabilistic memory-based collaborative filtering

    Publication Year: 2004, Page(s):56 - 69
    Cited by:  Papers (61)  |  Patents (7)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1061 KB) | HTML iconHTML

    Memory-based collaborative filtering (CF) has been studied extensively in the literature and has proven to be successful in various types of personalized recommender systems. In this paper, we develop a probabilistic framework for memory-based CF (PMCF). While this framework has clear links with classical memory-based CF, it allows us to find principled solutions to known problems of CF-based reco... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Personalized Web search for improving retrieval effectiveness

    Publication Year: 2004, Page(s):28 - 40
    Cited by:  Papers (74)  |  Patents (23)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1140 KB) | HTML iconHTML

    Current Web search engines are built to serve all users, independent of the special needs of any individual user. Personalization of Web search is to carry out retrieval for each user incorporating his/her interests. We propose a novel technique to learn user profiles from users' search histories. The user profiles are then used to improve retrieval effectiveness in Web search. A user profile and ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Guest editors' introduction: special section on mining and searching the web

    Publication Year: 2004, Page(s):2 - 3
    Request permission for commercial reuse | PDF file iconPDF (199 KB) | HTML iconHTML
    Full text access may be available. Click article title to sign in or learn about subscription options.
  • PEBL: Web page classification without negative examples

    Publication Year: 2004, Page(s):70 - 81
    Cited by:  Papers (62)  |  Patents (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (534 KB) | HTML iconHTML

    Web page classification is one of the essential techniques for Web mining because classifying Web pages of an interesting class is often the first step of mining the Web. However, constructing a classifier for an interesting class requires laborious preprocessing such as collecting positive and negative training examples. For instance, in order to construct a "homepage" classifier, one needs to co... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A unified probabilistic framework for Web page scoring systems

    Publication Year: 2004, Page(s):4 - 16
    Cited by:  Papers (25)  |  Patents (13)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1061 KB) | HTML iconHTML

    The definition of efficient page ranking algorithms is becoming an important issue in the design of the query interface of Web search engines. Information flooding is a common experience especially when broad topic queries are issued. Queries containing only one or two keywords usually match a huge number of documents, while users can only afford to visit the first positions of the returned list, ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • An efficient and scalable algorithm for clustering XML documents by structure

    Publication Year: 2004, Page(s):82 - 96
    Cited by:  Papers (59)  |  Patents (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1801 KB) | HTML iconHTML

    With the standardization of XML as an information exchange language over the Internet, a huge amount of information is formatted in XML documents. In order to analyze this information efficiently, decomposing the XML documents and storing them in relational tables is a popular practice. However, query processing becomes expensive since, in many cases, an excessive number of joins is required to re... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • IEEE Transactions on Knowledge and Data Engineering - Table of Contents

    Publication Year: 2004, Page(s): 0_1
    Request permission for commercial reuse | PDF file iconPDF (279 KB)
    Freely Available from IEEE
  • IEEE Computer Society's Staff List

    Publication Year: 2004, Page(s): 0_2
    Request permission for commercial reuse | PDF file iconPDF (221 KB)
    Freely Available from IEEE
  • Editorial: state of the transactions

    Publication Year: 2004, Page(s): 1
    Cited by:  Papers (56)
    Request permission for commercial reuse | PDF file iconPDF (183 KB)
    Freely Available from IEEE
  • 2003 Reviewers list

    Publication Year: 2004, Page(s):140 - 143
    Request permission for commercial reuse | PDF file iconPDF (179 KB)
    Freely Available from IEEE
  • TKDE: Information for authors

    Publication Year: 2004, Page(s): 145
    Request permission for commercial reuse | PDF file iconPDF (220 KB)
    Freely Available from IEEE
  • IEEE Computer Society's Information

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