This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
Seventh International Database Engineering and Applications Symposium (IDEAS'03)
Identification of Clusters in the Web Graph Based on Link Topology
Hong Kong, SAR
July 16-July 18
ISBN: 0-7695-1981-4
Xiaodi Huang, Swinburne University of Technology
Wei Lai, Swinburne University of Technology
The web graph has recently been used to model the link structure of the Web. The studies of such graphs can yield valuable insights into web algorithms for crawling, searching and discovery of web communities. This paper proposes a new approach to clustering the Web graph. The proposed algorithm identifies a small subset of the graph as "core" members of clusters, and then incrementally constructs the clusters by a selection criterion. Two qualitative criteria are proposed to measure the quality of graph clustering. We have implemented our algorithm and tested a set of arbitrary graphs with good results. Applications of our approach include graph drawing and web visualization.
Index Terms:
Clustering, Web Graph, K-Nearest Neighbor
Citation:
Xiaodi Huang, Wei Lai, "Identification of Clusters in the Web Graph Based on Link Topology," ideas, pp.123, Seventh International Database Engineering and Applications Symposium (IDEAS'03), 2003
Usage of this product signifies your acceptance of the Terms of Use.