Visual analysis of graphs with multiple connected components

VAST 09 - IEEE Symposium on Visual Analytics Science and Technology, Proceedings

Volumn , Issue , 2009, Pages 155-162

  Von Landesberger, Tatiana ^a   Görner, Melanie ^a   Schreck, Tobias ^a  

^a DARMSTADT UNIVERSITY OF TECHNOLOGY   (Germany)

Author keywords

H.3.3 : information search and retrieval; I.3.3 : computer graphics; Clustering H.5.2 user interfaces : graphical user interfaces (GUI); E.1 data structures : graphs and networks; Picture image generation

Indexed keywords

[H.3.3]: INFORMATION SEARCH AND RETRIEVAL; CLUSTERING H.5.2 [USER INTERFACES]: GRAPHICAL USER INTERFACES (GUI); E.1 [DATA STRUCTURES]: GRAPHS AND NETWORKS; GRAPHS AND NETWORKS; H.5.2 USER INTERFACES; INFORMATION SEARCH AND RETRIEVAL; PICTURE/IMAGE GENERATION;

CLUSTER ANALYSIS; COMPUTER GRAPHICS; DATA STRUCTURES; ELECTRIC NETWORK ANALYSIS; INTERFACES (COMPUTER); VISUALIZATION;

GRAPHICAL USER INTERFACES;

EID: 72849114289     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/VAST.2009.5333893     Document Type: Conference Paper

References (48)

1. A. T. Adai, S. V. Date, S.Wieland, and E.M.Marcotte. LGL: creating a map of protein function with an algorithm for visualizing very large biological networks. J Mol Biol, 340(1):179-190, June 2004.
2. D. Archambault, T. Munzner, and D. Auber. Topolayout: Multilevel graph layout by topological features. IEEE Transactions on Visualization and Computer Graphics, 13(2):305-317, 2007.
3. D. Auber, Y. Chiricota, F. Jourdan, and G. Melancon. Multiscale visualization of small world networks. Information Visualization, 2003. INFOVIS 2003. IEEE Symposium on, pages 75-81, 2003.
4. A. Barrat, M. Barthelemy, R. Pastor-Satorras, A. Vespignani, and G. Parisi. The architecture of complex weighted networks. Proc. of the National Academy of Sciences of USA, 101(11):3747-3752, 2004.
5. K. U. Barthel. Improved image retrieval using automatic image sorting and semi-automatic generation of image semantics. Int. Workshop on Image Analysis for Multimedia Interactive Services, pages 227-230, 2008.
6. E. Bonabeau. Graph multidimensional scaling with self-organizing maps. Int. J. on Information Sciences, 143(1-4):159-180, 2002.
7. E. Bonabeau and F. Hhaux. Self-organizing maps for drawing large graphs. Inf. Proc. Letters, 67:177-184, 1998.
8. P. Bonacich. Power and centrality: A family of measures. The American J. of Sociology, 92(5):1170-1182, 1987.
9. U. Brandes, M. Gaertler, and D. Wagner. Experiments on graph clustering algorithms. volume 2832, pages 568-579. Springer, 2003.
10. Bureau van Dijk Electronic Publishing. AMADEUS Database, Oct. 2007. http://www.bvdep.com/.
11. G. Caldarelli. Scale-Free Networks: Complex Webs in Nature and Technology. Oxford Finance, 4 2007.
12. A. Capocci, G. Caldarelli, and P. D. L. Rios. Quantitative description and modeling of real networks, 2002.
13. L. Cohen and T. Deschamps. Grouping connected components using minimal path techniques. application to reconstruction of vessels in 2d and 3d images. volume 2, pages II-102-II-109 vol.2, 2001.
14. W. Cui, H. Zhou, H. Qu, P. C.Wong, and X. Li. Geometry-based edge clustering for graph visualization. IEEE Transactions on Visualization and Computer Graphics, 14(6):1277-1284, 2008.
15. U. Dogrusoz. Two-dimensional packing algorithms for layout of disconnected graphs. Information Sciencies, 143(1-4):147-158, 2002.
16. A. Fiannaca, G. Fatta, S. Gaglio, R. Rizzo, and A. Urso. Clustering quality and topology preservation in fast learning soms. In Proc. 18th international conference on Artificial Neural Networks, Part I, pages 583-592. Springer, 2008.
17. K. Freivalds, U. Dogrusöz, and P. Kikusts. Disconnected graph layout and the polyomino packing approach. In Revised Papers from the 9th Int. Symposium on Graph Drawing, pages 378-391. Springer, 2002.
18. A. Frick, A. Ludwig, and H. Mehldau. A fast adaptive layout algorithm for undirected graphs. In Proc. of the DIMACS Int. Workshop on Graph Drawing, pages 388-403. Springer, 1995.
19. P. Gajer and S. G. Kobourov. Grip: Graph drawing with intelligent placement. In GD '00: Proceedings of the 8th International Symposium on Graph Drawing, pages 222-228. Springer, 2001.
20. D. Goehlsdorf, M. Kaufmann, and M. Siebenhaller. Placing connected components of disconnected graphs. In 6th Int. Asia-Pacific Symposium on Visualization 2007, pages 101-108, Februar 2007.
21. S. Günter and H. Bunke. Self-organizing map for clustering in the graph domain. Pattern Recogn. Lett., 23(4):405-417, 2002.
22. J. Han and M. Kamber. Data Mining: Concepts and Techniques. Morgan Kauffman, 2nd edition, 2006.
23. D. Harel and Y. Koren. Graph drawing by high-dimensional embedding. In GD '02: Revised Papers from the 10th International Symposium on Graph Drawing, pages 207-219. Springer, 2002.
24. I. Herman, G. Melancon, and M. S. Marshall. Graph visualization and navigation in information visualization: A survey. IEEE Transactions on Visualization and Computer Graphics, 6(1):24-43, /2000.
25. D. Holten. Hierarchical edge bundles: Visualization of adjacency relations in hierarchical data. IEEE Transactions on Visualization and Computer Graphics, 12(5):741-748, 2006.
26. T. Honkela, S. Kaski, K. Lagus, and T. Kohonen. WEBSOM - self-organizing maps of document collections. In Proc. Workshop on Self-Organizing Maps (WSOM), pages 310-315. Helsinki University of Technology, 1997.
27. S. H. C. Information and M. Jünge. Drawing large graphs with a potential-field-based multilevel algorithm. Lecture notes in Computer Science, 4372:285-295, 2005.
28. A. Jain, M. Murty, and P. Flynn. Data clustering: a review. ACM Comput. Surv., 31(3):264-323, 1999.
29. S. Kaski and K. Lagus. Comparing self-organizing maps. In Proceedings of the 1996 International Conference on Artificial Neural Networks, pages 809-814. Springer, 1996.
30. L. Kaufman and P. Rousseeuw. Finding Groups in Data: An Introduction to Cluster Analysis. Wiley-Interscience, 1990.
31. D. A. Keim, F. Mansmann, J. Schneidewind, J. Thomas, and H. Ziegler. Visual Analytics: Scope and Challenges, pages 76-90. Springer LNCS, 2008.
32. T. Kohonen. Self-Organizing Maps. Springer, Berlin, 3rd edition, 2001.
33. T. Kohonen, J. Hynninen, J. Kangas, and J. Laaksonen. Som-pak: The self-organizing map program package. Technical Report A31, Helsinki University of Technology, 1996.
34. G. Kumar and M. Garland. Visual exploration of complex time-varying graphs. IEEE Transactions on Visualization and Computer Graphics, 12(5):805-812, 2006.
35. U. Lauther. Multipole-based force approximation revisited - a simple but fast implementation using a dynamized enclosing-circle-enhanced k-d-tree. Lecture notes in Computer Science, 4372:20-29, 2007.
36. C. Legány, S. Juhász, and A. Babos. Cluster validity measurement techniques. In AIKED'06: Proceedings of the 5th WSEAS International Conference on Artificial Intelligence, Knowledge Engineering and Data Bases, pages 388-393, Stevens Point, Wisconsin, USA, 2006. World Scientific and Engineering Academy and Society.
37. J. Leskovec and C. Faloutsos. Sampling from large graphs. In Proc. of the 12th ACM SIGKDD Int. Conference on Knowledge Discovery and data mining, pages 631-636, New York, NY, USA, 2006. ACM.
38. H. Liu and H. Motoda, editors. Computational Methods of Feature Selection. Chapman and Hall, 2007.
39. B. Meyer. Self-organizing graphs - a neural network perspective of graph layout. In GD '98: Proc. of the 6th Int. Symposium on Graph Drawing, pages 246-262, 1998.
40. M. Neuhaus and H. Bunke. Self-organizing maps for learning the edit costs in graph matching. Proc. IEEE Trans. on Systems, Man, and Cybernetics, 35:503-514, June 2005.
41. J. O'Madadhain, D. Fisher, and S. White. Analysis and visualization of network data using JUNG. Journal of Statistical Software, VV(II).
42. A. N. Papadopoulos and Y. Manolopoulos. Structure-based similarity search with graph histograms. In Proc. 10th Int. Workshop on Database & Expert Systems Applications, page 174. IEEE Computer Society, 1999.
43. G. Poelzlbauer. Survey and comparison of quality measures for selforganizing maps. In WDA 2004, pages 67 - 82, 2004.
44. B. Prieto, F. Tricas, J. J. Merelo, A. Mora, and A. Prieto. Visualizing the evolution of a web-based social network. J. of Network and Computer Apps, 31:667-698, 2008.
45. A. R. Rudolf Mayer, Thomas Lidy. The map of mozart. In Proc. of the 7th Int. Conference on Music Information Retrieval (ISMIR'06), pages 351-352, October 8-12 2006.
46. H. Schwbbermeyer. Analysis of Biological Networks, chapter 5, pages 85 - 112. Wiley Series on Bioinformatics, Computational Techniques and Engineering. Wiley, 2008.
47. J. Vesanto. SOM-based data visualization methods. Intelligent Data Analysis, 3(2):111-126, 1999.
48. K. Zhang, J. Wang, and D. Shasha. On the editing distance between undirected acyclic graphs. Int. J. of Foundations of Computer Science, 7(1):43-57, 1996.