메뉴 건너뛰기




Volumn , Issue , 2011, Pages 354-361

Group-in-a-box layout for multi-faceted analysis of communities

Author keywords

Clustering; Communities; Force directed; Group in a box; Layout; Meta layout; Network visualization; Semantic substrates

Indexed keywords

CLUSTERING; FORCE-DIRECTED; GROUP-IN-A-BOX; LAYOUT; META-LAYOUT; NETWORK VISUALIZATION;

EID: 84862968380     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/PASSAT/SocialCom.2011.139     Document Type: Conference Paper
Times cited : (48)

References (24)
  • 1
    • 21344440771 scopus 로고
    • Using Treemaps to Visualize the Analytic Hierarchy Process
    • Asahi, T., Turo, D. and Shneiderman, B. (1995) Using treemaps to visualize the analytic hierarchy process. Information Systems Research, 6(4): 357-375. (Pubitemid 126102970)
    • (1995) Information Systems Research , vol.6 , Issue.4 , pp. 357-375
    • Asahi, T.1    Toro, D.2    Shneiderman, B.3
  • 2
    • 0038483826 scopus 로고    scopus 로고
    • Emergence of scaling in random networks
    • Barabási, A.L. and Albert, R. (1999). Emergence of scaling in random networks. Science, 286(5439): 509-512.
    • (1999) Science , vol.286 , Issue.5439 , pp. 509-512
    • Barabási, A.L.1    Albert, R.2
  • 3
    • 41349117788 scopus 로고    scopus 로고
    • Finding community structure in very large networks
    • Clauset, A., Newman, M.E.J. and Moore, C. (2004) Finding community structure in very large networks. Physics Review E, 70, 06111.
    • (2004) Physics Review e , vol.70 , pp. 06111
    • Clauset, A.1    Newman, M.E.J.2    Moore, C.3
  • 4
    • 0001070640 scopus 로고
    • A heuristic for graph drawing
    • Eades, P. (1984). A Heuristic for Graph Drawing. Congressus Numerantium, 42:149-160.
    • (1984) Congressus Numerantium , vol.42 , pp. 149-160
    • Eades, P.1
  • 5
    • 84957692275 scopus 로고    scopus 로고
    • Multilevel Visualization of Clustered Graphs
    • Graph Drawing
    • Eades, P. and Feng, Q.-W. (1997). Multilevel Visualization of Clustered Graphs, Proc. Graph Drawing, LNCS, 1190: 101-112. (Pubitemid 127024204)
    • (1997) Lecture Notes in Computer Science , Issue.1190 , pp. 101-112
    • Eades, P.1    Feng, Q.W.2
  • 6
    • 0001540595 scopus 로고
    • Publicationes Mathematicae (Debrecen)
    • Erdös, P. and Rényi, A. (1959). On random graphs. Publicationes Mathematicae (Debrecen), 6:290-297.
    • (1959) On Random Graphs , vol.6 , pp. 290-297
    • Erdös, P.1    Rényi, A.2
  • 8
    • 84865730611 scopus 로고
    • A set of measures of centrality based on betweenness
    • Freeman, L. C. (1977). A set of measures of centrality based on betweenness.Sociometry, 40:35-41.
    • (1977) Sociometry , vol.40 , pp. 35-41
    • Freeman, L.C.1
  • 11
    • 4043171150 scopus 로고    scopus 로고
    • A fast multi-scale algorithm for drawing large graphs
    • Harel, D. and Koren, Y. (2002). A Fast Multi-Scale Algorithm for Drawing Large Graphs. J. of Graph Algorithms Appl., 6(3):179-202.
    • (2002) J. of Graph Algorithms Appl. , vol.6 , Issue.3 , pp. 179-202
    • Harel, D.1    Koren, Y.2
  • 15
    • 85032279305 scopus 로고
    • Treemaps: A space-filling approach to the visualization of hierarchical information structures
    • Johnson, B. and Shneiderman, B. (1991). Treemaps: A space-filling approach to the visualization of hierarchical information structures, Proc. 2nd International IEEE Visualization Conference, 284-291.
    • (1991) Proc. 2nd International IEEE Visualization Conference , pp. 284-291
    • Johnson, B.1    Shneiderman, B.2
  • 16
    • 84947922995 scopus 로고
    • Constraint-Based Spring-Model Algorithm for Graph Layout
    • Kamps, T., Kleinz J. and Read, J. (1995). Constraint-Based Spring- Model Algorithm for Graph Layout, Proc. Graph Drawing 95, LNCS 1027, 349-360. (Pubitemid 126025102)
    • (1995) Lecture Notes in Computer Science , Issue.1027 , pp. 349-360
    • Kamps, T.1    Kleinz, J.2    Read, J.3
  • 17
    • 84862910478 scopus 로고
    • Simple representations of complex networks: Strategies for visualizing network structure
    • Presented at, Munich
    • Krempel, L. (1993). Simple representations of complex networks: strategies for visualizing network structure. Presented at the 3rd European Conference for Network Analysis, Munich.
    • (1993) The 3rd European Conference for Network Analysis
    • Krempel, L.1
  • 19
    • 84976715951 scopus 로고
    • Tree visualization with tree-maps: 2-d spacefilling approach
    • Shneiderman, B. (1992) Tree visualization with tree-maps: 2-d spacefilling approach. ACM Transactions on Graphics, 11(1):92-99.
    • (1992) ACM Transactions on Graphics , vol.11 , Issue.1 , pp. 92-99
    • Shneiderman, B.1
  • 22
    • 61349089223 scopus 로고    scopus 로고
    • CONTEST: A controllable test matrix toolbox for MATLAB
    • Article 26
    • Taylor, A. and Higham, D.J. (2009). CONTEST: a controllable test matrix toolbox for MATLAB. ACM Transactions on Mathematical Software, 35(4), Article 26.
    • (2009) ACM Transactions on Mathematical Software , vol.35 , Issue.4
    • Taylor, A.1    Higham, D.J.2
  • 23
    • 35348829816 scopus 로고    scopus 로고
    • Finding community structure in mega-scale social networks: [Extended abstract]
    • DOI 10.1145/1242572.1242805, 16th International World Wide Web Conference, WWW2007
    • Wakita, K. and Tsurumi, Y. (2007). Finding community structure in mega-scale social networks, Proc. 16th International Conference on World Wide Web, 1275-1276. (Pubitemid 47582418)
    • (2007) 16th International World Wide Web Conference, WWW2007 , pp. 1275-1276
    • Wakita, K.1    Tsurumi, T.2
  • 24
    • 0032482432 scopus 로고    scopus 로고
    • Collective dynamics of'smallworld'networks
    • Watts, D.J. and Strogatz, S.H. (1998). Collective dynamics of'smallworld'networks. Nature, 393:440-442.
    • (1998) Nature , vol.393 , pp. 440-442
    • Watts, D.J.1    Strogatz, S.H.2


* 이 정보는 Elsevier사의 SCOPUS DB에서 KISTI가 분석하여 추출한 것입니다.