Farthest-Point Heuristic based Initialization Methods for K-Modes Clustering
Zengyou He
Abstract
The k-modes algorithm has become a popular technique in solving categorical data clustering problems in different application domains. However, the algorithm requires random selection of initial points for the clusters. Different initial points often lead to considerable distinct clustering results. In this paper we present an experimental study on applying a farthest-point heuristic based initialization method to k-modes clustering to improve its performance. Experiments show that new initialization method leads to better clustering accuracy than random selection initialization method for k-modes clustering.
Create a lesson
Related papers
Scaffolding Foundation Models into Physical-World Agents Pushes the Frontier of Long-Horizon Navigation
Zixing Lei, Gengze Zhou, Xiong-Hui Chen et al.
Augmenting Human Performance with an XR Agent Learning from Online Behavior and BCI Evidence
Ziheng Li, Xichen He, Haoyan Chen et al.
Will the User Ever Know? Covert Indirect Prompt Injection on Tool-Using LLM Agents
Yunseok Lee, Yunji Kim, Woojin Lee
Co-Annotator: Expert-Distilled ViT and VLM for Visual and Documentation Guidance in Age-Related Macular Degeneration
Ziheng "Leo" Li, Benjamin Freeman, Akshay Raman et al.
Answer Probing-Guided Search for Diverse Solution Exploration of LLMs
Yi Fang, Que Shen, Chengpeng Li et al.
Ignorance or Incompetence? Constructing Knowledge-Gated, Verifiable Tasks for LLM Agents
Hanlin Tian, Minhao Li, Yu Mi et al.