Interactive methods for graph exploration

Authors

  • Eloise Loubier Toulouse University I.R.I.T. (Institut de Recherche en Informatique de Toulouse), 118, route de Narbonne, 31062 TOULOUSE Cedex 9

DOI:

https://doi.org/10.37380/jisib.v2i1.28

Keywords:

Grap exploration, strategic watch, visualization, business intelligence

Abstract

In a strategic watch context, visualization of relational data allows transformation, coding and visualization of great data quantities. Access to interactive, adjustable functionalities by the user would facilitate the domination and the precision of the analysis. From this point of view, the VisuGraph tool allows visualization and exploration of relational data, by the way of applicable and controllable methods of analysis. The main interactive VisuGraph functionalities are presented and illustrated, revealing their importance in graph exploration. The user is the heart of the tool; he or she fully controls the representation and directs the analysis according to own needs.

References

Alvarez-Hamelin, J.I., Dall’Asta, L., Barrat, A. and Vespignani, A. 2005. k-core decomposition: a tool for the visualization of large scale networks. Computing Research Repository: 41, 52-55.

Balmisse, G. 2005. REFLEXIONS - Visualisation de l'information: quelques repères, retrieved 2005, [http://www.gillesbalmisse.com/blog/index.php?2005/02/24/35-visualisation-de-linformation-quelques-reperes]

Batagelj, V. and Zaversnik, M. 2002. Generalized cores. Working paper, Department of theoretical computer science: 52.

Bertin, J. 1970. Sémiologie graphique. Haag: Mouton.

Card, S.K., Mackinlay, J.D. and Shneiderman, B. 1999. Readings in Information Visualization. San Francisco: Morgan Kaufmann Publishers.

Di Battista, G., Eades P., Tamassia, R. and Tollis, I.G. 1999. Graph drawing - Algorithms for the visualization of graphs. Upper Saddle River: Prentice Hall.

Eades, P. 1984. A Heuristic for Graph Drawing, Congressus Numerantium, 42: 149-160.

Fayyad, U., Grinstein, G. and Wierse. A. 2002. Information visualization in data mining and knowledge discovery. San Fransisco: Morgan Kaufmann.

Fekete, J.D. and Lecolinet, E. 2006. Visualisation pour les bibliothèques numériques. Hermès-Lavoisier. 9 (2) : 7-11.

Floyd, R. 1962. Algorithm 97: Shortest Path. Communications of the ACM, 5, June: 345.

Frank, A., Rapper, J. and Cheylan, J.-P. 2001. Life and Motion of Socio-economic Units. London: Taylor and Francis, page 353.

Freeman, L.C. 1979. Centrality in Networks: Conceptual Clarification. Social Networks, 1: 215-39.

Fruchterman, T.M.J. and Reingold, E.M. 1991. Graph drawing by force_directed placement. Software – Practice and experience, 21: 1129-1164.

Gayte, O., Libourel, T., Cheylan, J.P. and Lardon, S. 1997. Conception des systèmes d’information sur l’environnement. Paris: Hermès, 153.

Grinstein, G. 1996. Harnessing the human in knowledge discovery. Proceedings f the 2nd International Conference on

knowledge Discovery and Data Mining, Portland, USA: 384-385.

Hochheiser, H. and Shneiderman, B. 2002. A dynamic Query Interface for Finding Patterns in Time Series Data. Proceedings of conference CHI, April 2002, Minneapolis, USA.

Josselin, D. and Fabrikant, S. 2003. Cartographie animée et interactive. Revue internationale de géomatique, 13 (1).

Kamada, T. and Kawai, S. 1989. An Algorithm for General Drawing Undirected Graphs. Information Processing Letters, 31: 7-15.

Kapusova, D. 2004. Visualisation de l'information dans le portail STAF18. http://tecfaseed.unige.ch/staf18/modules/ePBLjolan/uploads/proj15/paper%20(et%20dispositif)6.xml. Accessed 2011-11-24

Keim D., Kriegel H. Visualization techniques for mining large databases: a comparison. IEEE Trans. On knowledge and Data Engineering, 1996: 923-938.

Kramer, T. and Jozsa, J. 1998. Visualization and analysis of timedependent hydrometric data in windows environment. Proceedings of the 3rd International Conference on Hydroinformatics, 1998, Copenhagen, A.A. Balkema Publisher

Langran, G. 1993. Time in Geographic Information Systems. London: Taylor & Francis, 189.

Loubier, E. and Dousset, B. 2008. Temporal and relational data representation by graph morphing”. Dans : Safety and Reliability for managing Risk (ESREL 2008), Hammamet, 14/02/2008-16/02/2008, February ftp://ftp.irit.fr/IRIT/SIG/2008_ESREL_LD.pdf.

MacEachren, A.M., Bosco F.P, Haug D., Pickle L.W. 1998. Geographic Visualization: Designing Manipulable Maps for Exploring Temporally Varying Georeferenced Statistics. Proceedings of the IEEE Symposium on Information Visualization InfoVis, Research Triangle Park, USA, IEEE Computer Society: 87-94.

Rainsford, C.P. and Roddick, J.F. 2000. Visualisation of Temporal Association Rules. Proceedings of 2nd International Conference on Intelligent Data Engineering and Automated Learning IDEAL, Hong Kong, Chine: 91-96.

Renieris, M. and Reiss, S.P. 1999. ALMOST: Exploring Program Traces. Workshop on New Paradigms in Information Visualization and Manipulation: 70-77.

Shahar, Y. and Cheng, C. 1999. Intelligent Visualization and Exploration of Time-Oriented Clinical Data. Topics in Health Information Management, 20 (2): 15-31.

Shahar, Y. and Cheng, C. 2000. Model-Based Visualization of Temporal Abstractions. Computational Intelligence, 16 (2): 279-306.

Spence, R. 2000. Information Visualization. New York: ACM Press.

Tutte, W.J. 1963. How to Draw a graph. Proceeding London Maths, plowshare, 3 (13): 743-768.

Ware, C. 2000. Information Visualization, perception for design. San Fransisco: Morgan Kaufmann.

Warshall, S. 1962. A theorem on Boolean matrices. Journal of the ACM, 9, January: 11–12.

Downloads

Issue

Vol. 2 No. 1 (2012): JISIB

Section

Article

License

Authors who publish with this journal agree to the following terms:

    1. Authors retain copyright and grant the journal right of first publication with the work simultaneously licensed under a Creative Commons Attribution License that allows others to share the work with an acknowledgement of the work's authorship and initial publication in this journal.

    1. Authors are able to enter into separate, additional contractual arrangements for the non-exclusive distribution of the journal's published version of the work (e.g., post it to an institutional repository or publish it in a book), with an acknowledgement of its initial publication in this journal.

  1. Authors are permitted and encouraged to post their work online (e.g., in institutional repositories or on their website) prior to and during the submission process, as it can lead to productive exchanges, as well as earlier and greater citation of published work (See The Effect of Open Access).