Sciweavers

728 search results - page 27 / 146
» Mining for Empty Rectangles in Large Data Sets
Sort
View
KDD
1997
ACM
135views Data Mining» more  KDD 1997»
13 years 12 months ago
Brute-Force Mining of High-Confidence Classification Rules
This paper investigates a brute-force technique for mining classification rules from large data sets. We employ an association rule miner enhanced with new pruning strategies to c...
Roberto J. Bayardo Jr.
PKDD
2005
Springer
110views Data Mining» more  PKDD 2005»
14 years 1 months ago
k-Anonymous Patterns
It is generally believed that data mining results do not violate the anonymity of the individuals recorded in the source database. In fact, data mining models and patterns, in orde...
Maurizio Atzori, Francesco Bonchi, Fosca Giannotti...
ICPP
2000
IEEE
14 years 3 days 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
DMIN
2006
138views Data Mining» more  DMIN 2006»
13 years 9 months ago
Quantification of a Privacy Preserving Data Mining Transformation
Data mining, with its promise to extract valuable, previously unknown and potentially useful patterns or knowledge from large data sets that contain private information is vulnerab...
Mohammed Ketel
KDD
1998
ACM
99views Data Mining» more  KDD 1998»
13 years 12 months ago
On the Efficient Gathering of Sufficient Statistics for Classification from Large SQL Databases
For a wide variety of classification algorithms, scalability to large databases can be achieved by observing that most algorithms are driven by a set of sufficient statistics that...
Goetz Graefe, Usama M. Fayyad, Surajit Chaudhuri