Entropy-based criterion in categorical clustering

Proceedings, Twenty-First International Conference on Machine Learning, ICML 2004

Volumn , Issue , 2004, Pages 536-543

  Li, Tao ^a   Ma, Sheng ^b   Ogihara, Mitsunori ^a  

^a University of Rochester   (United States)

^b IBM T J WATSON RESEARCH CENTER   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTATIONAL COMPLEXITY; DATA REDUCTION; DATABASE SYSTEMS; MATHEMATICAL MODELS; MONTE CARLO METHODS; OPTIMIZATION; VECTORS;

CATEGORICAL CLUSTERING; DATA VECTORS; ENTROPY-BASED CRITERION; PROBABILISTIC CLUSTERING;

LEARNING SYSTEMS;

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

References (20)

1. Barbara, D., Couto, J., & Li, Y. (2002). COOLCAT: an entropy-based algorithm for categorical clustering. Proceedings of the Eleventh ACM CIKM Conference (pp. 582-589).
2. Baulieu, F. B. (1997). Two variant axiom systems for presence/absence based dissimilarity coefficients. Journal of Classification, 14, 159-170.
3. Baxter, R. A., & Oliver, J. J. (1994). MDL and MML: similarities and differences (Technical Report 207). Monash University.
4. Bock, H.-H. (1989). Probabilistic aspects in cluster analysis. In O. Opitz (Ed.), Conceptual and numerical analysis of data, 12-44. Berlin: Springer-verlag.
5. Celeux, G., & Govaert, G. (1991). Clustering criteria for discrete data and latent class models. Journal of Classification, 8, 157-176.
6. Cover, T. M., & Thomas, J. A. (1991). Elements of information theory. John Wiley & Sons.
7. Ganti, V., Gehrke, J., & Ramakrishnan, R. (1999). CACTUS - clustering categorical data using summaries. Proceedings of the Fifth ACM SIGKDD Conference (pp. 73-83).
8. Gibson, D., Kleinberg, J., & Raghavan, P. (1998). Clustering categorical data: An approach based on dynamical systems. Proceedings of the 24rd VLDB Conference (pp. 311-322).
9. Guha, S., Rastogi, R., & Shim, K. (2000). ROCK: A robust clustering algorithm for categorical attributes. Information Systems, 25, 345-366.
10. Gyllenberg, M., Koski, T., & Verlaan, M. (1997). Classification of binary vectors by stochastic complexity. Journal of Multivariate Analysis, 47-72.
11. Havrda, J., & Charvat, F. (1967). Quantification method of classification processes: Concept of structrual a-entropy. Kybernetika, 3, 30-35.
12. Huang, Z. (1998). Extensions to the k-means algorithm for clustering large data sets with categorical values. Data Mining and Knowledge Discovery, 2, 283-304.
13. Jardine, N., & Sibson, R. (1971). Mathematical taxonomy. John Wiley & Sons.
14. Li, T., Zhu, S., & Ogihara, M. (2003). Efficient multi-way text categorization via generalized discriminant analysis. Proceedings of Twelfth ACM CIKM Conference (pp. 317-324).
15. McCallum, A. K. (1996). Bow: A toolkit for statistical language modeling, text retrieval, classification and clustering. http://www.cs.cmu.edu/mccallum/ bow.
16. Roberts, S., Everson, R., & Rezek, I. (2000). Maximum certainty data partitioning. Pattern Recognition, 33, 833-839.
17. Rubinstein, R. Y. (1981). Simulation and the monte carlo method. John Wiley & Sons.
18. Symons, M. J. (1981). Clustering criteria and multivariate normal mixtures. Biometrics, 37, 35-43.
19. Wallace, R. S. (1989). Finding natural clusters through entropy minimization (Technical Report CMU-CS-89-183). Carnegie Mellon University.
20. Zhao, Y., & Karypis, G. (2001). Criterion functions for document clustering: Experiments and analysis (Technical Report). Department of Computer Science, University of Minnesota.