loading...
A Kernel-based Algorithm for Multilevel Drawing Web Graphs
Bangkok, Thailand August 14-August 17
DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/CGIV.2007.7Computer Graphics, Imaging and Visual ...
 This Article 
 
Buy PURCHASE ARTICLE: $19
PDF
HTML
Buy IEEE Xplore Subscribers
 
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
ASCII Text
x 
 
Xiaodi Huang, Wei Lai, Di Zhang, Mao Lin Huang, Quang Vinh Nguyen, "A Kernel-based Algorithm for Multilevel Drawing Web Graphs," Computer Graphics, Imaging and Visualization, International Conference on, pp. 454-459, Computer Graphics, Imaging and Visualisation (CGIV 2007), 2007.
 
 
BibTex
x
 
@article{ 10.1109/CGIV.2007.7,
author = {Xiaodi Huang and Wei Lai and Di Zhang and Mao Lin Huang and Quang Vinh Nguyen},
title = {A Kernel-based Algorithm for Multilevel Drawing Web Graphs},
journal ={Computer Graphics, Imaging and Visualization, International Conference on},
volume = {0},
year = {2007},
isbn = {0-7695-2928-3},
pages = {454-459},
doi = {http://doi.ieeecomputersociety.org/10.1109/CGIV.2007.7},
publisher = {IEEE Computer Society},
address = {Los Alamitos, CA, USA},
}
 
 
RefWorks Procite/RefMan/Endnote
x 
 
TY - CONF
JO - Computer Graphics, Imaging and Visualization, International Conference on
TI - A Kernel-based Algorithm for Multilevel Drawing Web Graphs
SN - 0-7695-2928-3
SP454
EP459
A1 - Xiaodi Huang,
A1 - Wei Lai,
A1 - Di Zhang,
A1 - Mao Lin Huang,
A1 - Quang Vinh Nguyen,
PY - 2007
KW - Graph visualization; Filtering; Clustering; Web graph
VL - 0
JA - Computer Graphics, Imaging and Visualization, International Conference on
ER -
 
Xiaodi Huang, The University of New England, Australia
Wei Lai, Swinburne University of Technology, Australia
Di Zhang, Chinese Academy of Sciences, China
Mao Lin Huang, University of Technology, Sydney, Australia
Quang Vinh Nguyen, University of Technology, Sydney, Australia
A Web graph refers to the graph that models the hyperlink relations between Web pages in the WWW, where a node represents a URL and an edge indicates a link between two URLs. A Web graph is normally a very huge graph. In the course of users? Web exploration, only part of the Web graph is displayed on the screen each time according to a user?s current navigation focus. In this paper, we make use of a fast kernel-based algorithm that is able to cluster large graphs. The algorithm is implemented in an online visualization system of Web graphs. In the system, a Web crawler first generates the Web graph of web sites. The clustering algorithm then reduces the visual complexities of the large graph. In particular, it groups a set of highly connected nodes and their edges into a clustered graph with abstract nodes and edges. The experiments have demonstrated that the employed algorithm is able to cluster graphs.
Index Terms:
Graph visualization; Filtering; Clustering; Web graph
Citation:
Xiaodi Huang, Wei Lai, Di Zhang, Mao Lin Huang, Quang Vinh Nguyen, "A Kernel-based Algorithm for Multilevel Drawing Web Graphs," cgiv, pp.454-459, Computer Graphics, Imaging and Visualisation (CGIV 2007), 2007
Usage of this product signifies your acceptance of the Terms of Use.