On graph modelling, node ranking and visualisation
by Xiaodi Huang, Dianhui Wang, Kazuo Misue, Jiro Tanaka, A.S.M. Sajeev
International Journal of Intelligent Systems Technologies and Applications (IJISTA), Vol. 3, No. 3/4, 2007

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.

Online publication date: Thu, 28-Jun-2007

The full text of this article is only available to individual subscribers or to users at subscribing institutions.

 
Existing subscribers:
Go to Inderscience Online Journals to access the Full Text of this article.

Pay per view:
If you are not a subscriber and you just want to read the full contents of this article, buy online access here.

Complimentary Subscribers, Editors or Members of the Editorial Board of the International Journal of Intelligent Systems Technologies and Applications (IJISTA):
Login with your Inderscience username and password:

Username:        Password:          Forgotten your password?

Want to subscribe?
A subscription gives you complete access to all articles in the current issue, as well as to all articles in the previous three years (where applicable). See our Orders page to subscribe.

If you still need assistance, please email subs@inderscience.com