By Topic

IEEE Transactions on Knowledge and Data Engineering

Issue 5 • Date May 2012

Filter Results

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

    Publication Year: 2012, Page(s): c1
    Request permission for commercial reuse | PDF file iconPDF (142 KB)
    Freely Available from IEEE
  • [Cover2]

    Publication Year: 2012, Page(s): c2
    Request permission for commercial reuse | PDF file iconPDF (204 KB)
    Freely Available from IEEE
  • A Framework for Personal Mobile Commerce Pattern Mining and Prediction

    Publication Year: 2012, Page(s):769 - 782
    Cited by:  Papers (5)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1751 KB) | HTML iconHTML

    Due to a wide range of potential applications, research on mobile commerce has received a lot of interests from both of the industry and academia. Among them, one of the active topic areas is the mining and prediction of users' mobile commerce behaviors such as their movements and purchase transactions. In this paper, we propose a novel framework, called Mobile Commerce Explorer (MCE), for mining ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A Query Formulation Language for the Data Web

    Publication Year: 2012, Page(s):783 - 798
    Cited by:  Papers (3)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (4046 KB) | HTML iconHTML

    We present a query formulation language (called MashQL) in order to easily query and fuse structured data on the web. The main novelty of MashQL is that it allows people with limited IT skills to explore and query one (or multiple) data sources without prior knowledge about the schema, structure, vocabulary, or any technical details of these sources. More importantly, to be robust and cover most c... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A Temporal Pattern Search Algorithm for Personal History Event Visualization

    Publication Year: 2012, Page(s):799 - 812
    Cited by:  Papers (2)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1161 KB) | HTML iconHTML

    We present Temporal Pattern Search (TPS), a novel algorithm for searching for temporal patterns of events in historical personal histories. The traditional method of searching for such patterns uses an automaton-based approach over a single array of events, sorted by time stamps. Instead, TPS operates on a set of arrays, where each array contains all events of the same type, sorted by time stamps.... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • An Efficient Formulation of the Improved Visual Assessment of Cluster Tendency (iVAT) Algorithm

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

    The VAT algorithm is a visual method for determining the possible number of clusters in, or the cluster tendency of a set of objects. The improved VAT (iVAT) algorithm uses a graph-theoretic distance transform to improve the effectiveness of the VAT algorithm for “tough” cases where VAT fails to accurately show the cluster tendency. In this paper, we present an efficient formulation ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Anomaly Detection for Discrete Sequences: A Survey

    Publication Year: 2012, Page(s):823 - 839
    Cited by:  Papers (108)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (528 KB) | HTML iconHTML

    This survey attempts to provide a comprehensive and structured overview of the existing research for the problem of detecting anomalies in discrete/symbolic sequences. The objective is to provide a global understanding of the sequence anomaly detection problem and how existing techniques relate to each other. The key contribution of this survey is the classification of the existing research into t... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Continuous Top-k Dominating Queries

    Publication Year: 2012, Page(s):840 - 853
    Cited by:  Papers (3)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1877 KB) | HTML iconHTML

    Top-k dominating queries use an intuitive scoring function which ranks multidimensional points with respect to their dominance power, i.e., the number of points that a point dominates. The k points with the best (e.g., highest) scores are returned to the user. Both top-k and skyline queries have been studied in a streaming environment, where changes to the data set are very frequent. In such an en... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Creating Evolving User Behavior Profiles Automatically

    Publication Year: 2012, Page(s):854 - 867
    Cited by:  Papers (20)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1536 KB) | HTML iconHTML

    Knowledge about computer users is very beneficial for assisting them, predicting their future actions or detecting masqueraders. In this paper, a new approach for creating and recognizing automatically the behavior profile of a computer user is presented. In this case, a computer user behavior is represented as the sequence of the commands she/he types during her/his work. This sequence is transfo... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • D-Cache: Universal Distance Cache for Metric Access Methods

    Publication Year: 2012, Page(s):868 - 881
    Cited by:  Papers (2)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (2437 KB) | HTML iconHTML

    The caching of accessed disk pages has been successfully used for decades in database technology, resulting in effective amortization of I/O operations needed within a stream of query or update requests. However, in modern complex databases, like multimedia databases, the I/O cost becomes a minor performance factor. In particular, metric access methods (MAMs), used for similarity search in complex... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Efficient Fuzzy Type-Ahead Search in XML Data

    Publication Year: 2012, Page(s):882 - 895
    Cited by:  Papers (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1351 KB) | HTML iconHTML

    In a traditional keyword-search system over XML data, a user composes a keyword query, submits it to the system, and retrieves relevant answers. In the case where the user has limited knowledge about the data, often the user feels “left in the dark” when issuing queries, and has to use a try-and-see approach for finding information. In this paper, we study fuzzy type-ahead search in ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Improving Aggregate Recommendation Diversity Using Ranking-Based Techniques

    Publication Year: 2012, Page(s):896 - 911
    Cited by:  Papers (24)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (2667 KB) | HTML iconHTML

    Recommender systems are becoming increasingly important to individual users and businesses for providing personalized recommendations. However, while the majority of algorithms proposed in recommender systems literature have focused on improving recommendation accuracy (as exemplified by the recent Netflix Prize competition), other important aspects of recommendation quality, such as the diversity... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Organizing User Search Histories

    Publication Year: 2012, Page(s):912 - 925
    Cited by:  Papers (2)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1410 KB) | HTML iconHTML

    Users are increasingly pursuing complex task-oriented goals on the web, such as making travel arrangements, managing finances, or planning purchases. To this end, they usually break down the tasks into a few codependent steps and issue multiple queries around these steps repeatedly over long periods of time. To better support users in their long-term information quests on the web, search engines k... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Semi-Supervised Maximum Margin Clustering with Pairwise Constraints

    Publication Year: 2012, Page(s):926 - 939
    Cited by:  Papers (9)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1848 KB) | HTML iconHTML Multimedia Media

    The pairwise constraints specifying whether a pair of samples should be grouped together or not have been successfully incorporated into the conventional clustering methods such as k-means and spectral clustering for the performance enhancement. Nevertheless, the issue of pairwise constraints has not been well studied in the recently proposed maximum margin clustering (MMC), which extends the maxi... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Synthesizing Ontology Alignment Methods Using the Max-Sum Algorithm

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

    This paper addresses the problem of synthesizing ontology alignment methods by maximizing the social welfare within a group of interacting agents: Specifically, each agent is responsible for computing mappings concerning a specific ontology element, using a specific alignment method. Each agent interacts with other agents with whom it shares constraints concerning the validity of the mappings it c... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Understanding Errors in Approximate Distributed Latent Dirichlet Allocation

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

    Latent Dirichlet allocation (LDA) is a popular algorithm for discovering semantic structure in large collections of text or other data. Although its complexity is linear in the data size, its use on increasingly massive collections has created considerable interest in parallel implementations. “Approximate distributed” LDA, or AD-LDA, approximates the popular collapsed Gibbs sampling... View full abstract»

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

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

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