By Topic

IEEE Transactions on Knowledge and Data Engineering

Issue 1 • Jan. 2005

Filter Results

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

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

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

    Publication Year: 2005, Page(s):1 - 2
    Cited by:  Papers (17)
    Request permission for commercial reuse | PDF file iconPDF (51 KB) | HTML iconHTML
    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Editorial: A Message from the New Editor-in-Chief

    Publication Year: 2005, Page(s): 3
    Request permission for commercial reuse | PDF file iconPDF (36 KB) | HTML iconHTML
    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A generalized temporal role-based access control model

    Publication Year: 2005, Page(s):4 - 23
    Cited by:  Papers (231)  |  Patents (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (2864 KB) | HTML iconHTML

    Role-based access control (RBAC) models have generated a great interest in the security community as a powerful and generalized approach to security management. In many practical scenarios, users may be restricted to assume roles only at predefined time periods. Furthermore, roles may only be invoked on prespecified intervals of time depending upon when certain actions are permitted. To capture su... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Selection of views to materialize in a data warehouse

    Publication Year: 2005, Page(s):24 - 43
    Cited by:  Papers (64)  |  Patents (2)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1136 KB) | HTML iconHTML

    A data warehouse stores materialized views of data from one or more sources, with the purpose of efficiently implementing decision-support or OLAP queries. One of the most important decisions in designing a data warehouse is the selection of materialized views to be maintained at the warehouse. The goal is to select an appropriate set of views that minimizes total query response time and the cost ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Semantic approximation of data stream joins

    Publication Year: 2005, Page(s):44 - 59
    Cited by:  Papers (6)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (864 KB) | HTML iconHTML

    We consider the problem of approximating sliding window joins over data streams in a data stream processing system with limited resources. In our model, we deal with resource constraints by shedding load in the form of dropping tuples from the data streams. We make two main contributions. First, we define the problem space by discussing architectural models for data stream join processing and surv... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Pruning and visualizing generalized association rules in parallel coordinates

    Publication Year: 2005, Page(s):60 - 70
    Cited by:  Papers (15)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1400 KB) | HTML iconHTML

    One fundamental problem for visualizing frequent itemsets and association rules is how to present a long border of frequent itemsets in an itemset lattice. Another problem comes from the lack of an effective visual metaphor to represent many-to-many relationships. This work proposes an approach for visualizing frequent itemsets and many-to-many association rules by a novel use of parallel coordina... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Shared memory parallelization of data mining algorithms: techniques, programming interface, and performance

    Publication Year: 2005, Page(s):71 - 89
    Cited by:  Papers (36)  |  Patents (3)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1632 KB) | HTML iconHTML

    With recent technological advances, shared memory parallel machines have become more scalable, and offer large main memories and high bus bandwidths. They are emerging as good platforms for data warehousing and data mining. In This work, we focus on shared memory parallelization of data mining algorithms. We have developed a series of techniques for parallelization of data mining algorithms, inclu... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Constructing suffix tree for gigabyte sequences with megabyte memory

    Publication Year: 2005, Page(s):90 - 105
    Cited by:  Papers (23)  |  Patents (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (2128 KB) | HTML iconHTML

    Mammalian genomes are typically 3 Gbps (gibabase pairs) in size. The largest public database NCBI (National Center for Biotechnology Information (http://www.ncbi.nlm.nih.gov)) of DNA contains more than 20 Gbps. Suffix trees are widely acknowledged as a data structure to support exact/approximate sequence matching queries as well as repetitive structure finding efficiently when they can reside in m... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Improving availability and performance with application-specific data replication

    Publication Year: 2005, Page(s):106 - 120
    Cited by:  Papers (20)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (880 KB) | HTML iconHTML

    The emerging edge services architecture promises to improve the availability and performance of Web services by replicating servers at geographically distributed sites. A key challenge in such systems is data replication and consistency, so that edge server code can manipulate shared data without suffering the availability and performance penalties that would be incurred by accessing a traditional... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Interpretable hierarchical clustering by constructing an unsupervised decision tree

    Publication Year: 2005, Page(s):121 - 132
    Cited by:  Papers (25)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1256 KB) | HTML iconHTML

    We propose a method for hierarchical clustering based on the decision tree approach. As in the case of supervised decision tree, the unsupervised decision tree is interpretable in terms of rules, i.e., each leaf node represents a cluster, and the path from the root node to a leaf node represents a rule. The branching decision at each node of the tree is made based on the clustering tendency of the... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Linear temporal sequences and their interpretation using midpoint relationships

    Publication Year: 2005, Page(s):133 - 135
    Cited by:  Papers (8)  |  Patents (2)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (512 KB) | HTML iconHTML

    The temporal interval relationships formalized by Allen, and later extended to accommodate semiintervals by Freksa, have been widely utilized in both data modeling and artificial intelligence research to facilitate reasoning between the relative temporal ordering of events. In practice, however, some modifications to the relationships are necessary when linear temporal sequences are provided, when... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Mining sequential patterns from multidimensional sequence data

    Publication Year: 2005, Page(s):136 - 140
    Cited by:  Papers (23)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (440 KB) | HTML iconHTML

    The problem addressed in This work is to discover the frequently occurred sequential patterns from databases. Although much work has been devoted to this subject, to the best of our knowledge, no previous research was able to find sequential patterns from d-dimensional sequence data, where d>2. Without such a capability, many practical data would be impossible to mine. For example, an online stock... View full abstract»

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

    Publication Year: 2005, Page(s):141 - 143
    Request permission for commercial reuse | PDF file iconPDF (66 KB)
    Freely Available from IEEE
  • [Advertisement]

    Publication Year: 2005, Page(s): 144
    Request permission for commercial reuse | PDF file iconPDF (407 KB)
    Freely Available from IEEE
  • TKDE Information for authors

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

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