This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
Improving the Readability of Clustered Social Networks using Node Duplication
November/December 2008 (vol. 14 no. 6)
pp. 1317-1324
ASCII Text
x 
 
Nathalie y Henr, Anastasia Bezerianos, Jean-Daniel Fekete, "Improving the Readability of Clustered Social Networks using Node Duplication," IEEE Transactions on Visualization and Computer Graphics, vol. 14, no. 6, pp. 1317-1324, November/December, 2008.
 
 
BibTex
x
 
@article{ 10.1109/TVCG.2008.141,
author = {Nathalie y Henr and Anastasia Bezerianos and Jean-Daniel Fekete},
title = {Improving the Readability of Clustered Social Networks using Node Duplication},
journal ={IEEE Transactions on Visualization and Computer Graphics},
volume = {14},
number = {6},
issn = {1077-2626},
year = {2008},
pages = {1317-1324},
doi = {http://doi.ieeecomputersociety.org/10.1109/TVCG.2008.141},
publisher = {IEEE Computer Society},
address = {Los Alamitos, CA, USA},
}
 
 
RefWorks Procite/RefMan/Endnote
x 
 
TY - JOUR
JO - IEEE Transactions on Visualization and Computer Graphics
TI - Improving the Readability of Clustered Social Networks using Node Duplication
IS - 6
SN - 1077-2626
SP1317
EP1324
EPD - 1317-1324
A1 - Nathalie y Henr,
A1 - Anastasia Bezerianos,
A1 - Jean-Daniel Fekete,
PY - 2008
KW - Index Terms—Clustering
KW - Graph Visualization
KW - Node Duplications
KW - Social Networks
VL - 14
JA - IEEE Transactions on Visualization and Computer Graphics
ER -
 
Nathalie y Henr, INRIA-LRI and Univ. of Sydney
Exploring communities is an impor tant task in social network analysis. Such communities are currently identified using clustering methods to group actors. This approach often leads to actors belonging to one and only one cluster, whereas in real life a person can belong to several communities. As a solution we propose duplicating actors in social networks and discuss potential impact of such a move. Several visual duplication designs are discussed and a controlled experiment comparing network visualization with and without duplication is performed, using 6 tasks that are impor tant for graph readability and visual interpretation of social networks. We show that in our experiment, duplications significantly improve community-related tasks but sometimes interfere with other graph readability tasks. Finally, we propose a set of guidelines for deciding when to duplicate actors and choosing candidates for duplication, and alternative ways to render them in social network representations.

[1] Ge nopro. http:/www.genopro.com/.
[2] J. Abello, F. van Ham, and N. Krishnan, Ask-graphview: A large scale graph visualization system. IEEE TVCG journal, 12 (5): 669–676, 2006.
[3] D. Auber, Y. Chiricota, F. Jourdan, and G. Melançon, Multiscale visualization of small world networks. In Proc. of IEEE Symposium on Information Visualization (InfoVis'03), pages 75–81. IEEE Press, 2003.
[4] L. Bartram and C. Ware, Filtering and brushing with motion. Information Visualization, 1 (1): 66–79, 2002.
[5] L. Bartram, C. Ware, and T. Calvert, Moticons: detection, distraction and task. Int. J. Hum.-Comput. Stud., 58 (5): 515–545, 2003.
[6] J. Bertin, Semiology of graphics. University of Wisconsin Press, 1983.
[7] S. K. Card and J. Mackinlay, The structure of the information visualization design space. In Proc. of IEEE Symposium on Information Visualization (InfoVis'97), Washington, DC, USA, 1997.
[8] G. Di Battista, P. Eades, R. Tamassia, and I. G. Tollis, Graph Drawing: Algorithms for the Visualization of Graphs. Prentice Hall PTR, 1998.
[9] P. Eades and C. F. X. de Mendonca N, Vertex splitting and tension-free layout. Proc. of Graph Drawing'95, LNCS, 1027: 202–211, 1995.
[10] P. Eades and Q.-W. Feng, Multilevel visualization of clustered graphs. In Proc. Graph Drawing, GD, number 1190, pages 101–112, Berlin, Germany, 18–20 1996. Springer-Verlag.
[11] P. Eades, Q.-W. Feng, and X. Lin, Straight-line drawing algorithms for hierarchical graphs and clustered graphs. In Proc. of the Symposium on Graph Drawing'96, pages 113–128, London, UK, 1997. Springer-Verlag.
[12] P. Eklund, N. Roberts, and S. Green, Ontorama: Browsing rdf ontologies using a hyperbolic-style browser. In Proc. of the First International Symposium on Cyber Worlds (CW'02), page 0405, Washington, DC, USA, 2002. IEEE Computer Society.
[13] M. Ghoniem, J.-D. Fekete, and P. Castagliola, On the readability of graphs using node-link and matrix-based representations: a controlled experiment and statistical analysis. Information Visualization, 4 (2): 114–135, 2005.
[14] M. Girvan and M. E. Newman, Community structure in social and biological networks. Proc Natl Acad Sci U S A, 99 (12): 7821–7826, June 2002.
[15] N. Henry and J.-D. Fekete, MatrixExplorer: a Dual-Representation System to Explore Social Networks. IEEE TVCG journal (IEEE InfoVis'06 proc.), 12 (5): 677–684, 2006.
[16] N. Henry and J.-D. Fekete, Matlink: Enhanced matrix visualization for analyzing social networks. Proc. of the 11th IFIP TC13 International Conference Interact'07, LNCS 4663: 288–302, 2007.
[17] N. Henry, J.-D. Fekete, and M. J. McGuffin, NodeTrix: a hybrid visualization of social networks. IEEE TVCG journal (IEEE InfoVis'07 Proc.), 13 (6): 1302–1309, 2007.
[18] I. 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.
[19] D. Holten, Hierarchical edge bundles: Visualizaiton of adjacency relations in hierarchical data. IEEE Transactions on Visualization and Computer Graphics, 12 (5): 741–748, 2006.
[20] A. K. Jain, M. N. Murty, and P. J. Flynn, Data clustering: a review. ACM Computing Surveys, 31 (3): 264–323, 1999.
[21] H. Kang, C. Plaisant, B. Lee, and B. B. Bederson, Netlens: Iterative exploration of content-actor network data. Proc. of IEEE Symposium on VAST, pages 91–98, 2006.
[22] B. Lee, M. Czerwinski, G. Robertson, and B. B. Bederson, Understanding eight years of infovis conferences using PaperLens. In Proc. of the IEEE Symposium on Information Visualization, page 216.3, Washington, DC, USA, 2004. IEEE Computer Society.
[23] B. Lee, C. S. Parr, C. Plaisant, B. B. Bederson, V. D. Veksler, W. D. Gray, and C. Kotfila, Treeplus: Interactive exploration of networks with enhanced tree layouts. IEEE TVCG journal, 12 (6): 1414–1426, 2006.
[24] M. McGrath, J. Blythe, and D. Krackhardt, The effect of spatial arrangement on judgments and errors in interpreting graphs. Social Networks, 19 (3): 223–242, 1997.
[25] A. Noack, Energy-based clustering of graphs with nonuniform degrees. In P. Healy and N. S. Nikolov, editors, Proc. of the Graph Drawing (GD'05), pages 309–320, Limerick, Ireland, 2005. Springer-Verlag.
[26] J. O'Madadhain, D. Fisher, P. Smyth, S. White, and Y.-B. Boey, Analysis and visualization of network data using jung. Journal of Statistical Software, Preprint, pages 1–35, 2005.
[27] C. Plaisant, B. Lee, C. S. Parr, J.-D. Fekete, and N. Henry, Task taxonomy for graph visualization. In BEyond time and errors: novel evaLuation methods for Information Visualization (BELIV'06), pages 82–86, Venice, Italy, 2006. ACM Press.
[28] H. Purchase, Which aesthetic has the greatest effect on human understanding. In G. Di Battista, editor, Graph Drawing, Rome, Italy, September 18–20, 1994, pages pp. 248–261. Springer, 1998.
[29] A. Treisman, Preattentive processing in vision. Computer Vision, Graphics, and Image Processing, 31 (2): 156–177, 1985.
[30] C. Ware, H. Purchase, L. Colpoys, and M. McGill, Cognitive measurements of graph aesthetics. Information Visualization, 1 (2): 103–110, 2002.
[31] S. Wasserman and K. Faust, Social Network Analysis. Cambridge University Press, 1994.
[32] D. J. Watts and S. H. Strogatz, Collective dynamics of 'small-world' networks. Nature, 393: 440 – 442, 1998.

Index Terms:
Index Terms—Clustering, Graph Visualization, Node Duplications, Social Networks
Citation:
Nathalie y Henr, Anastasia Bezerianos, Jean-Daniel Fekete, "Improving the Readability of Clustered Social Networks using Node Duplication," IEEE Transactions on Visualization and Computer Graphics, vol. 14, no. 6, pp. 1317-1324, Nov.-Dec. 2008, doi:10.1109/TVCG.2008.141
Usage of this product signifies your acceptance of the Terms of Use.