Visual Analysis of History of World Cup: A Dynamic Network with Dynamic Hierarchy and Geographic Clustering
In this paper, we present new visual analysis methods for history of the FIFA World Cup competition data, a social network from Graph Drawing 2006 Competition. Our methods are based on the use of network analysis method, and new visualization methods for dynamic graphs with dynamic hierarchy and geographic clustering. More specifically, we derive a dynamic network with geographic clustering from the history of the FIFA World Cup competition data, based on who-beats-whom relationship. Combined with the centrality analysis (which defines dynamic hierarchy) and the use of the union of graphs (which determines the overall layout topology), we present three new visualization methods for dynamic graphs with dynamic hierarchy and geographic clustering: wheel layout, radial layout and hierarchical layout. Our experimental results show that our visual analysis methods can clearly reveal the overall winner of the World Cup competition history as well as the strong and weak countries. Furthermore, one can analyze and compare the performance of each country for each year along the context with their overall performance. This enables us to confirm the expected and discover the unexpected.
Unable to display preview. Download preview PDF.
- 1.A. Ahmed, T. Dwyer, M. F. X. Fu, J. W. K. Ho, S.-H. Hong, D. Koschuetzki, C. Murray, N. S. Nikolov, R. Taib, A. Tarassov, and K. Xu. Geomi: Geometry for maximum insight. In Proc. of Graph Drawing 2005, pages 468–479, 2005.Google Scholar
- 2.C. Bachmaier, H. Buchner, M. Forster, and S.-H. Hong. Crossing minimization in extended level drawings of graphs. Discrete Applied Mathematics, to appear.Google Scholar
- 3.U. Brandes and T. Erlebach, editors. Network Analysis: Methodological Foundations, volume 3418 of Lecture Notes in Computer Science. Springer, 2005.Google Scholar
- 4.U. Brandes, M. Hoefer, and C. Pich. Affiliation dynamics with an application to movie-actor biographies. In Proc. of EuroVis 2006, pages 179–186, 2006.Google Scholar
- 5.C. Chen. The centrality of pivotal points in the evolution of scientific networks. In Proc. Of IUI 2005, pages 98–105, 2005.Google Scholar
- 6.X. Fu, S.-H. Hong, N. S. Nikolov, X. Shen, Y. Wu, and K. Xu. Visualization and analysis of email networks. In Proc. of APVIS 2007, pages 1–8, 2007.Google Scholar
- 7.P. Gajer, M. T. Goodrich, and S. G. Kobourov. A multi-dimensional approach to forcedirected layouts of large graphs. In Proc. of Graph Drawing 2000, pages 211–221, 2000.Google Scholar
- 8.D. Harel and Y. Koren. Graph drawing by high-dimensional embedding. In Proc. of Graph Drawing 2002, pages 207–219, 2002.Google Scholar
- 9.S.-H. Hong and H. Nagamochi. Approximating crossing minimization in radial layouts. In Proc. of LATIN 2008, pages 461–472, 2008.Google Scholar
- 12.A. J. Quigley and P. Eades. Fade: Graph drawing, clustering, and visual abstraction. In Proc. of Graph Drawing 2000, pages 197–210, 2000.Google Scholar
- 13.J. J. Thomas and K. A. Cook. Illuminating the Path: The Research and Development Agenda for Visual Analytics. National Visualization and Analytics Ctr, 2005.Google Scholar
- 14.C. Walshaw. A multilevel algorithm for force-directed graph drawing. In Proc. of Graph Drawing 2000, pages 171–182, 2000.Google Scholar
- 15.S. Wasserman and K. Faust. Social Network Analysis: Methods and Applicaitons. Cambridge University Press, 1995.Google Scholar