한국컴퓨터정보학회논문지 (Journal of the Korea Society of Computer and Information)

  • 제19권12호
  • /
  • Pages.239-246
  • /
  • 2014
  • /
  • 1598-849X(pISSN)
  • /
  • 2383-9945(eISSN)
한국컴퓨터정보학회 (Korean Society of Computer Information)
권호 표지
DOI QR코드

DOI QR Code

적합도 함수를 이용한 커뮤니티 통합에 필요한 추가에지수 결정 및 위치 선정 방법

A Method to Decide the Number of Additional Edges and Their Locations to Integrate the Communities by Using Fitness Function

  • 투고 : 2014.10.24
  • 심사 : 2014.11.10
  • 발행 : 2014.12.31
PDF 다운로드
⟨ 이전 논문 다음 논문 ⟩

초록

본 논문에서는 네트워크 내에 존재하는 두 개의 커뮤니티 A,B($${\mid}A{\mid}{\geq_-}{\mid}B{\mid}$$, ${\mid}{\cdot}{\mid}$는 커뮤니티의 노드 개수)를 통합하는데 필요한 에지 수 및 에지 위치를 결정하는 알고리즘을 제안한다. 제안된 알고리즘은 커뮤니티 내,외부로 향하는 에지들의 개수를 이용하여 커뮤니티의 성질을 나타내는 적합도 함수를 이용하고, 큰 값을 가질수록 커뮤니티로서의 성질이 크다는 것을 의미한다. 제안된 알고리즘은 그리디 방식으로, B의 하나의 노드에 대해 해당 노드를 A로 병합할 때 커뮤니티 A의 적합도 값이 증가할 수 있는 최소에지수를 결정한다. 최소에지수가 결정된 후, 새로 추가될 에지의 위치를 결정하기 위해 노드 중앙성을 이용한 커뮤니티 연결도 지표를 정의한다. 추가 에지의 위치는 통합된 커뮤니티 연결도 지표를 최대로 만들 수 있도록 결정한다. B의 모든 노드에 대해 이러한 과정을 적용하여 두 커뮤니티를 통합한다. Zachary의 가라데클럽 네트워크를 이용하여 제안된 알고리즘의 실효성을 검증하였다.

In this paper, we propose a method to decide the additional edges in order to integrate two communitites A,B($${\mid}A{\mid}{\geq_-}{\mid}B{\mid}$$, ${\mid}{\cdot}{\mid}$ is the size of the set). The proposed algorithm uses a fitness function that shows the property of a community and the fitness function is defined by the number of edges which exist in the community and connect two nodes, one is in the community and the other is out of the community. The community has a strong property when the function has a large value. The proposed algorithm is a kind of greedy method and when a node of B is merged to A, the minimum number of additional edges is decided to increase the fitness function value of A. After determining the number of additional edges, we define the community connectivity measures using the node centrality to determine the edges locations. The connections of the new edges are fixed to maximize the connectivity measure of the combined community. The procedure is applied for all nodes in B to integrate A and B. The effectiveness of the proposed algorithm is shown by solving the Zachary Karate Club network.

키워드

참고문헌

  1. W.W. Zachary, "An Information Flow Model for Conflict and Fission in Small Groups", J. of Anthropological Research, Vol. 33, pp.452-473, 1977. https://doi.org/10.1086/jar.33.4.3629752
  2. S. Fortunato, "Community Detection in Graphs", Physics Reports, Vol. 486, No. 3-5, pp.75-174, Feb. 2010. https://doi.org/10.1016/j.physrep.2009.11.002
  3. A. Clauset, "Finding Local Community Structure in Networks", Phys. Rev. E 72, 026132, Aug. 2005. https://doi.org/10.1103/PhysRevE.72.026132
  4. F. Luo, J.Z. Wang, and E. Promislow, "Exploring Local Community Structures in Large Networks", Proceeding WI '06 Proceedings of the 2006 IEEE/WIC/ACM International Conference on Web Intelligence pp.233-239, 2006.
  5. J. Bagrow, "Evaluating Local Community Methods in Networks", J. Stat. Mech. P05001, 2008.
  6. J. Chen, O. Zaiane, and R. Goebel, "Local Community Identification in Social Networks", Social Network Analysis and Mining, ASONAM, 2009.
  7. A. Lancichinetti, S. Fortunato, and J. Kertesz, "Detecting the Overlapping and Hierarchical Community Structure in Complex Networks", New Journal of Physics, Vol. 11, 033015, Mar. 2009. https://doi.org/10.1088/1367-2630/11/3/033015
  8. H. Tong, B.A. Prakash, T. Eliassi-Rad, M. Faloutsos, and C. Faloutsos, "Gelling, and Melting, Large Graphs by Edge Manipulation", CIKM '12 Proceedings of the 21st ACM international conference on Information and knowledge management, pp.245-254, 2012.
  9. B.H. Jun, and C.G. Han, "A method to decide the number of additional edges to integrate the communities in social network by using modularity", Journal of The Korea Society of Computer and Information, Vol. 18, No. 7, pp.101-109, Jul. 2013. https://doi.org/10.9708/jksci.2013.18.7.101
  10. B.H. Jun, and C.G. Han, "A study on a community integration algorithm using vertex betweenness centrality", Proceedings of the Korea Information Processing Society Conference, Vol. 19, No. 2, pp.323-325, 2012.
  11. L. Freeman, "Centrality in social networks conceptual clarification". Social Networks, Vol. 1, No. 3, pp.215-239, 1979.
  12. T. Zhou, L. Lu, and Y. Zhang, "Predicting missing links via local information". The European Physical Journal B, Vol. 71, No. 4, pp.623-630, Oct. 2009. https://doi.org/10.1140/epjb/e2009-00335-8