Web document clustering using hyperlink structures

DOI10.1016/S0167-9473(02)00070-1zbMath1015.62130MaRDI QIDQ1874119

Xiaofeng He, Hongyuan Zha, Chris H. Q. Ding, Horst D. Simon

Publication date: 22 May 2003

Published in: Computational Statistics and Data Analysis (Search for Journal in Brave)

zbMATH Keywords

metric; similarity; Cheeger constant; graph partitioning; World Wide Web; eigenvalue decomposition; clustering method; K-means method; link structure; normalized cut method

Mathematics Subject Classification ID

62H30: Classification and discrimination; cluster analysis (statistical aspects)

68U99: Computing methodologies and applications

62P99: Applications of statistics

68U35: Computing methodologies for information systems (hypertext navigation, interfaces, decision support, etc.)

Related Items

Graph clustering, 2nd special issue on matrix computations and statistics, Cliques with maximum/minimum edge neighborhood and neighborhood density, An efficient and accurate method to compute the Fiedler vector based on Householder deflation and inverse power iteration, TRACEMIN-Fiedler: A Parallel Algorithm for Computing the Fiedler Vector

Uses Software

• METIS

Cites Work

• Laplace eigenvalues of graphs---a survey
• Partitioning Sparse Matrices with Eigenvectors of Graphs
• An Improved Spectral Graph Partitioning Algorithm for Mapping Parallel Computations
• Fast monte-carlo algorithms for finding low-rank approximations
• An algorithm for information structuring and retrieval
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item