A kernel-based algorithm for multilevel drawing Web graphs

Publication Type:
Conference Proceeding
Citation:
Computer Graphics, Imaging and Visualisation: New Advances, CGIV 2007, 2007, pp. 454 - 459
Issue Date:
2007-12-01
Metrics:
Full metadata record
Files in This Item:
Filename Description Size
Thumbnail2006009887.pdf399.36 kB
Adobe PDF
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. © 2007 IEEE.
Please use this identifier to cite or link to this item: