egoComp: A node-link-based technique for visual comparison of ego-networks

Analysis of ego-networks is a critical research problem when analyzing large-scale social networks, as an ego-network represents the social circle a person actually contacts with. One of the core tasks in ego-network analysis is visual comparison, which includes edge comparison and node comparison. Although various works have been done to support comparing normal networks and ego-networks, intuitive node comparison of two ego-networks is still challenging. In this article, we propose egoComp, an intuitive and expressive visualization technique, to analyze the node difference between two ego-networks. To preserve the latent structure of ego-network and lay emphasis on intuitiveness, our design is node-link-based (radial tree layout) and uses a side-by-side method to compare ego-networks. We design a novel storyflow-like graph layout to reveal the relationship of two ego-networks at the individual node level. Furthermore, three different layout algorithms, including origin, greedy, and assignment algorithms, are proposed to meet different user requirements. We demonstrate the effectiveness of our system through case studies and a user study and then discuss the limitations thoroughly as well as the possible solutions and potential future work.

[1]  Kwan-Liu Ma,et al.  Software evolution storylines , 2010, SOFTVIS '10.

[2]  Michel Grossetti,et al.  Where do social relations come from?: A study of personal networks in the Toulouse area of France , 2005, Soc. Networks.

[3]  P. Riehmann,et al.  Interactive Sankey diagrams , 2005, IEEE Symposium on Information Visualization, 2005. INFOVIS 2005..

[4]  M. Sheelagh T. Carpendale,et al.  VisLink: Revealing Relationships Amongst Visualizations , 2007, IEEE Transactions on Visualization and Computer Graphics.

[5]  Danyel Fisher,et al.  Using egocentric networks to understand communication , 2005, IEEE Internet Computing.

[6]  Tamara Munzner,et al.  A Multi-Level Typology of Abstract Visualization Tasks , 2013, IEEE Transactions on Visualization and Computer Graphics.

[7]  Yifan Hu,et al.  Efficient, High-Quality Force-Directed Graph Drawing , 2006 .

[8]  Elisa Bellotti,et al.  What are friends for? Elective communities of single people , 2008, Soc. Networks.

[9]  Jian Zhao,et al.  egoSlider: Visual Analysis of Egocentric Network Evolution , 2016, IEEE Transactions on Visualization and Computer Graphics.

[10]  Mengchen Liu,et al.  StoryFlow: Tracking the Evolution of Stories , 2013, IEEE Transactions on Visualization and Computer Graphics.

[11]  Tobias Isenberg,et al.  Weighted graph comparison techniques for brain connectivity analysis , 2013, CHI.

[12]  H. Kuhn The Hungarian method for the assignment problem , 1955 .

[13]  J. Kruskal Multidimensional scaling by optimizing goodness of fit to a nonmetric hypothesis , 1964 .

[14]  Pierre Dragicevic,et al.  Interactive graph matching and visual comparison of graphs and clustered graphs , 2012, AVI.

[15]  Jarke J. van Wijk,et al.  Visual Comparison of Hierarchically Organized Data , 2008, Comput. Graph. Forum.

[16]  Kwan-Liu Ma,et al.  Design Considerations for Optimizing Storyline Visualizations , 2012, IEEE Transactions on Visualization and Computer Graphics.

[17]  M. Newman 1 Who is the best connected scientist ? A study of scientific coauthorship networks , 2004 .

[18]  Hong Zhou,et al.  Edge bundling in information visualization , 2013 .

[19]  Whitman Richards,et al.  Graph Comparison Using Fine Structure Analysis , 2010, 2010 IEEE Second International Conference on Social Computing.

[20]  Keith Andrews,et al.  Visual Graph Comparison , 2009, 2009 13th International Conference Information Visualisation.

[21]  Chen Wang,et al.  1.5D Egocentric Dynamic Network Visualization , 2015, IEEE Transactions on Visualization and Computer Graphics.

[22]  Hong Zhou,et al.  OpinionSeer: Interactive Visualization of Hotel Customer Feedback , 2010, IEEE Transactions on Visualization and Computer Graphics.

[23]  Donald E. Knuth The Stanford GraphBase: a platform for combinatorial algorithms , 1993, SODA '93.

[24]  Ben Shneiderman,et al.  A dual-view approach to interactive network visualization , 2007, CIKM '07.

[25]  Hong Zhou,et al.  Visualization of bipartite relations between graphs and sets , 2015, J. Vis..

[26]  Hong Zhou,et al.  LoyalTracker: Visualizing Loyalty Dynamics in Search Engines , 2014, IEEE Transactions on Visualization and Computer Graphics.

[27]  Danah Boyd,et al.  Vizster: visualizing online social networks , 2005, IEEE Symposium on Information Visualization, 2005. INFOVIS 2005..

[28]  Kon Shing Kenneth Chung,et al.  Egocentric analysis of co-authorship network structure, position and performance , 2012, Inf. Process. Manag..

[29]  Jonathan C. Roberts,et al.  Visual comparison for information visualization , 2011, Inf. Vis..

[30]  Edward M. Reingold,et al.  Graph drawing by force‐directed placement , 1991, Softw. Pract. Exp..

[31]  Donald E. Knuth,et al.  The Stanford GraphBase - a platform for combinatorial computing , 1993 .

[32]  Nicholas Chen,et al.  TreeJuxtaposer : Scalable Tree Comparison using Focus + Context with Guaranteed Visibility , 2006 .

[33]  Alexandru Telea,et al.  Code Flows: Visualizing Structural Evolution of Source Code , 2008, Comput. Graph. Forum.

[34]  J. Munkres ALGORITHMS FOR THE ASSIGNMENT AND TRANSIORTATION tROBLEMS* , 1957 .

[35]  Tamara Munzner,et al.  Visualization Analysis and Design , 2014, A.K. Peters visualization series.

[36]  Hong Zhou,et al.  Visual Analysis of Set Relations in a Graph , 2013, Comput. Graph. Forum.

[37]  M. Newman,et al.  Finding community structure in networks using the eigenvectors of matrices. , 2006, Physical review. E, Statistical, nonlinear, and soft matter physics.

[38]  M. Newman Coauthorship networks and patterns of scientific collaboration , 2004, Proceedings of the National Academy of Sciences of the United States of America.

[39]  Lise Getoor,et al.  Ego-centric Graph Pattern Census , 2012, 2012 IEEE 28th International Conference on Data Engineering.