By Topic

IEEE Transactions on Knowledge and Data Engineering

Issue 9 • Sept. 2004

Filter Results

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

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

    Publication Year: 2004, Page(s): c2
    Request permission for commercial reuse | PDF file iconPDF (58 KB)
    Freely Available from IEEE
  • EIC Editorial

    Publication Year: 2004, Page(s): 1025
    Request permission for commercial reuse | PDF file iconPDF (74 KB) | HTML iconHTML
    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Privacy-preserving distributed mining of association rules on horizontally partitioned data

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

    Data mining can extract important knowledge from large data collections ut sometimes these collections are split among various parties. Privacy concerns may prevent the parties from directly sharing the data and some types of information about the data. We address secure mining of association rules over horizontally partitioned data. The methods incorporate cryptographic techniques to minimize the... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • An efficient algorithm for discovering frequent subgraphs

    Publication Year: 2004, Page(s):1038 - 1051
    Cited by:  Papers (96)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1136 KB) | HTML iconHTML

    Over the years, frequent itemset discovery algorithms have been used to find interesting patterns in various application areas. However, as data mining techniques are being increasingly applied to nontraditional domains, existing frequent pattern discovery approaches cannot be used. This is because the transaction framework that is assumed by these algorithms cannot be used to effectively model th... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Mining frequent itemsets without support threshold: with and without item constraints

    Publication Year: 2004, Page(s):1052 - 1069
    Cited by:  Papers (39)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (2488 KB) | HTML iconHTML

    In classical association rules mining, a minimum support threshold is assumed to be available for mining frequent itemsets. However, setting such a threshold is typically hard. We handle a more practical problem; roughly speaking, it is to mine N k-itemsets with the highest supports for k up to a certain kmax value. We call the results the N-most interesting itemsets. Generally, it is m... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Correct execution of transactions at different isolation levels

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

    Many transaction processing applications execute at isolation levels lower than SERIALIZABLE in order to increase throughput and reduce response time. However, the resulting schedules might not be serializable and, hence, not necessarily correct. The semantics of a particular application determines whether that application will run correctly at a lower level and, in practice, it appears that many ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Distributed and reactive query planning in R-MAGIC: an agent-based multimedia retrieval system

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

    We present the planning scheme for a cooperative agent-based multimedia retrieval architecture that integrates a heterogeneous set of repositories into a coherent information system. The agents in the system collaborate in context of a conceptual query to formulate unique retrieval strategies for the different collections. The retrieval plan makes need-based use of independent content analysis too... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Incremental maintenance of schema-restructuring views in SchemaSQL

    Publication Year: 2004, Page(s):1096 - 1111
    Cited by:  Papers (4)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1960 KB) | HTML iconHTML

    The integration of data, especially from heterogeneous sources, is a hard and widely studied problem. One particularly challenging issue is the integration of sources that are semantically equivalent but schematically heterogeneous. While two such data sources may represent the same information, one may store the information inside tuples (data) while the other may store it in attribute or relatio... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Querying imprecise data in moving object environments

    Publication Year: 2004, Page(s):1112 - 1127
    Cited by:  Papers (156)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1296 KB) | HTML iconHTML

    In moving object environments, it is infeasible for the database tracking the movement of objects to store the exact locations of objects at all times. Typically, the location of an object is known with certainty only at the time of the update. The uncertainty in its location increases until the next update. In this environment, it is possible for queries to produce incorrect results based upon ol... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Workflow mining: discovering process models from event logs

    Publication Year: 2004, Page(s):1128 - 1142
    Cited by:  Papers (524)  |  Patents (10)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (872 KB) | HTML iconHTML

    Contemporary workflow management systems are driven by explicit process models, i.e., a completely specified workflow design is required in order to enact a given workflow process. Creating a workflow design is a complicated time-consuming process and, typically, there are discrepancies between the actual workflow processes and the processes as perceived by the management. Therefore, we have devel... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Dependent data broadcasting for unordered queries in a multiple channel mobile environment

    Publication Year: 2004, Page(s):1143 - 1156
    Cited by:  Papers (43)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1328 KB) | HTML iconHTML

    Data broadcast is a promising technique to improve the bandwidth utilization and conserve the power consumption in a mobile computing environment. In many applications, the data items broadcast are dependent upon one another. However, most prior studies on broadcasting dependent data are restricted to a single broadcast channel environment, and as a consequence, the results are of limited applicab... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Metadata for anomaly-based security protocol attack deduction

    Publication Year: 2004, Page(s):1157 - 1168
    Cited by:  Papers (7)  |  Patents (2)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (584 KB) | HTML iconHTML

    Anomaly-based intrusion detection systems (IDS) have been widely recognized for their potential to prevent and reduce damage to information systems. In order to build their profiles and to generate their requisite behavior observations, these systems rely on access to payload data, either in the network or on the host system. With the growing reliance on encryption technology, less and less payloa... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • [Back inside cover]

    Publication Year: 2004, Page(s): c3
    Request permission for commercial reuse | PDF file iconPDF (31 KB)
    Freely Available from IEEE
  • [Back cover]

    Publication Year: 2004, Page(s): c4
    Request permission for commercial reuse | PDF file iconPDF (100 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
Xuemin Lin
University of New South Wales

Associate Editor-in-Chief
Lei Chen
Hong Kong University of Science and Technology