Multidimensional Projections for Visual Analysis of Social Networks

被引:5
作者
Rafael Messias Martins [1 ]
Gabriel Faria Andery [2 ]
Henry Heberle [1 ]
Fernando Vieira Paulovich [1 ]
Alneu de Andrade Lopes [1 ]
Helio Pedrini [3 ,4 ]
Rosane Minghim [1 ,4 ]
机构
[1] Institute of Mathematics and Computer Science,University of So Paulo,So Carlos -,Brazil
[2] CPM Braxis Capgemini,So Paulo -,Brazil
[3] Institute of Computing,University of Campinas,Campinas-SP -,Brazil
[4] IEEE
基金
巴西圣保罗研究基金会;
关键词
social network; visual exploration; multidimensional visualization;
D O I
暂无
中图分类号
TP391.41 [];
学科分类号
080203 ;
摘要
Visual analysis of social networks is usually based on graph drawing algorithms and tools.However,social networks are a special kind of graph in the sense that interpretation of displayed relationships is heavily dependent on context.Context,in its turn,is given by attributes associated with graph elements,such as individual nodes,edges,and groups of edges,as well as by the nature of the connections between individuals.In most systems,attributes of individuals and communities are not taken into consideration during graph layout,except to derive weights for force-based placement strategies.This paper proposes a set of novel tools for displaying and exploring social networks based on attribute and connectivity mappings.These properties are employed to layout nodes on the plane via multidimensional projection techniques.For the attribute mapping,we show that node proximity in the layout corresponds to similarity in attribute,leading to easiness in locating similar groups of nodes.The projection based on connectivity yields an initial placement that forgoes force-based or graph analysis algorithm,reaching a meaningful layout in one pass.When a force algorithm is then applied to this initial mapping,the final layout presents better properties than conventional force-based approaches.Numerical evaluations show a number of advantages of pre-mapping points via projections.User evaluation demonstrates that these tools promote ease of manipulation as well as fast identification of concepts and associations which cannot be easily expressed by conventional graph visualization alone.In order to allow better space usage for complex networks,a graph mapping on the surface of a sphere is also implemented.
引用
收藏
页码:791 / 810
页数:20
相关论文
共 8 条
[1]   Tag-Aware Recommender Systems:A State-of-the-Art Survey [J].
张子柯 ;
周涛 ;
张翼成 .
JournalofComputerScience&Technology, 2011, 26 (05) :767-777
[2]  
GraphDice: A System for Exploring Multivariate Social Networks[J] . A.Bezerianos,F.Chevalier,P.Dragicevic,N.Elmqvist,J.D.Fekete.Computer Graphics Forum . 2010 (3)
[3]  
Implicit affinity networks and social capital[J] . M. Smith,C. Giraud-Carrier,N. Purser.Information Technology and Management . 2009 (2)
[4]   Normalized compression distance for visual analysis of document collections [J].
Telles, G. P. ;
Minghim, R. ;
Paulovich, F. V. .
COMPUTERS & GRAPHICS-UK, 2007, 31 (03) :327-337
[5]   A guided tour to approximate string matching [J].
Navarro, G .
ACM COMPUTING SURVEYS, 2001, 33 (01) :31-88
[6]   MULTIDIMENSIONAL-SCALING ON A SPHERE [J].
COX, TF ;
COX, MAA .
COMMUNICATIONS IN STATISTICS-THEORY AND METHODS, 1991, 20 (09) :2943-2953
[7]  
A vector space model for automatic indexing[J] . G. Salton,A. Wong,C. S. Yang.Communications of the ACM . 1975 (11)
[8]  
The Collection of Computer Science Bibliographies .2 http://liinwww.ira.uka.de/bibliography . 2011