K-ANMI: A Mutual Information Based Clustering Algorithm for Categorical Data
Zengyou He, Xiaofei Xu, Shengchun Deng
Abstract
Clustering categorical data is an integral part of data mining and has attracted much attention recently. In this paper, we present k-ANMI, a new efficient algorithm for clustering categorical data. The k-ANMI algorithm works in a way that is similar to the popular k-means algorithm, and the goodness of clustering in each step is evaluated using a mutual information based criterion (namely, Average Normalized Mutual Information-ANMI) borrowed from cluster ensemble. Experimental results on real datasets show that k-ANMI algorithm is competitive with those state-of-art categorical data clustering algorithms with respect to clustering accuracy.
Create a lesson
Related papers
WikiSkill: Compiling Agent Experience into Persistent Knowledge for Skill Evolution
Liyan Tang, Cyrus Rashtchian, Chun-Sung Ferng et al.
Mechanistic Reaction Prediction via Discrete Flow Matching on Graph-Structured Electron Occupation
Nguyen Xuan-Vu, Octavian Susanu, Daniel Armstrong et al.
Learning a Continuous Sepsis Severity Score Without Hour-by-Hour Supervision: A Two-Site Retrospective Study
Kevin Zhu, Ryan Zhang, Baraa Abed et al.
CorporateBench: Large-Scale Q&A Benchmarking with Temporal Knowledge Bases
Sil Hamilton, Albert Yu Sun, Oscar J. Romero et al.
Sophistication in GenAI Use: Field Evidence from a Large Firm
Nicholas J. Hallman, Zachary T. Kowaleski, Anu Puvvada et al.
Not All Eval-Awareness Is Equal: Capabilities Framing Predicts Compliance
Allison Zhuang, Santiago Aranguri