COOLCAT: An entropy-based algorithm for categorical clustering

International Conference on Information and Knowledge Management, Proceedings

Volumn , Issue , 2002, Pages 582-589

  Barbará, Daniel ^a   Couto, Julia ^b   Li, Yi ^a  

^a GEORGE MASON UNIVERSITY   (United States)

^b JAMES MADISON UNIVERSITY   (United States)

Author keywords

Clustering; Data streams; Entropy

Indexed keywords

ALGORITHMS; ELECTRONIC COMMERCE; HEURISTIC PROGRAMMING; INFORMATION RETRIEVAL;

CLUSTERING; DATA SETS; HEURISTIC ALGORITHM;

DATA MINING;

EID: 0038494682     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (31)

1. M.S. Aldenderfer and R.K. Blashfield. Cluster Analysis. Sage Publications, (Sage University Paper series on Quantitative Applications in the Social Sciences, No. 44), 1984.
2. D. Barbará. Requirements for clustering data streams. SIGKDD Explorations (Special Issue on Online, Interactive, and Anytime Data Mining), 3(2), 2002.
3. D. Barbará and P. Chen. Using the fractal dimension to cluster datasets. In Proceedings of the ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, Boston, MA, August 2000.
4. R.B. Calinski and J. Harabasz. A dendrite method for cluster analysis. Communications in Statistics, pages 1-27, 1974.
5. P. Cheeseman and J. Stutz. Bayesian classification (AUTOCLASS): Theory and Results. In U.M. Fayyad, G. Piatetsky-Shapiro, P. Smyth, and R. Uthurusamy, editors, Advances in Knowledge Discovery and Data Mining. AAAI Press, Menlo Park, 1995.
6. C. Chen, A.W. Fu, and Y. Zhang. Entropy-based Subspace Clustering for Mining Numerical Data. In Proceedings of ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, San Diego, CA, August 1999.
7. H. Chernoff. A Measure of Asymptotic Efficiency for Tests of a Hypothesis Based on the Sum of Observations. Annals of Mathematical Statistics, pages 493-509, 1952.
8. DataGen. Data Generator: Perfect data for an imperfect world. http://www.datasetgenerator.com/.
9. R.C. Dubes and A.K. Jain. Validity studies in clustering methodologies. Pattern Recognition, pages 235-254, 1979.
10. R.O. Duda and P.E. Hart. Pattern Classification and Scene Analysis. Wiley-Interscience, New York, 1973.
11. M. Ester, H.P. Kriegel, and X. Wu. A density-based algorithm for discovering clusters in large spatial database with noise. In Proceedings of the International Conference on Knowledge Discovery and Data Mining, Portland, Oregon, August 1996.
12. V. Ganti, J. Gehrke, and R. Ramakrishnan. CACTUS-Clustering Categorical Data Using Summaries. In Proceedings of the ACM-SIGKDD International Conference on Knowledge Discovery and Data Mining, San Diego, CA, 1999.
13. M. Garey and D. Johnson. Computers and Intractability: A Guide to the Theory of NP-Completeness. W.H. Freeman, 1979.
14. D. Gibson, J. Kleinberg, and P. Raghavan. Clustering Categorical Data: An Approach Based on Dynamical Systems. In Proceedings of the International Conference on Very Large Databases (VLDB), New York, NY, September 1998.
15. A. Gluck and J. Corter. Information, uncertainty, and the utility of categories. In Proceedings of the Seventh Annual Conference of the Cognitive Science Society, 1985.
16. E. Gokcay and J.C. Principle. Information Theoretic Clustering. IEEE Transactions on Pattern Analysis and Machine Intelligence, 24(2), February 2002.
17. S. Guha, R. Rastogi, and K. Shim. CURE: A clustering algorithm for large databases. In Proceedings of the ACM SIGMOD Conference on Management of Data, Seattle, WA, May 1998.
18. S. Guha, R. Rastogi, and K. Shim. ROCK: A Robust Clustering Algorithm for Categorical Attributes. In Proceedings of the 15th International Conference on Data Engineering, Sydney, Australia, April 1999.
19. E.H. Han, G. Karypis, V. Kumar, and B. Mobasher. Clustering based on association rule hypergraphs. In Proceedings of the SIGMOD Workshop on Research Issues on Data Mining and Knowledge Discovery, June 1997.
20. S. Hettich (librarian). UCI KDD Archive. http://kdd.ics.uci.edu/.
21. A.K. Jain and R.C. Dubes. Algorithms for clustering data. Prentice Hall, 1988.
22. G.J. McLachlan and K.E. Basford. Mixture Models. Marcel Dekker, New York, 1988.
23. T.M. Mitchell. Machine Learning. McGraw-Hill, 1997.
24. J.C. Pincipe, D. Xu, and J. Fisher. Information theoretic learning. In S. Haykin, editor. Unsupervised Adaptive Filtering. John Wiley & Sons, 2000.
25. A. Renyi. On Measures of Entropy and Information. In Proc. of the Fourth Berkeley Symp. Math., Statistics, and Probability, 1960.
26. J. Rissanen. A universal prior for integers and estimation by minimum description length. The Annals of Statistics, 1983.
27. J. Rissanen. Stochastic complexity in statistical inquiry. World Scientific Pub., 1989.
28. C.E. Shannon. A mathematical theory of communication. Bell System Technical Journal, pages 379-423, 1948.
29. C.S. Wallace and D.M. Boulton. An information measure for classification. The Computer Journal, 11(2), 1968.
30. C.S. Wallace and D.L. Dowe. Intrinsic classification by MML, the Snob program. In Proceedings of the 7th Australian Joint Conference on Artificial Intelligence, 1994.
31. R. Zhang, R. Ramakrishnan, and M.Livny. Birch: An efficient data clustering method for very large databases. In Proceedings of the ACM SIGMOD Conference on Data Management, Montreal, Canada, June 1996.