By Topic

IEEE Transactions on Knowledge and Data Engineering

Issue 4 • July-Aug. 2003

Filter Results

Displaying Results 1 - 25 of 27
  • Guest editors' introduction

    Publication Year: 2003, Page(s):769 - 770
    Request permission for commercial reuse | PDF file iconPDF (209 KB) | HTML iconHTML
    Freely Available from IEEE
  • The Subgraph Bisimulation Problem

    Publication Year: 2003, Page(s):1055 - 1056
    Cited by:  Papers (9)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (211 KB) | HTML iconHTML

    We study the complexity of the Subgraph Bisimulation Problem, which relates to Graph Bisimulation as Subgraph Isomorphism relates to Graph Isomorphism, and we prove its NP-Completeness. Our analysis is motivated by its applications to semistructured databases. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • In-place reconstruction of version differences

    Publication Year: 2003, Page(s):973 - 984
    Cited by:  Papers (5)  |  Patents (18)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1632 KB) | HTML iconHTML

    In-place reconstruction of differenced data allows information on devices with limited storage capacity to be updated efficiently over low-bandwidth channels. Differencing encodes a version of data compactly as a set of changes from a previous version. Transmitting updates to data as a version difference saves both time and bandwidth. In-place reconstruction rebuilds the new version of the data in... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • External sorting: run formation revisited

    Publication Year: 2003, Page(s):961 - 972
    Cited by:  Papers (11)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1929 KB) | HTML iconHTML

    External mergesort begins with a run formation phase creating the initial sorted runs. Run formation can be done by a load-sort-store algorithm or by replacement selection. A load-sort-store algorithm repeatedly fills available memory with input records, sorts them, and writes the result to a run file. Replacement selection produces longer runs than load-sort-store algorithms and completely overla... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Peculiarity oriented multidatabase mining

    Publication Year: 2003, Page(s):952 - 960
    Cited by:  Papers (90)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (352 KB) | HTML iconHTML

    Peculiarity rules are a new class of rules which can be discovered by searching relevance among a relatively small number of peculiar data. Peculiarity oriented mining in multiple data sources is different from, and complementary to, existing approaches for discovering new, surprising, and interesting patterns hidden in data. A theoretical framework for peculiarity oriented mining is presented. Wi... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Query expansion by mining user logs

    Publication Year: 2003, Page(s):829 - 839
    Cited by:  Papers (114)  |  Patents (7)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (836 KB) | HTML iconHTML

    Queries to search engines on the Web are usually short. They do not provide sufficient information for an effective selection of relevant documents. Previous research has proposed the utilization of query expansion to deal with this problem. However, expansion terms are usually determined on term co-occurrences within documents. In this study, we propose a new method for query expansion based on u... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Effectively finding relevant Web pages from linkage information

    Publication Year: 2003, Page(s):940 - 951
    Cited by:  Papers (33)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1073 KB) | HTML iconHTML

    This paper presents two hyperlink analysis-based algorithms to find relevant pages for a given Web page (URL). The first algorithm comes from the extended cocitation analysis of the Web pages. It is intuitive and easy to implement. The second one takes advantage of linear algebra theories to reveal deeper relationships among the Web pages and to identify relevant pages more precisely and effective... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Scalable consistency maintenance in content distribution networks using cooperative leases

    Publication Year: 2003, Page(s):813 - 828
    Cited by:  Papers (17)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (3193 KB) | HTML iconHTML

    We argue that cache consistency mechanisms designed for stand-alone proxies do not scale to the large number of proxies in a content distribution network and are not flexible enough to allow consistency guarantees to be tailored to object needs. To meet the twin challenges of scalability and flexibility, we introduce the notion of cooperative consistency along with a mechanism, called cooperative ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Temporal probabilistic object bases

    Publication Year: 2003, Page(s):921 - 939
    Cited by:  Papers (6)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (920 KB) | HTML iconHTML

    There are numerous applications where we have to deal with temporal uncertainty associated with objects. The ability to automatically store and manipulate time, probabilities, and objects is important. We propose a data model and algebra for temporal probabilistic object bases (TPOBs), which allows us to specify the probability with which an event occurs at a given time point. In explicit TPOB-ins... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • The Yin/Yang Web: a unified model for XML syntax and RDF semantics

    Publication Year: 2003, Page(s):797 - 812
    Cited by:  Papers (10)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1816 KB) | HTML iconHTML

    XML is the W3C standard document format for writing and exchanging information on the Web. RDF is the W3C standard model for describing the semantics and reasoning about information on the Web. Unfortunately, RDF and XML-although very close to each other-are based on two different paradigms. We argue that, in order to lead the Semantic Web to its full potential, the syntax and the semantics of inf... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Progressive partition miner: an efficient algorithm for mining general temporal association rules

    Publication Year: 2003, Page(s):1004 - 1017
    Cited by:  Papers (24)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (2205 KB) | HTML iconHTML

    We explore a new problem of mining general temporal association rules in publication databases. In essence, a publication database is a set of transactions where each transaction T is a set of items of which each item contains an individual exhibition period. The current model of association rule mining is not able to handle the publication database due to the following fundamental problems, i.e.,... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Searching with numbers

    Publication Year: 2003, Page(s):855 - 870
    Cited by:  Papers (4)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (4423 KB) | HTML iconHTML

    A large fraction of the useful Web is comprised of specification documents that largely consist of (attribute name, numeric value) pairs embedded in text. Examples include product information, classified advertisements, resumes, etc. The approach taken in the past to search these documents by first establishing correspondences between values and their names has achieved limited success because of ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Applying automatically derived gene-groups to automatically predict and refine metabolic pathways

    Publication Year: 2003, Page(s):883 - 894
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (5244 KB) | HTML iconHTML

    This paper describes an automated technique to predict integrated pathways and refine existing metabolic pathways using the information of automatically derived, functionally similar gene-groups and orthologs (functionally equivalent genes) derived by the comparison of complete microbial genomes archived in GenBank. The described method integrates automatically derived orthologous and homologous g... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Image representations and feature selection for multimedia database search

    Publication Year: 2003, Page(s):911 - 920
    Cited by:  Papers (28)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1511 KB) | HTML iconHTML

    The success of a multimedia information system depends heavily on the way the data is represented. Although there are "natural" ways to represent numerical data, it is not clear what is a good way to represent multimedia data, such as images, video, or sound. We investigate various image representations where the quality of the representation is judged based on how well a system for searching thro... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Topic-sensitive PageRank: a context-sensitive ranking algorithm for Web search

    Publication Year: 2003, Page(s):784 - 796
    Cited by:  Papers (275)  |  Patents (70)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (659 KB) | HTML iconHTML

    The original PageRank algorithm for improving the ranking of search-query results computes a single vector, using the link structure of the Web, to capture the relative "importance" of Web pages, independent of any particular search query. To yield more accurate search results, we propose computing a set of PageRank vectors, biased using a set of representative topics, to capture more accurately t... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • On agent-mediated electronic commerce

    Publication Year: 2003, Page(s):985 - 1003
    Cited by:  Papers (170)  |  Patents (3)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1037 KB) | HTML iconHTML

    This paper surveys and analyzes the state of the art of agent-mediated electronic commerce (e-commerce), concentrating particularly on the business-to-consumer (B2C) and business-to-business (B2B) aspects. From the consumer buying behavior perspective, agents are being used in the following activities: need identification, product brokering, buyer coalition formation, merchant brokering, and negot... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Managing and sharing servants' reputations in P2P systems

    Publication Year: 2003, Page(s):840 - 854
    Cited by:  Papers (98)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1875 KB) | HTML iconHTML

    Peer-to-peer information sharing environments are increasingly gaining acceptance on the Internet as they provide an infrastructure in which the desired information can be located and downloaded while preserving the anonymity of both requestors and providers. As recent experience with P2P environments such as Gnutella shows, anonymity opens the door to possible misuses and abuses by resource provi... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Using optimistic atomic broadcast in transaction processing systems

    Publication Year: 2003, Page(s):1018 - 1032
    Cited by:  Papers (31)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (2509 KB) | HTML iconHTML

    Atomic broadcast primitives are often proposed as a mechanism to allow fault-tolerant cooperation between sites in a distributed system. Unfortunately, the delay incurred before a message can be delivered makes it difficult to implement high performance, scalable applications on top of atomic broadcast primitives. Recently, a new approach has been proposed for atomic broadcast which, based on opti... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • An approach for measuring semantic similarity between words using multiple information sources

    Publication Year: 2003, Page(s):871 - 882
    Cited by:  Papers (348)  |  Patents (2)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1066 KB) | HTML iconHTML

    Semantic similarity between words is becoming a generic problem for many applications of computational linguistics and artificial intelligence. This paper explores the determination of semantic similarity by a number of information sources, which consist of structural semantic information from a lexical taxonomy and information content from a corpus. To investigate how information sources could be... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Buffer queries

    Publication Year: 2003, Page(s):895 - 910
    Cited by:  Papers (5)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (6753 KB) | HTML iconHTML

    A class of commonly asked queries in a spatial database is known as buffer queries. An example of such a query is to "find house-power line pairs that are within 50 meters of each other." A buffer query involves two spatial data sets and a distance d. The answer to this query are pairs of objects, one from each input set, that are within distance d of each other. Given nonpoint spatial objects, ev... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Specifying and enforcing application-level Web security policies

    Publication Year: 2003, Page(s):771 - 783
    Cited by:  Papers (16)  |  Patents (13)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (624 KB) | HTML iconHTML

    Application-level Web security refers to vulnerabilities inherent in the code of a Web-application itself (irrespective of the technologies in which it is implemented or the security of the Web-server/back-end database on which it is built). In the last few months, application-level vulnerabilities have been exploited with serious consequences: Hackers have tricked e-commerce sites into shipping g... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • On-demand forecasting of stock prices using a real-time predictor

    Publication Year: 2003, Page(s):1033 - 1037
    Cited by:  Papers (16)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (545 KB) | HTML iconHTML

    This paper presents a fuzzy stochastic prediction method for real-time predicting of stock prices. A complete contrast to the crisp stochastic method, it requires a fuzzy linguistic summary approach to computing parameters. This approach, which is found to be better than the gray prediction method, can eliminate outliers and limit the data to a normal condition for prediction, with a comparatively... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Stability analysis of regional and national voting schemes by a continuous model

    Publication Year: 2003, Page(s):1037 - 1042
    Cited by:  Papers (12)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (382 KB) | HTML iconHTML

    The previous discrete-model-based stability analysis of regional and national voting has been extended to a continuous-model-based analysis in the simultaneous presence of white and concentrated components of noise, reconfirming the previous conclusion that regional voting with smaller sized regions always demonstrates an improved stability over those with larger sized regions, including the natio... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A polynomial algorithm for optimal univariate microaggregation

    Publication Year: 2003, Page(s):1043 - 1044
    Cited by:  Papers (62)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (215 KB) | HTML iconHTML

    Microaggregation is a technique used by statistical agencies to limit disclosure of sensitive microdata. Noting that no polynomial algorithms are known to microaggregate optimally, Domingo-Ferrer and Mateo-Sanz have presented heuristic microaggregation methods. This paper is the first to present an efficient polynomial algorithm for optimal univariate microaggregation. Optimal partitions are shown... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Image retrieval based on regions of interest

    Publication Year: 2003, Page(s):1045 - 1049
    Cited by:  Papers (45)  |  Patents (4)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1876 KB) | HTML iconHTML

    Query-by-example is the most popular query model in recent content-based image retrieval (CBIR) systems. A typical query image includes relevant objects (e.g., Eiffel Tower), but also irrelevant image areas (including background). The irrelevant areas limit the effectiveness of existing CBIR systems. To overcome this limitation, the system must be able to determine similarity based on relevant reg... View full abstract»

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

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