By Topic

IEEE Transactions on Knowledge and Data Engineering

Issue 4 • Date April 2004

Filter Results

Displaying Results 1 - 17 of 17
  • An approach to novelty detection applied to the classification of image regions

    Publication Year: 2004, Page(s):396 - 407
    Cited by:  Papers (47)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1037 KB) | HTML iconHTML

    We present a new framework for novelty detection. The framework evaluates neural networks as adaptive classifiers that are capable of novelty detection and retraining on the basis of newly discovered information. We apply our newly developed model to the application area of object recognition in video. We detail the tools and methods needed for novelty detection such that data from unknown classes... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A support vector machine with a hybrid kernel and minimal Vapnik-Chervonenkis dimension

    Publication Year: 2004, Page(s):385 - 395
    Cited by:  Papers (49)  |  Patents (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (578 KB) | HTML iconHTML

    We present a mechanism to train support vector machines (SVMs) with a hybrid kernel and minimal Vapnik-Chervonenkis (VC) dimension. After describing the VC dimension of sets of separating hyperplanes in a high-dimensional feature space produced by a mapping related to kernels from the input space, we proposed an optimization criterion to design SVMs by minimizing the upper bound of the VC dimensio... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Discovery of context-specific ranking functions for effective information retrieval using genetic programming

    Publication Year: 2004, Page(s):523 - 527
    Cited by:  Papers (28)  |  Patents (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (500 KB) | HTML iconHTML

    The Internet and corporate intranets have brought a lot of information. People usually resort to search engines to find required information. However, these systems tend to use only one fixed ranking strategy regardless of the contexts. This poses serious performance problems when characteristics of different users, queries, and text collections are taken into account. We argue that the ranking st... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Association rule hiding

    Publication Year: 2004, Page(s):434 - 447
    Cited by:  Papers (147)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1346 KB) | HTML iconHTML

    Large repositories of data contain sensitive information that must be protected against unauthorized access. The protection of the confidentiality of this information has been a long-term goal for the database security research community and for the government statistical agencies. Recent advances in data mining and machine learning algorithms have increased the disclosure risks that one may encou... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Image retrieval using multiple evidence ranking

    Publication Year: 2004, Page(s):408 - 417
    Cited by:  Papers (24)  |  Patents (4)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (639 KB) | HTML iconHTML

    The World Wide Web is the largest publicly available image repository and a natural source of attention. An immediate consequence is that searching for images on the Web has become a current and important task. To search for images of interest, the most direct approach is keyword-based searching. However, since images on the Web are poorly labeled, direct application of standard keyword-based imag... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A strip-splitting-based optimal algorithm for decomposing a query window into maximal quadtree blocks

    Publication Year: 2004, Page(s):519 - 523
    Cited by:  Papers (8)  |  Patents (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (395 KB) | HTML iconHTML

    Decomposing a query window into maximal quadtree blocks is a fundamental problem in quadtree-based spatial database. Recently, Proietti presented the first optimal algorithm for solving this problem. Given a query window of size n1×n2, Proietti's algorithm takes O(n1) time, where n1=max(n1, n2). Based on a strip-splitting appr... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A human-computer interactive method for projected clustering

    Publication Year: 2004, Page(s):448 - 460
    Cited by:  Papers (9)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1898 KB) | HTML iconHTML

    Clustering is a central task in data mining applications such as customer segmentation. High-dimensional data has always been a challenge for clustering algorithms because of the inherent sparsity of the points. Therefore, techniques have recently been proposed to find clusters in hidden subspaces of the data. However, since the behavior of the data can vary considerably in different subspaces, it... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Optimizing similarity search for arbitrary length time series queries

    Publication Year: 2004, Page(s):418 - 433
    Cited by:  Papers (8)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (870 KB) | HTML iconHTML

    We consider the problem of finding similar patterns in a time sequence. Typical applications of this problem involve large databases consisting of long time sequences of different lengths. Current time sequence search techniques work well for queries of a prespecified length, but not for arbitrary length queries. We propose a novel indexing technique that works well for arbitrary length queries. T... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • iJADE Web-miner: an intelligent agent framework for Internet shopping

    Publication Year: 2004, Page(s):461 - 473
    Cited by:  Papers (11)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1195 KB) | HTML iconHTML

    There is growing interest in using intelligent software agents for a variety of tasks, including navigating and retrieving information from the Internet and from databases, online shopping activities, user authentication, negotiation for resources, and decision making. We propose an integrated framework for information retrieval and information filtering in the context of Internet shopping. We foc... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Distributed evaluation of network directory queries

    Publication Year: 2004, Page(s):474 - 486
    Cited by:  Papers (5)  |  Patents (5)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (614 KB) | HTML iconHTML

    We describe novel efficient techniques for the distributed evaluation of hierarchical aggregate selection queries over LDAP directory data, distributed across multiple autonomous directory servers. Such queries are useful for emerging applications like the directory enabled networks initiative. Our techniques follow the LDAP approach of distributed query evaluation by referrals, where each relevan... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Optimal models of disjunctive logic programs: semantics, complexity, and computation

    Publication Year: 2004, Page(s):487 - 503
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (564 KB) | HTML iconHTML

    Almost all semantics for logic programs with negation identify a set, SEM(P), of models of program P, as the intended semantics of P, and any model M in this class is considered a possible meaning of P with regard to the semantics the user has in mind. Thus, for example, in the case of stable models [M. Gelfond et al., (1988)], choice models [D. Sacca et al., (1990)], answer sets [M. Gelfond et al... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • The vagabond approach to logging and recovery in transaction-time temporal object database systems

    Publication Year: 2004, Page(s):504 - 518
    Cited by:  Papers (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (573 KB) | HTML iconHTML

    In most current database systems, data is updated in-place. In order to support recovery and increase performance, write-ahead logging is used. This logging defers the in-place updates. However, sooner or later, the updates have to be applied to the database. Even if this is done as a batch operation, it can result in many nonsequential writes. In order to avoid this, another approach is to elimin... 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

    Publication Year: 2004, Page(s): 0_1
    Request permission for commercial reuse | PDF file iconPDF (269 KB)
    Freely Available from IEEE
  • IEEE Knowledge and Data Engineering - Society Staff List

    Publication Year: 2004, Page(s): 0_2
    Request permission for commercial reuse | PDF file iconPDF (210 KB)
    Freely Available from IEEE
  • Call for Papers

    Publication Year: 2004, Page(s): 519
    Request permission for commercial reuse | PDF file iconPDF (163 KB) | HTML iconHTML
    Freely Available from IEEE
  • Information fo Authors

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

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