Inferring agent dynamics from social communication network

ABSTRACT

We present a machine learning approach to discovering the agent dynamics or micro-laws that drives the evolution of the social groups in a community. We set up the problem by introducing a parameterized probabilistic model for the agent dynamics: the acts of an agent are determined by micro-laws with unknown parameters. Our approach is to identify the appropriate micro-laws which corresponds to identifying the appropriate parameters in the model. To solve the problem we develop heuristic expectation-maximization style algorithms for determining the micro-laws of a community based on either the observed social group evolution, or observed set of communications between actors. We present the results of extensive experiments on simulated data as well as some results on real communities, e.g., newsgroups.

REFERENCES

• 1: Lars Backstrom , Dan Huttenlocher , Jon Kleinberg , Xiangyang Lan, Group formation in large social networks: membership, growth, and evolution, Proceedings of the 12th ACM SIGKDD international conference on Knowledge discovery and data mining, August 20-23, 2006, Philadelphia, PA, USA [doi>10.1145/1150402.1150412]
• 2: J. A. Baum and J. Singh, editors. Evolutionary Dynamics of Organizations. Oxford Press, New York, 1994.
• 3: J. Baumes, M. Goldberg, and M. Magdon-Ismail. Efficient identification of overlapping communities. In IEEE International Conference on Intelligence and Security Informatics (ISI) , pages 27--36, 2005.
• 4: Christopher M. Bishop, Neural Networks for Pattern Recognition, Oxford University Press, Inc., New York, NY, 1995
• 5: H. Bonner. Group Dynamics. Ronald Press Company, New York, 1959.
• 6: B. Butler. The dynamics of cyberspace: Examining and modeling online social structure. Technical report, Carnegie Melon University, Pittsburgh, PA, 1999.
• 7: Kathleen M. Carley , Michael J. Prietula, Computational organization theory, Lawrence Erlbaum Associates, Inc., Mahwah, NJ, 1994
• 8: Kari Chopra , William A. Wallace, Modeling Relationships among Multiple Graphical Structures, Computational & Mathematical Organization Theory, v.6 n.4, p.361-379, December 2000 [doi>10.1023/A:1009658313423]
• 9: Thomas H. Cormen , Clifford Stein , Ronald L. Rivest , Charles E. Leiserson, Introduction to Algorithms, McGraw-Hill Higher Education, 2001
• 10: P. Holland and S. Leinhardt. Dynamic model for social networks. Journal of Mathematical Sociology, 5(1):5--20, 1977.
• 11: R. Leenders. Models for network dynamics: A Markovian framework. Journal of Mathematical Sociology, 20:1--21, 1995.
• 12: J. B. MacQueen. Some methods for classification and analysis of multivariate observations. In Proceedings of 5-th Berkeley Symposium on Mathematical Statistics and Probability, pages 281--297. University of California Press, 1967.
• 13: T. F. Mayer. Paries and networks: Stochastic models for relationship networks. Journal of Mathematical Sociology, 10:51--103, 1984.
• 14: P. Monge and N. Contractor. Theories of Communication Networks. Oxford University Press, 2002.
• 15: M. E. J. Newman. The structure and function of complex networks. SIAM Reviews, 45(2):167--256, June 2003.
• 16: R. D. Putnam. Bowling alone : the collapse and revival of American community. Simon and Schuster, 2000.
• 17: A. Sanil, D. Banks, and K. Carley. Models for evolving fixed node networks: Model fitting and model testing. Journal oF Mathematical Sociology, 21(1--2):173--196, 1996.
• 18: T. Snijders. The statistical evaluation of social network dynamics. In M. Sobel and M. Becker, editors, Sociological Methodology Dynamics, pages 361--395. Basil Blackwell, Boston & London, 2001.
• 19: S. Wasserman and K. Faust. Social Network Analysis. Cambridge University Press, 1994.

INDEX TERMS

Keywords:
EM algorithm, agent-based modeling, machine learning, social network