On graph modelling, node ranking and visualisation

Xiaodi Huang, Dianhui Wang, Kazuo Misue, Jiro Tanaka, A. S M Sajeev

Research output: Contribution to journalArticle

Abstract

Graphs traditionally have many applications in various areas of computer science. Research in graph-based data mining has recently gained a high level of attraction due to its broad range of applications. Examples include XML documents, web logs, web searches and molecular biology. Most of the approaches used in these applications focus on deriving interesting, frequent patterns from given datasets. Two fundamental questions are, however, ignored; that is, how to derive a graph from a set of objects and how to order nodes according to their relations with others in the graph. In this paper, we provide approaches to building a graph from a given set of objects accompanied by their feature vectors, as well as to ranking nodes in the graph. The basic idea of our ranking approach is to quantify the important role of a node as the degree to which it has direct and indirect relationships with other nodes in a graph. A method for visualising graphs with ranking nodes is also presented. The visual examples and applications are provided to demonstrate the effectiveness of our approaches.

Original languageEnglish
Pages (from-to)188-210
Number of pages23
JournalInternational Journal of Intelligent Systems Technologies and Applications
Volume3
Issue number3-4
Publication statusPublished - 2007
Externally publishedYes

Fingerprint

Visualization
World Wide Web
Molecular biology
XML
Computer science
Data mining

Keywords

  • graph mining
  • graph visualisation
  • web graph

ASJC Scopus subject areas

  • Computer Science(all)

Cite this

On graph modelling, node ranking and visualisation. / Huang, Xiaodi; Wang, Dianhui; Misue, Kazuo; Tanaka, Jiro; Sajeev, A. S M.

In: International Journal of Intelligent Systems Technologies and Applications, Vol. 3, No. 3-4, 2007, p. 188-210.

Research output: Contribution to journalArticle

Huang, Xiaodi ; Wang, Dianhui ; Misue, Kazuo ; Tanaka, Jiro ; Sajeev, A. S M. / On graph modelling, node ranking and visualisation. In: International Journal of Intelligent Systems Technologies and Applications. 2007 ; Vol. 3, No. 3-4. pp. 188-210.
@article{d84e147b40d642189043b3edabff80ae,
title = "On graph modelling, node ranking and visualisation",
abstract = "Graphs traditionally have many applications in various areas of computer science. Research in graph-based data mining has recently gained a high level of attraction due to its broad range of applications. Examples include XML documents, web logs, web searches and molecular biology. Most of the approaches used in these applications focus on deriving interesting, frequent patterns from given datasets. Two fundamental questions are, however, ignored; that is, how to derive a graph from a set of objects and how to order nodes according to their relations with others in the graph. In this paper, we provide approaches to building a graph from a given set of objects accompanied by their feature vectors, as well as to ranking nodes in the graph. The basic idea of our ranking approach is to quantify the important role of a node as the degree to which it has direct and indirect relationships with other nodes in a graph. A method for visualising graphs with ranking nodes is also presented. The visual examples and applications are provided to demonstrate the effectiveness of our approaches.",
keywords = "graph mining, graph visualisation, web graph",
author = "Xiaodi Huang and Dianhui Wang and Kazuo Misue and Jiro Tanaka and Sajeev, {A. S M}",
year = "2007",
language = "English",
volume = "3",
pages = "188--210",
journal = "International Journal of Intelligent Systems Technologies and Applications",
issn = "1740-8865",
publisher = "Inderscience Publishers",
number = "3-4",

}

TY - JOUR

T1 - On graph modelling, node ranking and visualisation

AU - Huang, Xiaodi

AU - Wang, Dianhui

AU - Misue, Kazuo

AU - Tanaka, Jiro

AU - Sajeev, A. S M

PY - 2007

Y1 - 2007

N2 - Graphs traditionally have many applications in various areas of computer science. Research in graph-based data mining has recently gained a high level of attraction due to its broad range of applications. Examples include XML documents, web logs, web searches and molecular biology. Most of the approaches used in these applications focus on deriving interesting, frequent patterns from given datasets. Two fundamental questions are, however, ignored; that is, how to derive a graph from a set of objects and how to order nodes according to their relations with others in the graph. In this paper, we provide approaches to building a graph from a given set of objects accompanied by their feature vectors, as well as to ranking nodes in the graph. The basic idea of our ranking approach is to quantify the important role of a node as the degree to which it has direct and indirect relationships with other nodes in a graph. A method for visualising graphs with ranking nodes is also presented. The visual examples and applications are provided to demonstrate the effectiveness of our approaches.

AB - Graphs traditionally have many applications in various areas of computer science. Research in graph-based data mining has recently gained a high level of attraction due to its broad range of applications. Examples include XML documents, web logs, web searches and molecular biology. Most of the approaches used in these applications focus on deriving interesting, frequent patterns from given datasets. Two fundamental questions are, however, ignored; that is, how to derive a graph from a set of objects and how to order nodes according to their relations with others in the graph. In this paper, we provide approaches to building a graph from a given set of objects accompanied by their feature vectors, as well as to ranking nodes in the graph. The basic idea of our ranking approach is to quantify the important role of a node as the degree to which it has direct and indirect relationships with other nodes in a graph. A method for visualising graphs with ranking nodes is also presented. The visual examples and applications are provided to demonstrate the effectiveness of our approaches.

KW - graph mining

KW - graph visualisation

KW - web graph

UR - http://www.scopus.com/inward/record.url?scp=84951712656&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=84951712656&partnerID=8YFLogxK

M3 - Article

AN - SCOPUS:84951712656

VL - 3

SP - 188

EP - 210

JO - International Journal of Intelligent Systems Technologies and Applications

JF - International Journal of Intelligent Systems Technologies and Applications

SN - 1740-8865

IS - 3-4

ER -