• Corpus ID: 14561589

Chapter 1 AN INTRODUCTION TO UNCERTAIN DATA ALGORITHMS AND APPLICATIONS

@inproceedings{Aggarwal2008Chapter1A,
  title={Chapter 1 AN INTRODUCTION TO UNCERTAIN DATA ALGORITHMS AND APPLICATIONS},
  author={Charu C. Aggarwal},
  year={2008}
}
In recent years, uncertain data has become ubiquitous because of new technologies for collecting data which can only measure and collect the data in an imprecise way. Furthermore, many technologies such as privacy-preserving data mining create data which is inherently uncertain in nature. As a result there is a need for tools and techniques for mining and managing uncertain data. This chapter discusses the broad outline of the book and the methods used for various uncertain data applications. 
No Paper Link Available

References

SHOWING 1-10 OF 23 REFERENCES
A Survey of Uncertain Data Algorithms and Applications
TLDR
This paper provides a survey of uncertain data mining and management applications, and discusses different methodologies to process and mine uncertain data in a variety of forms.
A Framework for Clustering Uncertain Data Streams
TLDR
This paper proposes a method for clustering uncertain data streams in which only a few statistical measures of the uncertainty are available and shows that the approach is more effective than a purely deterministic method such as the CluStream approach.
On Density Based Transforms for Uncertain Data Mining
  • C. Aggarwal
  • Computer Science
    2007 IEEE 23rd International Conference on Data Engineering
  • 2007
TLDR
A new method for handling error-prone and missing data with the use of density based approaches to data mining, which can be effectively and efficiently applied to very large data sets, and turns out to be very useful as a general approach to such problems.
Approximation algorithms for clustering uncertain data
TLDR
The core mining problem of clustering on uncertain data is studied, and appropriate natural generalizations of standard clustering optimization criteria are defined, and a variety of bicriteria approximation algorithms are shown, including the first known guaranteed approximation algorithms for the problems of clustered uncertain data.
On Unifying Privacy and Uncertain Data Models
  • C. Aggarwal
  • Computer Science
    2008 IEEE 24th International Conference on Data Engineering
  • 2008
TLDR
An uncertain version of the k-anonymity model which is related to the well known deterministic model of k- anonymity is proposed, which has the additional feature of introducing greater uncertainty for the adversary over an equivalent deterministic models.
Indexing Uncertain Categorical Data
TLDR
This paper proposes two index structures for efficiently searching uncertain categorical data, one based on the R-tree and another based on an inverted index structure, and provides a detailed description of the probabilistic equality queries they support.
Frequent pattern mining with uncertain data
TLDR
This paper will show how broad classes of algorithms can be extended to the uncertain data setting, and study candidate generate-and-test algorithms, hyper-structure algorithms and pattern growth based algorithms.
Working Models for Uncertain Data
TLDR
This paper proposes a two-layer approach to managing uncertain data: an underlying logical model that is complete, and one or more working models that are easier to understand, visualize, and query, but may lose some information.
Efficient Indexing Methods for Probabilistic Threshold Queries over Uncertain Data
Efficient Clustering of Uncertain Data
TLDR
This work studies various pruning methods to avoid expensive expected distance calculation in the UK-means algorithm, which is based on the traditional K-mean algorithm.
...
...