Discovering Organizational Structure in Dynamic Social Network

Applying the concept of organizational structure to social network analysis may well represent the power of members and the scope of their power in a social network. In this paper, we propose a data structure, called Community Tree, to represent the organizational structure in the social network. We combine the PageRank algorithm and random walks on graph to derive the community tree from the social network. In the real world, a social network is constantly changing. Hence, the organizational structure in the social network is also constantly changing. In order to present the organizational structure in a dynamic social network, we propose a tree learning algorithm to derive an evolving community tree. The evolving community tree enables a smooth transition between the two community trees and well represents the evolution of organizational structure in the dynamic social network. Experiments conducted on real data show our methods are effective at discovering the organizational structure and representing the evolution of organizational structure in a dynamic social network.

[1]  Jiawei Han,et al.  Mining scale-free networks using geodesic clustering , 2004, KDD.

[2]  Hongyuan Zha,et al.  Probabilistic models for discovering e-communities , 2006, WWW '06.

[3]  Jitendra Malik,et al.  Normalized cuts and image segmentation , 1997, Proceedings of IEEE Computer Society Conference on Computer Vision and Pattern Recognition.

[4]  W. Zachary,et al.  An Information Flow Model for Conflict and Fission in Small Groups , 1977, Journal of Anthropological Research.

[5]  Tanya Y. Berger-Wolf,et al.  A framework for community identification in dynamic social networks , 2007, KDD '07.

[6]  Ji-Rong Wen,et al.  Scalable community discovery on textual data with relations , 2008, CIKM '08.

[7]  M E J Newman,et al.  Finding and evaluating community structure in networks. , 2003, Physical review. E, Statistical, nonlinear, and soft matter physics.

[8]  Philip Bille,et al.  A survey on tree edit distance and related problems , 2005, Theor. Comput. Sci..

[9]  Nick Craswell,et al.  Random walks on the click graph , 2007, SIGIR.

[10]  M E J Newman,et al.  Fast algorithm for detecting community structure in networks. , 2003, Physical review. E, Statistical, nonlinear, and soft matter physics.

[11]  M. Newman,et al.  Hierarchical structure and the prediction of missing links in networks , 2008, Nature.

[12]  Andrew B. Kahng,et al.  New spectral methods for ratio cut partitioning and clustering , 1991, IEEE Trans. Comput. Aided Des. Integr. Circuits Syst..

[13]  Andrew V. Goldberg,et al.  Experimental study of minimum cut algorithms , 1997, SODA '97.

[14]  John Scott.  Social Network Analysis , 1988 .

[15]  Hongyuan Zha,et al.  Discovering Temporal Communities from Social Network Documents , 2007, Seventh IEEE International Conference on Data Mining (ICDM 2007).

[16]  Huan Liu,et al.  Community evolution in dynamic multi-mode networks , 2008, KDD.

[17]  Chris H. Q. Ding,et al.  A min-max cut algorithm for graph partitioning and data clustering , 2001, Proceedings 2001 IEEE International Conference on Data Mining.