VISUALISING SMALL WORLD GRAPHS - Agglomerative Clustering of Small World Graphs around Nodes of Interest

Fintan McGee, John Dingliana

Abstract

Many graphs which model real-world systems are characterised by a high edge density and the small world properties of a low diameter and a high clustering coefficient. In the ”small world” class of graphs, the connectivity of nodes follows a power-law distribution with some nodes of high degree acting as hubs. While current layout algorithms are capable of displaying two dimensional node-link visualisations of large data sets, the results for dense small world graphs can be aesthetically unpleasant and difficult to read, due to the high level of clutter caused by graph edges. We propose an agglomerative clustering which allows the user to select nodes of interest to form the basis of clusters, using a heuristic to determine which cluster each node belongs to. We have tested three heuristics, based on existing graph metrics, on small world graphs of varying size and density. Our results indicate that maximising the average cluster clustering coefficient produces clusters that score well on modularity while consisting of a set of strongly related nodes. We also provide a comparison between our clustering coefficient heuristic agglomerative approach and Newman and Girvan’s top-down Edge Betweenness Centrality clustering algorithm.

References

  1. Auber, D., Chiricota, Y., Jourdan, F., and Melancon, G. (2003). Multiscale visualization of small world networks. In Information Visualization, 2003. INFOVIS 2003. IEEE Symposium on, pages 75-81.
  2. Boutin, F. and Hascoet, M. (2004). Cluster validity indices for graph partitioning. In Information Visualisation, 2004. IV 2004. Proceedings. Eighth International Conference on, pages 376 - 381.
  3. Cai-Feng, D. (2009). High clustering coefficient of computer networks. In Information Engineering, 2009. ICIE 7809. WASE International Conference on, volume 1, pages 371-374.
  4. Chiricota, Y., Jourdan, F., and Melancon, G. (2003). Software components capture using graph clustering. In Program Comprehension, 2003. 11th IEEE International Workshop on, pages 217 - 226.
  5. Coleman, T. F. and Mor, J. J. (1983). Estimation of sparse jacobian matrices and graph coloring problems. SIAM Journal on Numerical Analysis, 20(1):pp. 187-209.
  6. Eades, P. and Feng, Q.-W. (1997). Multilevel visualization of clustered graphs. In Graph Drawing, pages 101- 112. Springer-Verlag.
  7. Frishman, Y. and Tal, A. (2007). Multi-level graph layout on the gpu. Visualization and Computer Graphics, IEEE Transactions on, 13(6):1310-1319.
  8. Holten, D. (2006). Hierarchical edge bundles: Visualization of adjacency relations in hierarchical data. Visualization and Computer Graphics, IEEE Transactions on, 12(5):741 -748.
  9. Mancoridis, S., Mitchell, B., Rorres, C., Chen, Y., and Gansner, E. (1998). Using automatic clustering to produce high-level system organizations of source code. In Program Comprehension, 1998. IWPC 7898. Proceedings., 6th International Workshop on, pages 45 -52.
  10. Melancon, G. (2006). Just how dense are dense graphs in the real world?: a methodological note. In Proceedings of the 2006 AVI workshop on BEyond time and errors: novel evaluation methods for information visualization, BELIV 7806, pages 1-7, New York, NY, USA. ACM.
  11. Milgram, S. (1967). The small world problem. Psychology Today, 2:60-67.
  12. Newman, M. E. J. (2004). Fast algorithm for detecting community structure in networks. Phys. Rev. E, 69(6):066133.
  13. Newman, M. E. J. and Girvan, M. (2004). Finding and evaluating community structure in networks. Physical Review E, 69(2):026113. Copyright (C) 2009 The American Physical Society Please report any problems to prola@aps.org PRE.
  14. Purchase, H. C. (1997). Which aesthetic has the greatest effect on human understanding? In Proceedings of the 5th International Symposium on Graph Drawing, GD 7897, pages 248-261, London, UK. Springer-Verlag.
  15. Quigley, A. and Eades, P. (2001). Fade: Graph drawing, clustering, and visual abstraction. In Graph Drawing, pages 77-80. Springer-Verlag.
  16. Schaeffer, S. E. (2007). Graph clustering. Computer Science Review, 1(1):27 - 64.
  17. Van Dongen, S. M. (2000). Graph Clustering by Flow Simulation. PhD thesis, University of Utrecht, The Netherlands.
  18. Van Ham, F. (2004). Case study: Visualizing visualization. In Information Visualization, 2004. INFOVIS 2004. IEEE Symposium on, pages r5-r5.
  19. Watts, D. (2003). Small worlds: the dynamics of networks between order and randomness. Princeton studies in complexity. Princeton University Press.
  20. Watts, D. and Strogatz, S. (1998). Collective dynamics of ”small-world” networks. Nature, 393:440-442.
Download


Paper Citation


in Harvard Style

McGee F. and Dingliana J. (2012). VISUALISING SMALL WORLD GRAPHS - Agglomerative Clustering of Small World Graphs around Nodes of Interest . In Proceedings of the International Conference on Computer Graphics Theory and Applications and International Conference on Information Visualization Theory and Applications - Volume 1: IVAPP, (VISIGRAPP 2012) ISBN 978-989-8565-02-0, pages 678-689. DOI: 10.5220/0003864306780689


in Bibtex Style

@conference{ivapp12,
author={Fintan McGee and John Dingliana},
title={VISUALISING SMALL WORLD GRAPHS - Agglomerative Clustering of Small World Graphs around Nodes of Interest},
booktitle={Proceedings of the International Conference on Computer Graphics Theory and Applications and International Conference on Information Visualization Theory and Applications - Volume 1: IVAPP, (VISIGRAPP 2012)},
year={2012},
pages={678-689},
publisher={SciTePress},
organization={INSTICC},
doi={10.5220/0003864306780689},
isbn={978-989-8565-02-0},
}


in EndNote Style

TY - CONF
JO - Proceedings of the International Conference on Computer Graphics Theory and Applications and International Conference on Information Visualization Theory and Applications - Volume 1: IVAPP, (VISIGRAPP 2012)
TI - VISUALISING SMALL WORLD GRAPHS - Agglomerative Clustering of Small World Graphs around Nodes of Interest
SN - 978-989-8565-02-0
AU - McGee F.
AU - Dingliana J.
PY - 2012
SP - 678
EP - 689
DO - 10.5220/0003864306780689