Clustering of Web Documents using a Graph Model.

作者: Adam Schenker , Mark Last , Horst Bunke , Abraham Kandel

DOI:

关键词: Cluster analysisGraph modelGraph (abstract data type)Information retrievalGraph databaseComputer science

摘要: … graph similarity, which is an NP-Complete problem, becomes polynomial time with our graph representation. By applying this graph-based kmeans algorithm to the graph model we …

参考文章(24)
H. Bunke, S. Günter, X. Jiang, Towards Bridging the Gap between Statistical and Structural Pattern Recognition: Two New Concepts in Graph Matching international conference on advances in pattern recognition. pp. 1- 11 ,(2001) , 10.1007/3-540-44732-6_1
Joydeep Ghosh, Raymond Mooney, Alexander Strehl, Impact of Similarity Measures on Web-page Clustering ,(2000)
Maxime Crochemore, Renaud Vérin, Direct Construction of Compact Directed Acyclic Word Graphs combinatorial pattern matching. pp. 116- 129 ,(1997) , 10.1007/3-540-63220-4_55
Gerard Salton, Automatic text processing: the transformation, analysis, and retrieval of information by computer Addison-Wesley Longman Publishing Co., Inc.. ,(1989)
James J. McGregor, Backtrack search algorithms and the maximal common subgraph problem Software: Practice and Experience. ,vol. 12, pp. 23- 34 ,(1982) , 10.1002/SPE.4380120103
Xin Lu, Document retrieval: A structural approach Information Processing and Management. ,vol. 26, pp. 209- 218 ,(1990) , 10.1016/0306-4573(90)90026-X
J. Gary Augustson, Jack Minker, An Analysis of Some Graph Theoretical Cluster Techniques Journal of the ACM. ,vol. 17, pp. 571- 588 ,(1970) , 10.1145/321607.321608
Jason T.L. Wang, Kaizhong Zhang, Gung-Wei Chirn, Algorithms for approximate graph matching Information Sciences. ,vol. 82, pp. 45- 74 ,(1995) , 10.1016/0020-0255(94)00057-I
A. K. Jain, M. N. Murty, P. J. Flynn, Data clustering: a review ACM Computing Surveys. ,vol. 31, pp. 264- 323 ,(1999) , 10.1145/331499.331504
H. Bunke, A. Kandel, Mean and maximum common subgraph of two graphs Pattern Recognition Letters. ,vol. 21, pp. 163- 168 ,(2000) , 10.1016/S0167-8655(99)00143-9