On graph modelling, node ranking and visualisation

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.

[1]  Jon Kleinberg,et al.  Authoritative sources in a hyperlinked environment , 1999, SODA '98.

[2]  Tyson R. Henry,et al.  Interactive graph layout: the exploration of large graphs , 1992 .

[3]  Stanley Wasserman,et al.  Social Network Analysis: Methods and Applications , 1994 .

[4]  Andrei Z. Broder,et al.  Graph structure in the Web , 2000, Comput. Networks.

[5]  P. Bonacich.  Factoring and weighting approaches to status scores and clique identification , 1972 .

[6]  P. Willett,et al.  A graph-theoretic approach to the identification of three-dimensional patterns of amino acid side-chains in protein structures. , 1994, Journal of molecular biology.

[7]  George Furnas,et al.  The FISHEYE view: A new look at structured files , 1986, CHI 1986.

[8]  L. Freeman.  Centrality in social networks conceptual clarification , 1978 .

[9]  Gene H. Golub,et al.  Matrix computations , 1983 .

[10]  Xiaodi Huang,et al.  Clustering graphs for visualization via node similarities , 2006, J. Vis. Lang. Comput..

[11]  Charles H. Hubbell.  An Input-Output Approach to Clique Identification , 1965 .

[12]  Vladimir Batagelj,et al.  Centrality in Social Networks , 1993 .

[13]  Frank Harary,et al.  Graph Theory , 2016 .

[14]  Noah E. Friedkin,et al.  Theoretical Foundations for Centrality Measures , 1991, American Journal of Sociology.

[15]  John Scott.  Social Network Analysis , 1988 .

[16]  King-Sun Fu,et al.  Error-Correcting Isomorphisms of Attributed Relational Graphs for Pattern Analysis , 1979, IEEE Transactions on Systems, Man, and Cybernetics.

[17]  Xiaodi Huang.  Filtering, clustering and dynamic layout for graph visualization , 2004 .

[18]  Mark S. Granovetter.  The Strength of Weak Ties , 1973, American Journal of Sociology.

[19]  G. W. Furnas,et al.  Generalized fisheye views , 1986, CHI '86.

[20]  Harold Hotelling,et al.  Simplified calculation of principal components , 1936 .

[21]  Neoklis Polyzotis,et al.  Statistical synopses for graph-structured XML databases , 2002, SIGMOD '02.

[22]  Leo Katz,et al.  A new status index derived from sociometric analysis , 1953 .

[23]  Robert F. Cohen,et al.  WebOFDAV - Navigating and Visualizing the Web On-Line with Animated Context Swapping , 1998, Comput. Networks.

[24]  Rajeev Motwani,et al.  The PageRank Citation Ranking : Bringing Order to the Web , 1999, WWW 1999.