A kernel-based algorithm for multilevel drawing Web graphs

Xiaodi Huang; Wei Lai; Di Zhang; Mao Lin Huang; Quang Vinh Nguyen

doi:10.1109/CGIV.2007.7

A kernel-based algorithm for multilevel drawing Web graphs

Xiaodi Huang, Wei Lai, Di Zhang, Mao Lin Huang, Quang Vinh Nguyen

University of Technology Sydney

Research output: Chapter in Book / Conference Paper › Conference Paper › peer-review

1 Citation (Scopus)

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.

Original language	English
Title of host publication	Computer Graphics, Imaging and Visualisation: New Advances, Bangkok, Thailand, 14, 15-17 August 2007
Editors	Ebad Banissi, Muhammad Sarfraz, Natasha Dejdumrong
Place of Publication	U.S.
Publisher	IEEE
Pages	454-459
Number of pages	6
ISBN (Print)	9780769529288
DOIs	https://doi.org/10.1109/CGIV.2007.7
Publication status	Published - 2007
Externally published	Yes
Event	International Forum on Computer Graphics, Imaging and Visualisation - Bangkok, Thailand Duration: 14 Aug 2007 → 17 Aug 2007

Conference

Conference	International Forum on Computer Graphics, Imaging and Visualisation
Country/Territory	Thailand
City	Bangkok
Period	14/08/07 → 17/08/07

Access to Document

10.1109/CGIV.2007.7

Cite this

@inproceedings{c6dca51bc9ac4283aca16ee3f2ea81a5,

title = "A kernel-based algorithm for multilevel drawing Web graphs",

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.",

author = "Xiaodi Huang and Wei Lai and Di Zhang and Huang, {Mao Lin} and Nguyen, {Quang Vinh}",

year = "2007",

doi = "10.1109/CGIV.2007.7",

language = "English",

isbn = "9780769529288",

pages = "454--459",

editor = "Ebad Banissi and Muhammad Sarfraz and Natasha Dejdumrong",

booktitle = "Computer Graphics, Imaging and Visualisation: New Advances, Bangkok, Thailand, 14, 15-17 August 2007",

publisher = "IEEE",

note = "International Forum on Computer Graphics, Imaging and Visualisation ; Conference date: 14-08-2007 Through 17-08-2007",

}

Huang, X, Lai, W, Zhang, D, Huang, ML & Nguyen, QV 2007, A kernel-based algorithm for multilevel drawing Web graphs. in E Banissi, M Sarfraz & N Dejdumrong (eds), Computer Graphics, Imaging and Visualisation: New Advances, Bangkok, Thailand, 14, 15-17 August 2007. IEEE, U.S., pp. 454-459, International Forum on Computer Graphics, Imaging and Visualisation, Bangkok, Thailand, 14/08/07. https://doi.org/10.1109/CGIV.2007.7

A kernel-based algorithm for multilevel drawing Web graphs. / Huang, Xiaodi; Lai, Wei; Zhang, Di et al.
Computer Graphics, Imaging and Visualisation: New Advances, Bangkok, Thailand, 14, 15-17 August 2007. ed. / Ebad Banissi; Muhammad Sarfraz; Natasha Dejdumrong. U.S.: IEEE, 2007. p. 454-459.

Research output: Chapter in Book / Conference Paper › Conference Paper › peer-review

TY - GEN

T1 - A kernel-based algorithm for multilevel drawing Web graphs

AU - Huang, Xiaodi

AU - Lai, Wei

AU - Zhang, Di

AU - Huang, Mao Lin

AU - Nguyen, Quang Vinh

PY - 2007

Y1 - 2007

N2 - 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.

AB - 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.

UR - https://go.openathens.net/redirector/westernsydney.edu.au?url=https://doi.org/10.1109/CGIV.2007.7

U2 - 10.1109/CGIV.2007.7

DO - 10.1109/CGIV.2007.7

M3 - Conference Paper

SN - 9780769529288

SP - 454

EP - 459

BT - Computer Graphics, Imaging and Visualisation: New Advances, Bangkok, Thailand, 14, 15-17 August 2007

A2 - Banissi, Ebad

A2 - Sarfraz, Muhammad

A2 - Dejdumrong, Natasha

PB - IEEE

CY - U.S.

T2 - International Forum on Computer Graphics, Imaging and Visualisation

Y2 - 14 August 2007 through 17 August 2007

ER -

A kernel-based algorithm for multilevel drawing Web graphs

Abstract

Conference

Access to Document

Other files and links

Fingerprint

Cite this