By Topic

A Kernel-based Algorithm for Multilevel Drawing Web Graphs

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$33 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

5 Author(s)
Xiaodi Huang ; The University of New England, Australia ; Wei Lai ; Di Zhang ; Mao Lin Huang
more authors

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.

Published in:

Computer Graphics, Imaging and Visualisation, 2007. CGIV '07

Date of Conference:

14-17 Aug. 2007