Embedding, clustering and coloring for dynamic maps

IEEE Pacific Visualization Symposium 2012, PacificVis 2012 - Proceedings

Volumn , Issue , 2012, Pages 33-40

  Hu, Yifan ^a   Kobourov, Stephen G ^b   Veeramoni, Sankar ^b  

^a AT AND T LABS RESEARCH   (United States)

^b University of Arizona   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

CLUSTER STABILITY; COLOR STABILITY; DATA SETS; DYNAMIC CLUSTERING; DYNAMIC MAPS; DYNAMIC PROCESS; INTERACTIVE TOOL; MENTAL MAPS; NODE STABILITY; ON DYNAMICS; SIMILARITY METRICS;

VISUALIZATION;

EID: 84860686423     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/PacificVis.2012.6183571     Document Type: Conference Paper

References (30)

1. V. Blondel, J. Guillaume, R. Lambiotte, and E. Lefebvre. Fast unfolding of communities in large networks. Journal of Stat. Mechanics: Theory and Experiment, 2008:P10008, 2008.
2. U. Brandes and S. R. Corman. Visual unrolling of network evolution and the analysis of dynamic discourse. In IEEE INFOVIS'02, pages 145-151, 2002.
3. U. Brandes, D. Delling, M. Gaertler, R. G̈orke, M. Hoefer, Z. Nikoloski, and D. Wagner. On finding graph clusterings with maximum modularity. In WG'07, pages 121-132, 2007.
4. U. Brandes and D. Wagner. A Bayesian paradigm for dynamic graph layout. In 5th Symp. on Graph Drawing (GD), pages 236-247, 1998.
5. C. Brewer. ColorBrewer-Color Advice for Maps. www. colorbrewer2.org.
6. M. Burch and S. Diehl. Timeradartrees: Visualizing dynamic compound digraphs. Computer Graphics Forum, 27(3):823-830, 2008.
7. H. Byelas and A. Telea. Visualization of areas of interest in software architecture diagrams. In ACM Symp. on Software Visualization (Soft-Vis'06), pages 105-114, 2006.
8. C. Collins, G. Penn, and S. Carpendale. Bubble sets: Revealing set relations with isocontours over existing visualizations. IEEE TVCG, 15(6):1009-1016, 2009.
9. P. F. Cortese, G. D. Battista, A. Moneta, M. Patrignani, and M. Pizzonia. Topographic visualization of prefix propagation in the internet. IEEE TVCG, 12:725-732, 2006.
10. T. F. Cox and M. A. A. Cox. Multidimensional Scaling. Chapman and Hall/CRC, 2000.
11. W. Cui, Y. Wu, S. Liu, F. Wei, M. X. Zhou, and H. Qu. Contextpreserving, dynamic word cloud visualization. Computer Graphics and Applications, 30:42-53, 2010.
12. S. Diehl and C. G̈org. Graphs, they are changing. In 10th Symp. on Graph Drawing (GD), pages 23-30, 2002.
13. J. Ellson, E. Gansner, E. Koutsofios, S. North, and G. Woodhull. Graphviz and dynagraph-static and dynamic graph drawing tools. Graph Drawing Software, pages 127-148, 2003.
14. C. Erten, P. J. Harding, S. G. Kobourov, K. Wampler, and G. V. Yee. GraphAEL: Graph Animations with Evolving Layouts. In 11th Symp. on Graph Drawing, pages 98-110, 2003.
15. S. I. Fabrikant, D. R. Montello, and D. M. Mark. The distancesimilarity metaphor in region-display spatializations. IEEE Computer Graphics & Application, 26:34-44, 2006.
16. M. L. Fredman and R. E. Tarjan. Fibonacci heaps and their uses in improved network optimization algorithms. J. ACM, 34:596-615, July 1987.
17. H. N. Gabow and R. E. Tarjan. Faster scaling algorithms for network problems. SIAM J. Comput., 18:1013-1036, October 1989.
18. D. Gale and L. S. Shapley. College admissions and the stability of marriage. The American Mathematical Monthly, 69(1):9-15, 1962.
19. R. G̈orke, P. Maillard, C. Staudt, and D. Wagner. Modularity-driven clustering of dynamic graphs. In 9th Symp. on Experimental Algorithms, pages 436-448, 2010.
20. Herman, G. Melançon, 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.
21. D. Holten and J. J. van Wijk. Visual comparison of hierarchically organized data. Computer Graphics Forum, 27(3):759-766, 2008.
22. Y. Hu, E. Gansner, and S. Kobourov. Visualizing Graphs and Clusters as Maps. IEEE Computer Graphics and Applications, 99(1):54-66, 2010.
23. J. Novembre et al. Genes mirror geography within Europe. Nature, 456(7218):98-101, 2008.
24. H. W. Kuhn. The hungarian method for the assignment problem. Naval Research Logistics Quarterly, 2(1-2):83-97, 1955.
25. D. Mashima, S. G. Kobourov, and Y. F. Hu. Visualizing dynamic data with maps. In IEEE Pacific Visualization Symposium, pages 155-162, 2011.
26. N. Yang et al. Examination of ancestry and ethnic affiliation using highly informative diallelic DNA markers: application to diverse and admixed populations and implications for clinical epidemiology and forensic medicine. Human genetics, 118(3):382-392, 2005.
27. M. E. J. Newman. Analysis of weighted networks. Phys. Rev. E, 70(5):056131, Nov 2004.
28. M. E. J. Newman and M. Girvan. Finding and evaluating community structure in networks. Phys. Rev. E, 69(2):026113, Feb 2004.
29. W. M. Rand. Objective criteria for the evaluation of clustering methods. J. of the American Statistical Association, pages 846-850, 1971.
30. P. Simonetto, D. Auber, and D. Archambault. Fully automatic visualisation of overlapping sets. Computer Graphics Forum, 28:967-974, 2009.