Fast clustering strategy for web search result
Bin Gao · Computer Engineering and Applications Journal · 2011
In web search result clustering,HAC(Hierarchical Agglomerative Clustering) and K-means are usually used.But each of them has its own fault.This paper advances a two-stage clustering method.In the first stage,it clusters the topics by HAC,in the second stage,it clusters the topics and abstracts by K-means with the initial cluster center from the first stage clustering to get a reasonable clustering result.Because the topics are always short,the running time of HAC is greatly shorter.This method satisfies the need of time to web search and gets a better clustering result.