Sciweavers

2705 search results - page 402 / 541
» Privacy in Data Mining Using Formal Methods
Sort
View
SIGMOD
2002
ACM
246views Database» more  SIGMOD 2002»
16 years 6 months ago
Hierarchical subspace sampling: a unified framework for high dimensional data reduction, selectivity estimation and nearest neig
With the increased abilities for automated data collection made possible by modern technology, the typical sizes of data collections have continued to grow in recent years. In suc...
Charu C. Aggarwal
ICDE
2002
IEEE
204views Database» more  ICDE 2002»
16 years 7 months ago
Approximating a Data Stream for Querying and Estimation: Algorithms and Performance Evaluation
Obtaining fast and good quality approximations to data distributions is a problem of central interest to database management. A variety of popular database applications including,...
Sudipto Guha, Nick Koudas
CCS
2008
ACM
15 years 8 months ago
Efficient attributes for anonymous credentials
We extend the Camenisch-Lysyanskaya anonymous credential system such that selective disclosure of attributes becomes highly efficient. The resulting system significantly improves ...
Jan Camenisch, Thomas Groß
ICA
2007
Springer
16 years 15 days ago
Mutual Interdependence Analysis (MIA)
Functional Data Analysis (FDA) is used for datasets that are more meaningfully represented in the functional form. Functional principal component analysis, for instance, is used to...
Heiko Claussen, Justinian Rosca, Robert I. Damper
ICPP
2000
IEEE
15 years 10 months ago
A Scalable Parallel Subspace Clustering Algorithm for Massive Data Sets
Clustering is a data mining problem which finds dense regions in a sparse multi-dimensional data set. The attribute values and ranges of these regions characterize the clusters. ...
Harsha S. Nagesh, Sanjay Goil, Alok N. Choudhary