Abstract
Irrelevant attributes add noise to high dimensional clusters and make traditional clustering techniques inappropriate. Projected clustering algorithms have been proposed to find the clusters in hidden subspaces. We realize the analogy between mining frequent itemsets and discovering the relevant subspace for a given cluster. We propose a methodology for finding projected clusters by mining frequent itemsets and present heuristics that improve its quality. Our techniques are evaluated with synthetic and real data; they are scalable and discover projected clusters accurately.
Original language | English |
---|---|
Title of host publication | Proceedings - 3rd IEEE International Conference on Data Mining, ICDM 2003 |
Pages | 689-692 |
Number of pages | 4 |
Publication status | Published - 1 Dec 2003 |
Externally published | Yes |
Event | 3rd IEEE International Conference on Data Mining, ICDM '03 - Melbourne, FL, United States Duration: 19 Nov 2003 → 22 Nov 2003 |
Conference
Conference | 3rd IEEE International Conference on Data Mining, ICDM '03 |
---|---|
Country/Territory | United States |
City | Melbourne, FL |
Period | 19/11/03 → 22/11/03 |
ASJC Scopus subject areas
- Engineering(all)