By Topic

Knowledge and Data Engineering, IEEE Transactions on

Issue 8 • Date Aug. 2012

Filter Results

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

    Publication Year: 2012 , Page(s): c1
    Save to Project icon | Request Permissions | PDF file iconPDF (102 KB)  
    Freely Available from IEEE
  • [Inside front cover]

    Publication Year: 2012 , Page(s): c2
    Save to Project icon | Request Permissions | PDF file iconPDF (168 KB)  
    Freely Available from IEEE
  • A Performance Anomaly Detection and Analysis Framework for DBMS Development

    Publication Year: 2012 , Page(s): 1345 - 1360
    Save to Project icon | Request Permissions | Click to expandAbstract | PDF file iconPDF (1336 KB)  

    Detecting performance anomalies and finding their root causes are tedious tasks requiring much manual work. Functionality enhancements in DBMS development as in most software development often introduce performance problems in addition to bugs. To detect the problems as soon as they are introduced, which often happens during the early phases of a development cycle, we adopt performance regression ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Adding Temporal Constraints to XML Schema

    Publication Year: 2012 , Page(s): 1361 - 1377
    Cited by:  Papers (2)
    Multimedia
    Save to Project icon | Request Permissions | Click to expandAbstract | PDF file iconPDF (2666 KB)  

    If past versions of XML documents are retained, what of the various integrity constraints defined in XML Schema on those documents? This paper describes how to interpret such constraints as sequenced constraints, applicable at each point in time. We also consider how to add new variants that apply across time, so-called nonsequenced constraints. Our approach supports temporal documents that vary o... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Coupled Behavior Analysis with Applications

    Publication Year: 2012 , Page(s): 1378 - 1392
    Cited by:  Papers (11)
    Save to Project icon | Request Permissions | Click to expandAbstract | PDF file iconPDF (1058 KB)  

    Coupled behaviors refer to the activities of one to many actors who are associated with each other in terms of certain relationships. With increasing network and community-based events and applications, such as group-based crime and social network interactions, behavior coupling contributes to the causes of eventual business problems. Effective approaches for analyzing coupled behaviors are not av... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Data Mining for XML Query-Answering Support

    Publication Year: 2012 , Page(s): 1393 - 1407
    Cited by:  Papers (2)
    Save to Project icon | Request Permissions | Click to expandAbstract | PDF file iconPDF (1600 KB)  

    Extracting information from semistructured documents is a very hard task, and is going to become more and more critical as the amount of digital information available on the Internet grows. Indeed, documents are often so large that the data set returned as answer to a query may be too big to convey interpretable knowledge. In this paper, we describe an approach based on Tree-Based Association Rule... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Discovery of Delta Closed Patterns and Noninduced Patterns from Sequences

    Publication Year: 2012 , Page(s): 1408 - 1421
    Cited by:  Papers (6)
    Save to Project icon | Request Permissions | Click to expandAbstract | PDF file iconPDF (1915 KB)  

    Discovering patterns from sequence data has significant impact in many aspects of science and society, especially in genomics and proteomics. Here we consider multiple strings as input sequence data and substrings as patterns. In the real world, usually a large set of patterns could be discovered yet many of them are redundant, thus degrading the output quality. This paper improves the output qual... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Discriminative Feature Selection by Nonparametric Bayes Error Minimization

    Publication Year: 2012 , Page(s): 1422 - 1434
    Cited by:  Papers (1)
    Save to Project icon | Request Permissions | Click to expandAbstract | PDF file iconPDF (1258 KB)  

    Feature selection is fundamental to knowledge discovery from massive amount of high-dimensional data. In an effort to establish theoretical justification for feature selection algorithms, this paper presents a theoretically optimal criterion, namely, the discriminative optimal criterion (DoC) for feature selection. Compared with the existing representative optimal criterion (RoC, [CHECK END OF SEN... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • EDISC: A Class-Tailored Discretization Technique for Rule-Based Classification

    Publication Year: 2012 , Page(s): 1435 - 1447
    Cited by:  Papers (2)
    Save to Project icon | Request Permissions | Click to expandAbstract | PDF file iconPDF (3640 KB)  

    Discretization is a critical component of data mining whereby continuous attributes of a data set are converted into discrete ones by creating intervals either before or during learning. There are many good reasons for preprocessing discretization, such as increased learning efficiency and classification accuracy, comprehensibility of data mining results, as well as the inherent limitation of a gr... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Efficient and Progressive Algorithms for Distributed Skyline Queries over Uncertain Data

    Publication Year: 2012 , Page(s): 1448 - 1462
    Cited by:  Papers (3)
    Save to Project icon | Request Permissions | Click to expandAbstract | PDF file iconPDF (1530 KB)  

    The skyline operator has received considerable attention from the database community, due to its importance in many applications including multicriteria decision making, preference answering, and so forth. In many applications where uncertain data are inherently exist, i.e., data collected from different sources in distributed locations are usually with imprecise measurements, and thus exhibit kin... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Energy Efficient Schemes for Accuracy-Guaranteed Sensor Data Aggregation Using Scalable Counting

    Publication Year: 2012 , Page(s): 1463 - 1477
    Save to Project icon | Request Permissions | Click to expandAbstract | PDF file iconPDF (1469 KB)  

    Sensor networks have received considerable attention in recent years, and are employed in many applications. In these applications, statistical aggregates such as Sum over the readings of a group of sensor nodes are often needed. One challenge for computing sensor data aggregates comes from the communication failures, which are common in sensor networks. To enhance the robustness of the aggregate ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Extending Recommender Systems for Disjoint User/Item Sets: The Conference Recommendation Problem

    Publication Year: 2012 , Page(s): 1478 - 1490
    Cited by:  Papers (3)
    Multimedia
    Save to Project icon | Request Permissions | Click to expandAbstract | PDF file iconPDF (1005 KB)  

    In this paper, we describe the problem of recommending conference sessions to attendees and show how novel extensions to traditional model-based recommender systems, as suggested in Adomavicius and Tuzhilin [CHECK END OF SENTENCE], can address this problem. We introduce Recommendation Engine by CONjoint Decomposition of ITems and USers (RECONDITUS)-a technique that is an extension of preference-ba... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Maximum Ambiguity-Based Sample Selection in Fuzzy Decision Tree Induction

    Publication Year: 2012 , Page(s): 1491 - 1505
    Cited by:  Papers (7)
    Save to Project icon | Request Permissions | Click to expandAbstract | PDF file iconPDF (1966 KB)  

    Sample selection is to select a number of representative samples from a large database such that a learning algorithm can have a reduced computational cost and an improved learning accuracy. This paper gives a new sample selection mechanism, i.e., the maximum ambiguity-based sample selection in fuzzy decision tree induction. Compared with the existing sample selection methods, this mechanism selec... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Protecting Location Privacy against Location-Dependent Attacks in Mobile Services

    Publication Year: 2012 , Page(s): 1506 - 1519
    Cited by:  Papers (9)
    Save to Project icon | Request Permissions | Click to expandAbstract | PDF file iconPDF (1013 KB)  

    Privacy protection has recently received considerable attention in location-based services. A large number of location cloaking algorithms have been proposed for protecting the location privacy of mobile users. In this paper, we consider the scenario where different location-based query requests are continuously issued by mobile users while they are moving. We show that most of the existing k-anon... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Shape Sensitive Geometric Monitoring

    Publication Year: 2012 , Page(s): 1520 - 1535
    Cited by:  Papers (5)
    Save to Project icon | Request Permissions | Click to expandAbstract | PDF file iconPDF (903 KB)  

    An important problem in distributed, dynamic databases is to continuously monitor the value of a function defined on the nodes, and check that it satisfies some threshold constraint. We introduce a monitoring method, based on a geometric interpretation of the problem, which enables to define local constraints at the nodes. It is guaranteed that as long as none of these constraints is violated, the... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • IEEE Computer Society OnlinePlus Publishing

    Publication Year: 2012 , Page(s): 1536
    Save to Project icon | Request Permissions | PDF file iconPDF (1324 KB)  
    Freely Available from IEEE
  • [Inside back cover]

    Publication Year: 2012 , Page(s): c3
    Save to Project icon | Request Permissions | PDF file iconPDF (168 KB)  
    Freely Available from IEEE
  • [Back cover]

    Publication Year: 2012 , Page(s): c4
    Save to Project icon | Request Permissions | PDF file iconPDF (102 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