Artificial Intelligence Review

, Volume 36, Issue 1, pp 69–85

An effective web document clustering algorithm based on bisection and merge

Article

DOI: 10.1007/s10462-011-9203-4

Cite this article as:
Lee, I. & On, BW. Artif Intell Rev (2011) 36: 69. doi:10.1007/s10462-011-9203-4

Abstract

To cluster web documents, all of which have the same name entities, we attempted to use existing clustering algorithms such as K-means and spectral clustering. Unexpectedly, it turned out that these algorithms are not effective to cluster web documents. According to our intensive investigation, we found that clustering such web pages is more complicated because (1) the number of clusters (known as ground truth) is larger than two or three clusters as in general clustering problems and (2) clusters in the data set have extremely skewed distributions of cluster sizes. To overcome the aforementioned problem, in this paper, we propose an effective clustering algorithm to boost up the accuracy of K-means and spectral clustering algorithms. In particular, to deal with skewed distributions of cluster sizes, our algorithm performs both bisection and merge steps based on normalized cuts of the similarity graph G to correctly cluster web documents. Our experimental results show that our algorithm improves the performance by approximately 56% compared to spectral bisection and 36% compared to K-means.

Keywords

Clustering Spectral bisection Entity resolution Data mining 

Copyright information

© Springer Science+Business Media B.V. 2011

Authors and Affiliations

  1. 1.Sorrell College of BusinessTroy UniversityTroyUSA
  2. 2.Advanced Digital Sciences CenterSingaporeSingapore

Personalised recommendations