KIPS Transactions on Computer and Communication Systems (정보처리학회논문지:컴퓨터 및 통신 시스템)

Korea Information Processing Society (한국정보처리학회)
권호 표지
DOI QR코드

DOI QR Code

Local Information-based Betweenness Centrality to Identify Important Nodes in Social Networks

사회관계망에서 중요 노드 식별을 위한 지역정보 기반 매개 중심도

  • 손진곤 (한국방송통신대학교 컴퓨터과학과) ;
  • 김용환 (한국기술교육대학교 컴퓨터공학부) ;
  • 한연희 (한국기술교육대학교 컴퓨터공학부)
  • Received : 2013.03.19
  • Accepted : 2013.04.16
  • Published : 2013.05.31
Download PDF
⟨ Previous Next ⟩

Abstract

In traditional social network analysis, the betweenness centrality measure has been heavily used to identify the relative importance of nodes in terms of message delivery. Since the time complexity to calculate the betweenness centrality is very high, however, it is difficult to get it of each node in large-scale social network where there are so many nodes and edges. In this paper, we define a new type of network, called the expanded ego network, which is built only with each node's local information, i.e., neighbor information of the node's neighbor nodes, and also define a new measure, called the expended ego betweenness centrality. Through the intensive experiment with Barab$\acute{a}$si-Albert network model to generate the scale-free networks which most social networks have as their embedded feature, we also show that the nodes' importance rank based on the expanded ego betweenness centrality has high similarity with that based on the traditional betweenness centrality.

전통적인 사회관계망 분석에 있어서 각 노드의 매개 중심도는 메시지 전달 측면에서의 각 노드들의 상대적인 중요도를 파악하는 척도로 오랫동안 사용되어 왔다. 하지만, 매개 중심도를 산출하기 위한 계산 복잡도가 높기 때문에 노드의 수와 간선의 수가 매우 많은 대규모 사회관계망에서는 각 노드의 매개 중심도를 산출하기가 어렵다. 본 논문에서는 각 노드들마다 자신의 지역정보, 즉 이웃노드들이 지닌 각각의 이웃노드 정보를 활용하여 구성가능한 확장 자아 네트워크(Expanded Ego Network)를 새롭게 정의하고 이러한 네트워크를 기반으로 확장 자아 매개 중심도(Expanded Ego Betweenness Centrality)를 정의한다. 일반적인 사회관계망의 특성인 척도 없는 네트워크(Scale-free Network)를 생성할 수 있는 Barab$\acute{a}$si-Albert 네트워크 모델을 사용한 실험을 통하여 제안한 확장 자아 매개 중심도의 각 노드별 순위는 기존의 전통적인 방식으로 산출한 매개 중심도의 각 노드별 순위와 거의 일치함을 보인다.

Keywords

References

  1. H. Kwak, C. Lee, H. Park, and S. Moon, "What is Twitter, a social network or a new media?," in Proceedings of the 19th International World Wide Web (WWW) Conference, pp.591-600, April 26-30, 2010.
  2. R. Pittinger, "Linkbar and Forensik: Two Systems for Interactive Visualization of Online Social Networks," University of Applied Sciences Augsburg, 2007.
  3. Lei Tang and Huan Liu, "Community Detection and Mining in Social Media," Synthesis Lectures on Data Mining and Knowledge Discovery, Vol.2, No.1, 2010.
  4. S. Wasserman and K. Faust. "Social Network Analysis: Methods and Applications," Cambridge University Press, 1994.
  5. U. Brandes. "A Faster Algorithm for Betweenness Centrality," Journal of Mathematical Sociology, Vol.25, No.2, pp.163-177, 2001. https://doi.org/10.1080/0022250X.2001.9990249
  6. M. Baglioni, F. Geraci, M. Pellegrini and E. Lastres, "Fast Exact Computation of Betweenness Centrality in Social Networks," in Proceedings of IEEE/ACM International Conference on Advances in Social Networks Analysis and Mining, pp.450-456, 2012.
  7. M. Everett, S. P. Borgatti, "Ego Network Betweenness," Social Networks, Vol.27, No.1, pp.31-38, Jan., 2005. https://doi.org/10.1016/j.socnet.2004.11.007
  8. F. Odella, "Using Ego-networks in Surveys: Methodological and Research Issues," In Proceedings of International Conference on Network Science, May, 2006.
  9. E. Daly and M. Haahr, "Social Network Analysis for Information Flow in Disconnected Delay-Tolerant MANETs," IEEE Trans. on Mobile Computing, Vol.8, No.5, pp.606-621, May, 2009. https://doi.org/10.1109/TMC.2008.161
  10. Y.-h. Kim, C.-M. Kim, Y.-H. Han, Y.-S. Jeong and D.-S. Park, "Betweenness of Expanded Ego Networks in Sociality-Aware Delay Tolerant Networks," Ubiquitous Information Technologies and Applications (LNEE, Proc. of CUTE 2012), Springer, pp.499-505, Dec., 2012.
  11. A. Mtibaa, M. May, M. Ammar, and C. Diot. "PeopleRank: combining social and contact information for opportunistic forwarding," In Proceedings of INFOCOM, 2010.
  12. F. Fabbri and R. Verdone, "A sociability-based routing scheme for delay-tolerant networks," EURASIP Journal on Wireless Communications and Networking, Jan., 2011.
  13. A. L. Barabasi and R. Albert "Emergence of scaling in random networks," Science 286, pp.509-512, 1999. https://doi.org/10.1126/science.286.5439.509
  14. P. Holme and B. J. Kim, "Growing scale-free networks with tunable clustering," Physics Review. E, 65, 026107, 2002. https://doi.org/10.1103/PhysRevE.65.026107
  15. B. A. Huberman, D. M. Romero, and F. Wu. "Social networks that matter: Twitter under the microscope," First Monday, Vol.14, No.1, 2009.

Cited by

  1. Ad Hoc Routing Method Based on Betweenness Centrality and Location Information for Unmanned Ground System Networks vol.41, pp.4, 2016, https://doi.org/10.7840/kics.2016.41.4.441
  2. An Efficient Algorithm for Betweenness Centrality Estimation in Social Networks vol.4, pp.1, 2015, https://doi.org/10.3745/KTSDE.2015.4.1.37
  3. An Opportunistic Routing Scheme Based on Social Relations in Delay-Tolerant Networks vol.3, pp.1, 2014, https://doi.org/10.3745/KTCCS.2014.3.1.15
  4. Message Delivery Techniques using Group Intimacy Information among Nodes in Opportunistic Networks vol.42, pp.7, 2015, https://doi.org/10.5626/JOK.2015.42.7.929