An energy-based model to optimize cluster visualization

Proceedings - International Conference on Research Challenges in Information Science

Volumn , Issue , 2014, Pages

  Dkaki, Taoufiq ^a   Mothe, Josiane ^a  

^a UNIVERSITÉ DE TOULOUSE   (France)

Author keywords

clusterd graphs; graph drawing; graphs; visualization

Indexed keywords

COMPLEX NETWORKS; DRAWING (GRAPHICS); FLOW VISUALIZATION; INFORMATION SCIENCE; INFORMATION SYSTEMS; VISUALIZATION;

CLUSTER VISUALIZATION; CLUSTERD GRAPHS; DIVIDE-AND-CONQUER APPROACH; ENERGY-BASED MODELS; GRAPH DRAWING; GRAPHS; INFORMATION VISUALIZATION; MATHEMATICAL STRUCTURE;

DATA VISUALIZATION;

EID: 84906773412     PISSN: 21511349     EISSN: 21511357     Source Type: Conference Proceeding    
DOI: 10.1109/RCIS.2014.6861028     Document Type: Conference Paper

References (38)

1. P. J. Carrington, J. Scott, and S. Wasserman (Eds.), "Models and methods in social network analysis," Cambridge university press, 2005.
2. E. R. Gansner, and S. C. North, "An open graph visualization system and its applications to software engineering," Software Practice and Experience, 30(11), pp. 1203-1233,2000.
3. R. F. i Cancho C. Janssen, and R. V. Sole, "Topology of technology graphs: Small world patterns in electronic circuits," Physical Review E, 64(4), p. 046119, 2001.
4. S. B. Navathe, and M. Ra, "Vertical partitioning for database design: a graphical algorithm," In ACM SIGMOD Record, Vol. 18, No. 2, pp. 440-450, 1989.
5. T. M. L. Fruchterman, E. M. Reingold, "Graph drawing by force-directed placement," Software. Pract. Exper. 21(11), pp. 1129-1164,1991.
6. T. Kamada, S. Kawai, "An algorithm for drawing general undirected graphs," Information Processing Letters, 31(1), pp. 7-15,1989.
7. S. Hachul and M. Jiinger, "An Experimental Comparison of Fast Algorithms for Drawing General Large Graphs," Pro. of the Graph Drawing 2005, vol. 3843, Lecture Notes in Computer Science, SpringerVerlag; pp. 235-250, Limerick, Ireland, 2006.
8. U. Brandes, "Layout of Graph Visualizations," PhD thesis, University of Konstanz, 1999. (http://www. ub. unikonstanzlkops/ volltexte/1999/255).
9. T. Biedl and F. J. Brandenburg, "Graph-Drawing contest report," Proc. of the Graph drawing 2001, Lecture Notes in Computer Science, Springer-Verlag, pp. 388-403, 2001.
10. X. Wang and I. Miyamoto, "Generating customized layouts," in Graph Drawing, vol. 1027, F. Brandenburg, Ed. Springer Berlin Heidelberg, 1996,pp. 504-515..
11. W. T. Tutte, "How to draw a graph," Proc. London Math. Society, 13(52):743-768, 1963.
12. G. Di Battista, P. Eades, R. Tamassia, and I. G. Tollis, "Graph Drawing: Algorithms for the Visualization of Graphs," Prentice Hall PTR, Upper Saddle River, NJ, USA, 1998
13. S. G. Kobourov, "Force-Directed Drawing Algorithms," In Roberto Tamassia (editor), Handbook of Graph Drawing and Visualization, p. 383-408, CRC Press, 2013 (http://arxiv.org/pdf/1201.301I.pdf)
14. C. Gorg, P. Birke, M. Pohl, and S. Diehl, "Dynamic graph drawing of sequences of orthogonal and hierarchical graphs," In Graph Drawing, pp. 228-238, 2005.
15. U. Dogrusoz, B. Madden and P. Madden, "Circular Layout in the Graph Layout Toolkit, Proc. GD '96," LNCS 1190, Springer-Verlag, pp. 92-100,1997.
16. G. Melancon and I. Herman, "Circular drawings of rooted trees," Technical Report: TNS-R9817, Centre for Mathematics and Computer Science.
17. P. Eades, "A heuristic for graph drawing," Congressus Numerantium 42 (II): 149-160, 1984.
18. P. Gajer and S. G. Kobourov, "GRIP: Graph Drawing with Intelligent Placement," J. Graph Algorithms Appl., vol. 6, no. 3, pp. 203-224, 2002.
19. D. Harel and Y. Koren, "A fast multi-scale method for drawing large graphs," Journal of Graph Algorithms and Applications, 6(3): 179-2002, 2002.
20. C. Walshaw, "A Multilevel Algorithm for Force-Directed Graph Drawing," in Graph Drawing, vol. 1984, J. Marks, Ed. Springer Berlin Heidelberg, 2001, pp. 171-182.
21. J-H. Chuang, C-c. Lin, H-C. Yen, "Drawing Graphs with Nonuniform Nodes Using Potential Fields," In Liotta, Giuseppe, Eds. Proceedings Graph Drawing, pages pp. 460-465, Perugia, 2004
22. Y. Frishman, A. Tal, "Dynamic Drawing of Clustered Graphs," Proceedings of IEEE Symposium on Information Visualization 2004, pp. 191-198,2004
23. T. Dwyer, Y. Koren, and K. Marriott. TPSep-CoLa: An incremental procedure for separation constraint layout of graphs. Visualization and Computer Graphics, IEEE Transactions on, 12(5), pp. 821-828, 2006.
24. A. Noack, "An Energy Model for Visual Graph Clustering," In Liotta, Giuseppe, Eds. Proceedings Graph Drawing, pages pp. 425-436, Perugia,2004.
25. Q.D. Truong, T.Dkaki, and PJ. Charrel, "An energy model for the drawing of clustered graphs," In 5th VSST, Marrakech, 2007
26. P. Eades, M.L. Huang, "Navigating Clustered Graphs Using ForceDirected Methods," J. Graph Algorithms Appl., 2000: 157-181,2000
27. M. Balzer and O. Deussen, "Level-of-detail visualization of clustered graph layouts," in APVIS, 2007, pp. 133-140.
28. P. Rodgers. Graph drawing techniques for geographic visualization. 2004.
29. T. Dkaki, J. Mothe, Q.D. Truong, "Passage Retrieval Using Graph Vertices Comparison," Third International IEEE '07Conference SITlS, Shanghai 2007.
30. J. Kleinberg, "Authoritative sources in a hyperlinked environment," Proceedings of the 9th ACM-SIAM Symposium on Discrete Algorithms, SIAM, Philadelphia, PA, 1998,668-677
31. V. Blondel, A. Gajardo, M. Heymans, P. Senellart, and P. Van Dooren, "A measure of similarity between graph vertices," cs/0407061, Jul. 2004.
32. P. Eades and Q.-W. Feng, "Multilevel visualization of clustered graphs," in Graph Drawing, vol. 1190, S. North, Ed. Springer Berlin Heidelberg, 1997, pp. 101-1l2.
33. R. Brockenauer and S. Cornelsen, "Drawing Clusters and Hierarchies," in Drawing Graphs, vol. 2025, M. Kaufmann and D. Wagner, Eds. Springer Berlin Heidelberg, 2001, pp. 193-227.
34. R. Bourqui, D. Auber, and P. Mary, "How to Draw ClusteredWeighted Graphs using a Multilevel Force-Directed Graph Drawing Algorithm," in Information Visualization, 2007. N '07. II th International Conference, 2007, pp. 757-764.
35. J. D. Cruz Gomez, C. Bothorel, and F. Poulet, "Community detection and visualization in social networks: integrating structural and semantic information," ACM Transactions on Intelligent Systems and Technology, vol. 5, no. I, pp. 11-26, Dec. 2013.
36. M. Baur and U. Brandes, "Multi-circular Layout of Micro/Macro Graphs," in Graph Drawing, vol. 4875, S.-H. Hong, T. Nishizeki, and W. Quan, Eds. Springer Berlin Heidelberg, 2008, pp. 255-267.
37. N. Villa-Vialaneix, T. Dkaki, S. Gadat, J.-M. Inglebert, and Q. D. Truong, "Recherche et representation de communautes dans un grand graphe. Une approche combinee," Document Numerique, vol. 14, no. 1, pp. 59-80, 2011.
38. D. Truong, "Approches par les graphes pour Iáide it la selection, Iánalyse et la visualisation des connaissances," PhD Thesis, Universite de Toulouse-Ie-Mirail, Toulouse, France, 2008.