Search

Clustering techniques have been applied to categorize documents on Web and extract knowledge from Web. In this paper, we introduce a novel clustering method into Web page clustering, which is an extension of affinity propagation (AP). This method is called partition adaptive affinity propagation (PAAP), which can automatically rerun AP procedure to yield optimal clustering results and eliminate number oscillations if they occur. Experiments are carried out to compare PAAP with K-means and AP on ten different Web page data sets. The results verify that PAAP can find better clusters when compared with similar methods. And the results also demonstrate that PAAP is robust and effective when clustering Web pages. [ABSTRACT FROM AUTHOR]