CACTUS - Clustering Categorical Data Using Summaries (1999)
Cached
Download Links
- [www.cs.cornell.edu]
- [barbera.cnuce.cnr.it]
- [ftp.cs.wisc.edu]
- [static.aminer.org]
- DBLP
Other Repositories/Bibliography
| Venue: | Proc. of ACM SIGKDD |
| Citations: | 108 - 0 self |
BibTeX
@INPROCEEDINGS{Ganti99cactus-,
author = {Venkatesh Ganti and Johannes Gehrke and Raghu Ramakrishnan},
title = {CACTUS - Clustering Categorical Data Using Summaries},
booktitle = {Proc. of ACM SIGKDD},
year = {1999},
pages = {73--83}
}
Share
 |
 |
 |
 |
||
OpenURL
Abstract
Clustering is an important data mining problem. Most of the earlier work on clustering focussed on numeric attributes which have a natural ordering on their attribute values. Recently, clustering data with categorical attributes, whose attribute values do not have a natural ordering, has received some attention. However, previous algorithms do not give a formal description of the clusters they discover and assume that the user post-processes the output of the algorithm to identify the final clusters. In this paper, we introduce a novel formalization of a cluster for categorical attributes by generalizing a definition of a cluster for numerical attributes. We then describe a very fast summarization-based algorithm called CACTUS that discovers exactly such clusters in the data. CACTUS has two important characteristics. First, the algorithm requires only two scans of the dataset, and hence is very fast and scalable. Our experiments on a variety of datasets show that CACTUS outper...
