K-Histograms: An Efficient Clustering Algorithm for Categorical Dataset
Artificial Intelligence
2007-05-23 v1
Abstract
Clustering categorical data is an integral part of data mining and has attracted much attention recently. In this paper, we present k-histogram, a new efficient algorithm for clustering categorical data. The k-histogram algorithm extends the k-means algorithm to categorical domain by replacing the means of clusters with histograms, and dynamically updates histograms in the clustering process. Experimental results on real datasets show that k-histogram algorithm can produce better clustering results than k-modes algorithm, the one related with our work most closely.
Keywords
Cite
@article{arxiv.cs/0509033,
title = {K-Histograms: An Efficient Clustering Algorithm for Categorical Dataset},
author = {Zengyou He and Xiaofei Xu and Shengchun Deng and Bin Dong},
journal= {arXiv preprint arXiv:cs/0509033},
year = {2007}
}
Comments
11 pages