Sciweavers

7163 search results - page 250 / 1433
» Privacy-Preserving Data Mining
Sort
View
KDD
1998
ACM
107views Data Mining» more  KDD 1998»
15 years 10 months ago
Giga-Mining
Wedescribe an industrial-strength data mining application in telecommunications.Theapplication requires building a short (7 byte) profile for all telephonenumbersseen on a large t...
Corinna Cortes, Daryl Pregibon
165
Voted
KDD
1997
ACM
135views Data Mining» more  KDD 1997»
15 years 10 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.
JCIT
2010
174views more  JCIT 2010»
15 years 1 months ago
Efficient Ming of Top-K Closed Sequences
Sequence mining is an important data mining task. In order to retrieve interesting sequences from a large database, a minimum support threshold is needed to be specified. Unfortun...
Panida Songram
KDD
2003
ACM
195views Data Mining» more  KDD 2003»
16 years 6 months ago
Visualizing changes in the structure of data for exploratory feature selection
Using visualization techniques to explore and understand high-dimensional data is an efficient way to combine human intelligence with the immense brute force computation power ava...
Elias Pampalk, Werner Goebl, Gerhard Widmer
KDD
2003
ACM
135views Data Mining» more  KDD 2003»
16 years 6 months ago
Efficiently handling feature redundancy in high-dimensional data
High-dimensional data poses a severe challenge for data mining. Feature selection is a frequently used technique in preprocessing high-dimensional data for successful data mining....
Lei Yu, Huan Liu