Efficient phrase-based document indexing for web document clustering

被引:163
作者
Hammouda, KM [1 ]
Kamel, MS [1 ]
机构
[1] Univ Waterloo, Dept Syst Design Engn, Waterloo, ON N2L 3G1, Canada
基金
加拿大自然科学与工程研究理事会;
关键词
Web mining; document similarity; phrase-based indexing; document clustering; document structure; document index graph; phrase matching;
D O I
10.1109/TKDE.2004.58
中图分类号
TP18 [人工智能理论];
学科分类号
081104 ; 0812 ; 0835 ; 1405 ;
摘要
Document clustering techniques mostly rely on single term analysis of the document data set, such as the Vector Space Model. To achieve more accurate document clustering, more informative features including phrases and their weights are particularly important in such scenarios. Document clustering is particularly useful in many applications such as automatic categorization of documents, grouping search engine results, building a taxonomy of documents, and others. This paper presents two key parts of successful document clustering. The first part is a novel phrase-based document index model, the Document Index Graph, which allows for incremental construction of a phrase-based index of the document set with an emphasis on efficiency, rather than relying on single-term indexes only. It provides efficient phrase matching that is used to judge the similarity between documents. The model is flexible in that it could revert to a compact representation of the vector space model if we choose not to index phrases. The second part is an incremental document clustering algorithm based on maximizing the tightness of clusters by carefully watching the pair-wise document similarity distribution inside clusters. The combination of these two components creates an underlying model for robust and accurate document similarity calculation that leads to much improved results in Web document clustering over traditional methods.
引用
收藏
页码:1279 / 1296
页数:18
相关论文
共 46 条
  • [21] Data clustering: A review
    Jain, AK
    Murty, MN
    Flynn, PJ
    [J]. ACM COMPUTING SURVEYS, 1999, 31 (03) : 264 - 323
  • [22] Jain K, 1988, Algorithms for clustering data
  • [23] JUNKER M, 1999, P 1 WORKSH LEARN LAN, P84
  • [24] Kargupta H., 1997, Proceedings of the Third International Conference on Knowledge Discovery and Data Mining, P211
  • [25] Kosala Raymond., 2000, SIGKDD EXPLOR NEWSL, V2, P1, DOI DOI 10.1145/360402.360406
  • [26] Kurtz S, 1999, SOFTWARE PRACT EXPER, V29, P1149, DOI 10.1002/(SICI)1097-024X(199911)29:13<1149::AID-SPE274>3.0.CO
  • [27] 2-O
  • [28] Lin D., 1998, P 15 INT C MACH LEAR
  • [29] SENTENCE-TO-SENTENCE CLUSTERING PROCEDURE FOR PATTERN-ANALYSIS
    LU, SY
    FU, KS
    [J]. IEEE TRANSACTIONS ON SYSTEMS MAN AND CYBERNETICS, 1978, 8 (05): : 381 - 389
  • [30] SUFFIX ARRAYS - A NEW METHOD FOR ONLINE STRING SEARCHES
    MANBER, U
    MYERS, G
    [J]. SIAM JOURNAL ON COMPUTING, 1993, 22 (05) : 935 - 948