doi: 10.4304/jsw.6.8.1521-1528
A Novel Weighted Phrase-Based Similarity for Web Documents Clustering
- College of Computer Science, Chongqing University, Chongqing, China
Abstract
Phrase has been considered as a more informative feature term for improving the effectiveness of document clustering. In this paper, a weighted phrase-based document similarity is proposed to compute the pairwise similarities of documents based on the Weighted Suffix Tree Document (WSTD) model. The weighted phrase-based document similarity is applied to the Group-average Hierarchical Agglomerative Clustering (GHAC) algorithm to develop a new Web document clustering approach. According to the structures of the Web documents, different document parts are assigned different levels of significance as structure weights stored in the nodes of the weighted suffix tree which is constructed with sentences instead of documents. By mapping each node and its weights in WSTD model into a unique feature term in the Vector Space Document (VSD) model, the new weighted phrase-based document similarity naturally inherits the term TF-IDF weighting scheme in computing the document similarity with weighted phrases. The evaluation experiments indicate that the new clustering approach is very effective on clustering the Web documents. Its quality greatly surpasses the traditional phrase-based approach in which the Web documents structures are ignored. In conclusion, the weighted phrase-based similarity works much better than ordinary phrase-based similarity.
Keywords
- suffix tree
- web document clustering
- we
How to Cite
Ruilong Yang, Qingsheng Zhu, and Yunni Xia, "A Novel Weighted Phrase-Based Similarity for Web Documents Clustering," Journal of Software, vol. 6, no. 8, pp. 1521-1528, 2011. https://doi.org/ 10.4304/jsw.6.8.1521-1528
Copyright & License
Copyright © 2011 by the authors. This is an open access article distributed under the Creative Commons Attribution License which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited (CC BY 4.0).
