A kernel-based algorithm for multilevel drawing Web graphs

Huang, X; Lai, W; Zhang, D; Huang, M; Nguyen, QV

A kernel-based algorithm for multilevel drawing Web graphs

Huang, X Lai, W Zhang, D Huang, M

Nguyen, QV

Permalink

Publication Type:: Conference Proceeding
Citation:: Computer Graphics, Imaging and Visualisation: New Advances, CGIV 2007, 2007, pp. 454 - 459
Issue Date:: 2007-12-01

Closed Access

	Filename	Description	Size
	2006009887.pdf		399.36 kB	Adobe PDF	View/Open

Copyright Clearance Process

Recently Added
In Progress
Closed Access

This item is closed access and not available.

Full metadata record

Field	Value	Language
dc.contributor.author	Huang, X	en_US
dc.contributor.author	Lai, W	en_US
dc.contributor.author	Zhang, D	en_US
dc.contributor.author	Huang, M https://orcid.org/0000-0002-6896-6480	en_US
dc.contributor.author	Nguyen, QV https://orcid.org/0000-0002-0815-6224	en_US
dc.date.issued	2007-12-01	en_US
dc.identifier.citation	Computer Graphics, Imaging and Visualisation: New Advances, CGIV 2007, 2007, pp. 454 - 459	en_US
dc.identifier.isbn	0769529283	en_US
dc.identifier.isbn	9780769529288	en_US
dc.identifier.uri	http://hdl.handle.net/10453/2598
dc.description.abstract	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.	en_US
dc.relation.ispartof	Computer Graphics, Imaging and Visualisation: New Advances, CGIV 2007	en_US
dc.relation.isbasedon	10.1109/CGIV.2007.7	en_US
dc.title	A kernel-based algorithm for multilevel drawing Web graphs	en_US
dc.type	Conference Proceeding
utslib.for	0801 Artificial Intelligence and Image Processing	en_US
dc.location.activity	Bangkok, Thailand	en_US
pubs.embargo.period	Not known	en_US
pubs.organisational-group	/University of Technology Sydney
pubs.organisational-group	/University of Technology Sydney/Faculty of Engineering and Information Technology
pubs.organisational-group	/University of Technology Sydney/Faculty of Engineering and Information Technology/School of Computer Science
pubs.organisational-group	/University of Technology Sydney/Strength - INEXT - Innovation in IT Services and Applications
utslib.copyright.status	closed_access
pubs.publication-status	Published	en_US

Abstract:

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:

http://hdl.handle.net/10453/2598