메뉴 건너뛰기




Volumn 30, Issue 8, 2011, Pages 2314-2327

Social network clustering and visualization using hierarchical edge bundles

Author keywords

Betweenness centrality; Edge bundles; Network clustering; Visualization

Indexed keywords

FLOW VISUALIZATION; MODULAR CONSTRUCTION;

EID: 84858708895     PISSN: 01677055     EISSN: 14678659     Source Type: Journal    
DOI: 10.1111/j.1467-8659.2011.02037.x     Document Type: Article
Times cited : (13)

References (41)
  • 6
    • 0035648637 scopus 로고    scopus 로고
    • A faster algorithm for betweenness centrality
    • BRANDES U.: A faster algorithm for betweenness-centrality-Journal of Mathematical Sociology 25, 2-(2001), 163-177.
    • (2001) Journal of Mathematical Sociology , vol.25 , Issue.2 , pp. 163-177
    • Brandes, U.1
  • 12
    • 85081444987 scopus 로고    scopus 로고
    • Statitics(last visited on April, 2011),-April
    • Facebook: Statitics-http://www.facebook.com/-press/info.php?statistics (last visited on April, 2011),-April 2011.
    • (2011)
  • 15
    • 84865730611 scopus 로고
    • A set ofmeasures of centrality based upon betweenness
    • FREEMAN L-C.: A set ofmeasures of centrality based-upon betweenness-Sociometry 40, 1 (1977), 35-41.
    • (1977) Sociometry , vol.40 , Issue.1 , pp. 35-41
    • Freeman, L.-C.1
  • 17
    • 77951138987 scopus 로고    scopus 로고
    • Performance of modularity maximization in practical contexts
    • GOOD B-H., DE MONTJOYE Y-A., CLAUSET A.:-Performance of modularity maximization in practical contexts.-Physical Review E 81, 4 (2010), 046106.
    • (2010) Physical Review e , vol.81 , Issue.4 , pp. 046106
    • Good, B.-H.1    De Montjoye, Y.-A.2    Clauset, A.3
  • 21
    • 33845640864 scopus 로고    scopus 로고
    • Hierarchical edge bundles: Visualization of adjacency relations in hierarchical data
    • HOLTEN D.: Hierarchical edge bundles: Visualization-of adjacency relations in hierarchical data-IEEE-Transactions on Visualization and Computer Graphics 12,-5 (2006), 741-748.
    • (2006) IEEE-Transactions on Visualization and Computer Graphics , vol.12 , Issue.5 , pp. 741-748
    • Holten, D.1
  • 22
    • 85081452614 scopus 로고    scopus 로고
    • Drawing Trees: How Many
    • Tech-Rep-hdl.handle.net/2142/14068,-University of Illinois, Department of Computer Science
    • JIA Y., HART J-C.: Drawing Trees: How Many-Circles to Use? Tech-Rep-hdl.handle.net/2142/14068,-University of Illinois, Department of Computer Science,-2008.
    • (2008) Circles to Use
    • Jia, Y.1    Hart, J.-C.2
  • 24
    • 84882551380 scopus 로고    scopus 로고
    • Edge v node parallelism for graph centrality metrics
    • HWU W.-M-(Ed.)-Morgan-Kaufmann
    • JIA Y., LU V., HOBEROCK J., GARLAND M., HART J.-C.: Edge v-node parallelism for graph centrality metrics.-In GPU Computing Gems 2, HWU W.-M-(Ed.)-Morgan-Kaufmann (2011), pp-15-30.
    • (2011) GPU Computing Gems 2 , pp. 15-30
    • Jia, Y.1    Hoberock, J.2    Garland, M.3    Hart, J.C.4
  • 25
    • 85081447242 scopus 로고    scopus 로고
    • application (last visited on April2011)
    • JIA Y., TELLA H., HART J-C.: Friend Insight (facebook-application)-http:/ /apps.facebook.com/friendinsight-(last visited on April 2011), 2009.
    • (2009) Friend Insight
    • Jia, Y.1    Tella, H.2    Hart, J.-C.3
  • 30
    • 85081453384 scopus 로고    scopus 로고
    • NCAA: Team listing, division I football statistics (last visited on April, 2011), 2000
    • NCAA: Team listing, division I football statistics.-http://web1.ncaa.org/ d1mfb/mainpage.jsp?year=2000-(last visited on April, 2011), 2000.
  • 32
    • 42749100809 scopus 로고    scopus 로고
    • Fast algorithm for detecting community structure in networks
    • NEWMAN M.: Fast algorithm for detecting community-structure in networks-Physical Review E 69, 6-(2004), 066133.
    • (2004) Physical Review e , vol.69 , Issue.6 , pp. 066133
    • Newman, M.1
  • 33
    • 37649028224 scopus 로고    scopus 로고
    • Finding and evaluating community structure in networks
    • NEWMAN M., GIRVAN M.: Finding and evaluating-community structure in networks-Physical Review E 69,-2 (Feb 2004), 026113.
    • (2004) Physical Review e , vol.69 , Issue.2 , pp. 026113
    • Newman, M.1    Girvan, M.2
  • 37
    • 84958155918 scopus 로고    scopus 로고
    • Discovering important nodes through graph entropy the case of Enron email database
    • Chicago, IL, USA
    • SHETTY J., ADIBI J.: Discovering important nodes-through graph entropy the case of Enron email database.-In Proceedings of the 3rd International Workshop on Link-Discovery (Chicago, IL, USA, 2005), pp-74-81.
    • (2005) Proceedings of the 3rd International Workshop on Link-Discovery , pp. 74-81
    • Shetty, J.1    Adibi, J.2
  • 38
    • 84976715951 scopus 로고
    • Tree visualization with tree-maps: 2-d space-filling approach
    • SHNEIDERMAN B.: Tree visualization with tree-maps:-2-d space-filling approach-ACM Transactions on Graphics-11, 1 (1992), 92-99.
    • (1992) ACM Transactions on Graphics. , vol.11 , Issue.1 , pp. 92-99
    • Shneiderman, B.1
  • 39
    • 53149146319 scopus 로고    scopus 로고
    • Centrality based visualization of small world graphs
    • VAN HAM F., WATTENBERG M.: Centrality based-visualization of small world graphs-Computer Graphics-Forum 27, 3 (2008), 975-982.
    • (2008) Computer Graphics-Forum , vol.27 , Issue.3 , pp. 975-982
    • Van Ham, F.1    Wattenberg, M.2
  • 40
    • 85081448896 scopus 로고    scopus 로고
    • VisualizationLab@UCB: Flare - data visualization-for the web-UC Berkeley Visualization Lab(last visited on April, 2011), 2009
    • VisualizationLab@UCB: Flare - data visualization-for the web-UC Berkeley Visualization Lab,-http://flare.prefuse.org (last visited on April, 2011), 2009.


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