Clustering graphs for visualization via node similarities

Journal of Visual Languages and Computing

Volumn 17, Issue 3, 2006, Pages 225-253

  Huang, Xiaodi ^a   Lai, Wei ^b  

^a UNIVERSITY OF NEW ENGLAND   (Australia)

^b SWINBURNE UNIVERSITY OF TECHNOLOGY   (Australia)

Author keywords

Graph clustering; Graph visualization; k Means algorithm; Multilevel graph drawing; Similarity metric

Indexed keywords

EID: 33646127156     PISSN: 1045926X     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.jvlc.2005.10.003     Document Type: Article

References (29)

1. Garg A., and Tamassia R. Advances in graph drawing. Lecture Notes in Computer Science 778 (1994) 12-22
2. Bunke H. On a relation between graph edit distance and maximum common subgraph. Pattern Recognition Letter 18 8 (1997) 689-694
3. Everitt B. Cluster Analysis. third ed. (1993), Edward Arnold, London
4. Kimelman D., Leban B., Roth T., and Zernik D. Reduction of Visual Complexity in Dynamic Graphs, in: Proceedings of the Symposium on Graph Drawing GD '93 (1994), Springer, Berlin
5. Battista G.D., Eades P., Tamassia R., and Tollis I.G. Graph Drawing: Algorithms for the Visualization of Graphs (1999), Prentice-Hall, Englewood Cliffs, NJ
6. Herman I., Delest M., and Melancon G. Tree visualization and navigation clues for information visualization. Computer Graphics Form 17 2 (1998) 153-165
7. I. Herman, M.S. Marshall, D.J. Melançon, M. Duke, Delest, J.-P. Domenger, Skeletal images as visual cues in graphs visualization, Data Visualization '99, in: Proceedings of the Joint Eurographics and IEEE TCVG Symposium on Visualization, Springer, Berlin, 1999, pp. 13-22.
8. Kleinberg J.M. Authoritative sources in a hyperlinked environment. Journal of the ACM 46 5 (1999) 604-632
9. Hartigan J. Clustering Algorithms (1975), Wiley, New York
10. Keahey T.A. The generalized detail-in-context problem. In: Wills G., and Dill J. (Eds). Proceedings of the IEEE Symposium on Information Visualization (infoviz '98), Los Alamitos (1998), IEEE Computer Soc. Press, Silver Spring, MD
11. Lamping J., Rao R., and Pirolli P. A Focus+Context Technique based on Hyperbolic Geometry for Viewing Large Hierarchies, ACM CHI '95 (1995), ACM Press, New York
12. L. Page, S. Brin, R. Motwani, T. Winograd, The pagerank citation ranking: bringing order to the Web, Technical Report, Computer Science Department, Stanford University, 1998.
13. Michael W.B., Zlatko D., and Elizabeth R.J. Matrices, vector spaces, and information retrieval. SIAM Review 41 2 (1999) 335-362
14. Eades P., and Feng Q.-W. Multilevel Visualization of Clustered Graphs, in: Proceedings of the Symposium on Graph Drawing GD '96 (1997), Springer, New York pp. 101-112
15. X.D. Huang, W. Lai, Multiple level exploration and layout of large Web hypergraph, in: Proceedings of the International Conference on Internet Computing, 2002, pp. 615-621.
16. Eades P. A heuristic for graph drawing. Congressus Numerantium 42 (1984) 149-160
17. Botafogo R.A., Rivlin E., and Schneiderman B. Structural analysis of hypertexts: identifying hierarchies and useful metrics. ACM Transactions on Information System 10 2 (1992) 142-180
18. Shapiro L.G., and Haralick R.M. Structural descriptions and inexact matching. IEEE Transactions on Pattern Analysis and Machine Intelligence 3 (1981) 504-519
19. Horaud R., and Skordas T. Stereo correspondence through feature grouping and maximal cliques. IEEE Transactions on Pattern Analysis and Machine Intelligence 11 11 (1989) 1168-1180
20. D.W. Matula, The cohesive strength of graphs, in: G. Chartrand, S.F. Kapoor (Eds.), The Many Facets of Graph Theory, Lecture Notes in Mathematics 110 (1969) 215-221.
21. D.W. Matula, Cluster analysis via graph theoretic techniques, Paper presented at the Proceedings of the Louisiana Conference on Combinatorics, Graph Theory and Computing, Winnipeg, 1970.
22. Matula D.W. k-Components, clusters and slicings in graphs. SIAM Journal of Applied Mathematics 22 3 (1972) 459-480
23. D.W. Matula, Graph theoretic techniques for cluster analysis algorithms, in: V. Ryzin (Ed.), Classification and Clustering, 1987, pp. 95-129.
24. Sharan R., and Shamir R. CLICK: a clustering algorithm for gene expression analysis. In: Miyano R.S., and Takagi T. (Eds). Currents in Computational Molecular Biology (2000), Universal Academy Press, New York 6-7
25. Hartuv E., and Shamir R. A clustering algorithm based on graph connectivity. Information Processing Letters 76 4-6 (2000) 175-181
26. Amir B.D., and Zohar R.S.Y. Clustering gene expression patterns. Journal of Computational Biology 6 3-4 (1999) 281-297
27. Thomas H.C., Charles E.L., Ronald L.R., and Clifford S. Introduction to Algorithms, 2/e (2001), MIT Press, Cambridge, MA
28. Wu Z., and Leahy R. An optimal graph theoretic approach to data clustering: theory and its application to image segmentation. IEEE Transactions on Pattern Analysis and Machine Intelligence 15 11 (1993) 1101-1113
29. Han J., and Kamber M. Data Mining: Concepts and Techniques (2000), Morgan Kaufmann Publishers, Los Altos, CA