Harmony K-means algorithm for document clustering

  title={Harmony K-means algorithm for document clustering},
  author={Mehrdad Mahdavi and Hassan Abolhassani},
  journal={Data Mining and Knowledge Discovery},
Fast and high quality document clustering is a crucial task in organizing information, search engine results, enhancing web crawling, and information retrieval or filtering. Recent studies have shown that the most commonly used partition-based clustering algorithm, the K-means algorithm, is more suitable for large datasets. However, the K-means algorithm can generate a local optimal solution. In this paper we propose a novel Harmony K-means Algorithm (HKA) that deals with document clustering… CONTINUE READING
Highly Cited
This paper has 99 citations. REVIEW CITATIONS


Publications citing this paper.
Showing 1-10 of 59 extracted citations

PSO, BCO and K-means Based Hybridized Optimization Algorithms for Data Clustering

2017 International Conference on Information Technology (ICIT) • 2017
View 1 Excerpt

100 Citations

Citations per Year
Semantic Scholar estimates that this publication has 100 citations based on the available data.

See our FAQ for additional information.


Publications referenced by this paper.
Showing 1-10 of 34 references

Document clustering using particle swarm optimization

Proceedings 2005 IEEE Swarm Intelligence Symposium, 2005. SIS 2005. • 2005
View 10 Excerpts
Highly Influenced

Convergence analysis of canonical genetic algorithms

IEEE Trans. Neural Networks • 1994
View 4 Excerpts
Highly Influenced

Generative model-based clustering of documents: a comparative study

S Zhong, J Ghosh
Knowl Inf Syst 8:374–384. KAIS • 2005
View 3 Excerpts

Similar Papers

Loading similar papers…