The Community for Technology Leaders
RSS Icon
Subscribe
Issue No.01 - January (2012 vol.24)
pp: 72-85
Lei Tang , Arizona State University, Tempe
Huan Liu , Arizona State University, Tempe
Jianping Zhang , The MITRE Corporation, McLean
ABSTRACT
A multimode network consists of heterogeneous types of actors with various interactions occurring between them. Identifying communities in a multimode network can help understand the structural properties of the network, address the data shortage and unbalanced problems, and assist tasks like targeted marketing and finding influential actors within or between groups. In general, a network and its group structure often evolve unevenly. In a dynamic multimode network, both group membership and interactions can evolve, posing a challenging problem of identifying these evolving communities. In this work, we try to address this problem by employing the temporal information to analyze a multimode network. A temporally regularized framework and its convergence property are carefully studied. We show that the algorithm can be interpreted as an iterative latent semantic analysis process, which allows for extensions to handle networks with actor attributes and within-mode interactions. Experiments on both synthetic data and real-world networks demonstrate the efficacy of our approach and suggest its generality in capturing evolving groups in networks with heterogeneous entities and complex relationships.
INDEX TERMS
Data mining, community detection, community evolution, multimode networks, dynamic networks.
CITATION
Lei Tang, Huan Liu, Jianping Zhang, "Identifying Evolving Groups in Dynamic Multimode Networks", IEEE Transactions on Knowledge & Data Engineering, vol.24, no. 1, pp. 72-85, January 2012, doi:10.1109/TKDE.2011.159
REFERENCES
[1] L. Tang, H. Liu, J. Zhang, and Z. Nazeri, "Community Evolution in Dynamic Multi-Mode Networks," Proc. 14th ACM SIGKDD Int'l Conf. Knowledge Discovery and Data Mining (KDD '08), pp. 677-685, 2008.
[2] M. Newman, "The Structure and Function of Complex Networks," SIAM Rev., vol. 45, pp. 167-256, 2003.
[3] S. Wasserman and K. Faust, Social Network Analysis: Methods and Applications. Cambridge Univ. Press, 1994.
[4] D. Chakrabarti and C. Faloutsos, "Graph Mining: Laws, Generators, and Algorithms," ACM Computing Surveys, vol. 38, no. 1, p. 2, 2006.
[5] M.N. Lauren Ancel Meyers and B. Pourbohloul, "Predicting Epidemics on Directed Contact Networks," J. Theoretical Biology, vol. 240, no. 3, pp. 400-418, June 2006.
[6] J. Baumes, M. Goldberg, M. Magdon-Ismail, and W. Wallace, "Discovering Hidden Groups in Communication Networks," Proc. Second NSF/NIJ Symp. Intelligence and Security Informatics, 2004.
[7] J. Palau, M. Montaner, and B. Lopez, "Collaboration Analysis in Recommender Systems Using Social Networks," Proc. Eighth Int'l Workshop Cooperative Information Agents (CIA '04), 2004.
[8] L. Tang and H. Liu, "Relational Learning via Latent Social Dimensions," Proc. 15th ACM SIGKDD Int'l Conf. Knowledge Discovery and Data Mining (KDD '09), pp. 817-826, 2009.
[9] L. Tang and H. Liu, "Toward Collective Behavior Prediction via Social Dimension Extraction," IEEE Intelligent Systems, vol. 25, no. 4, pp. 19-25, July-Aug. 2010.
[10] J. Wang, H. Zeng, Z. Chen, H. Lu, L. Tao, and W.-Y. Ma, "Recom: Reinforcement Clustering of Multi-Type Interrelated Data Objects," Proc. 26th Ann. Int'l ACM SIGIR Conf. Research and Development in Informaion Retrieval (SIGIR '03), pp. 274-281. 2003,
[11] B. Long, Z.M. Zhang, X. Wú, and P.S. Yu, "Spectral Clustering for Multi-Type Relational Data," Proc. 23rd Int'l Conf. Machine Learning (ICML '06), pp. 585-592, 2006.
[12] B. Long, Z.M. Zhang, and P.S. Yu, "A Probabilistic Framework for Relational Clustering," Proc. 13th ACM SIGKDD Int'l Conf. Knowledge Discovery and Data Mining (KDD '07), pp. 470-479, 2007.
[13] Dynamic Social Network Modeling and Analysis: Workshop Summary and Papers, R. Breiger, K. Carley, and P. Pattison, eds. Nat'l Academies Press, 2003.
[14] G. Kossinets and D.J. Watts, "Empirical Analysis of an Evolving Social Network," Science, vol. 311, no. 5757, pp. 88-90, 2006.
[15] L. Backstrom, D. Huttenlocher, J. Kleinberg, and X. Lan, "Group Formation in Large Social Networks: Membership, Growth, and Evolution," Proc. 12th ACM SIGKDD Int'l Conf. Knowledge Discovery and Data Mining (KDD '06), pp. 44-54, 2006.
[16] J. Leskovec, J. Kleinberg, and C. Faloutsos, "Graphs over Time: Densification Laws, Shrinking Diameters and Possible Explanations," Proc. 11th ACM SIGKDD Int'l Conf. Knowledge Discovery in Data Mining (KDD '05), pp. 177-187. 2005,
[17] B. Long, Z.M. Zhang, and P.S. Yu, "Co-Clustering by Block Value Decomposition," Proc. 11th ACM SIGKDD Int'l Conf. Knowledge Discovery in Data Mining (KDD '05), pp. 635-640, 2005.
[18] C. Ding, T. Li, W. Peng, and H. Park, "Orthogonal Nonnegative Matrix t-Factorizations for Clustering," Proc. 12th ACM SIGKDD Int'l Conf. Knowledge Discovery and Data Mining (KDD '06), pp. 126-135, 2006.
[19] K. Nowicki and T.A.B. Snijders, "Estimation and Prediction for Stochastic Blockstructures," J. Am. Statistical Assoc., vol. 96, no. 455, pp. 1077-1087, 2001.
[20] H. Zha, X. He, C.H.Q. Ding, M. Gu, and H.D. Simon, "Spectral Relaxation for k-Means Clustering," Proc. Neural Information Processing Systems (NIPS), pp. 1057-1064, 2001,
[21] R. Bhatia, Matrix Analysis. Springer, 1997.
[22] F.R. Bach and M.I. Jordan, "Learning Spectral Clustering," Proc. Neural Information Processing Systems (NIPS), 2004.
[23] M.W. Berry, S.T. Dumais, and G.W. O'Brien, "Using Linear Algebra for Intelligent Information Retrieval," SIAM Rev., vol. 37, no. 4, pp. 573-595, 1995.
[24] M.J.D. Powell, "On Search Directions for Minimization Algorithms," Math. Programming, vol. 4, no. 1, pp. 193-201, Dec. 1973.
[25] P. Tseng, "Convergence of a Block Coordinate Descent Method for Nondifferentiable Minimization," J. Optimization Theory and Applications, vol. 109, no. 3, pp. 475-494, 2001.
[26] J.C. Bezdek and R.J. Hathaway, "Convergence of Alternating Optimization," Neural, Parallel and Scientific Computations, vol. 11, no. 4, pp. 351-368, 2003.
[27] A. Edelman, T.A. Arias, and S.T. Smith, "The Geometry of Algorithms with Orthogonality Constraints," SIAM J. Matrix Analysis and Applications, vol. 20, no. 2, pp. 303-353, 1999.
[28] M.T. Chu and N.T. Trendafilov, "The Orthogonally Constrained Regression Revisited," J. Computational and Graphical Statistics, vol. 10, no. 4, pp. 746-771, Dec. 2001.
[29] A. Strehl and J. Ghosh, "Cluster Ensembles—A Knowledge Reuse Framework for Combining Multiple Partitions," J. Machine Learning Research, vol. 3, pp. 583-617, 2003.
[30] B. Klimat and Y. Yang, "The Enron Corpus: A New Dataset for Email Classification Research," Proc. European Conf. Machine Learning, 2004.
[31] C. Kemp, T.L. Griffiths, and J.B. Tenenbaum, "Discoverying Latent Classes in Relational Data," technical report, Massachusetts Inst. of Tech nology, 2004.
[32] E. Airodi, D. Blei, S. Fienberg, and E.P. Xing, "Mixed Membership Stochastic Blockmodels," J. Machine Learning Research, vol. 9, pp. 1981-2014, 2008.
[33] D.M. Blei, A.Y. Ng, and M.I. Jordan, "Latent Dirichlet Allocation," J. Machine Learning Research, vol. 3, pp. 993-1022, 2003.
[34] D. Zhou, E. Manavoglu, J. Li, C.L. Giles, and H. Zha, "Probabilistic Models for Discovering e-Communities," Proc. 15th Int'l Conf. World Wide Web (WWW '06), pp. 173-182. 2006,
[35] X. Wang, N. Mohanty, and A. McCallum, "Group and Topic Discovery from Relations and Their Attributes," Proc. Advances in Neural Information Processing Systems 18, pp. 1449-1456, 2006.
[36] A. McCallum, X. Wang, and A. Corrada-Emmanuel, "Topic and Role Discovery in Social Networks with Experiments on Enron and Academic Email," J. Artificial Intelligence Research, vol. 30, pp. 249-272, 2007.
[37] P.D. Hoff, M.S.H. Adrian, and E. Raftery, "Latent Space Approaches to Social Network Analysis," J. Am. Statistical Assoc., vol. 97, no. 460, pp. 1090-1098, 2002.
[38] M.S. Handcock, A.E. Raftery, and J.M. Tantrum, "Model-Based Clustering for Social Networks," J. Royal Statistical Soc.: Series A, vol. 170, no. 2, pp. 301-354, 2007.
[39] A. Globerson, G. Chechik, F. Pereira, and N. Tishby, "Euclidean Embedding of Co-Occurrence Data," J. Machine Learning Research, vol. 8, pp. 2265-2295, 2007.
[40] I.S. Dhillon, "Co-Clustering Documents and Words Using Bipartite Spectral Graph Partitioning," Proc. Seventh ACM SIGKDD Int'l Conf. Knowledge Discovery and Data Mining (KDD '01) pp. 269-274, 2001.
[41] B. Gao, T.-Y. Liu, X. Zheng, Q.-S. Cheng, and W.-Y. Ma, "Consistent Bipartite Graph Co-Partitioning for Star-Structured High-Order Heterogeneous Data Co-Clustering," Proc. 11th ACM SIGKDD Int'l Conf. Knowledge Discovery in Data Mining (KDD '05), pp. 41-50, 2005.
[42] G. Palla, A.-L. Barabasi, and T. Vicsek, "Quantifying Social Group Evolution," Nature, vol. 446, no. 7136, pp. 664-667, Apr. 2007.
[43] S. Asur, S. Parthasarathy, and D. Ucar, "An Event-Based Framework for Characterizing the Evolutionary Behavior of Interaction Graphs," Proc. 13th ACM SIGKDD Int'l Conf. Knowledge Discovery and Data Mining (KDD '07), pp. 913-921, 2007.
[44] D. Chakrabarti, R. Kumar, and A. Tomkins, "Evolutionary Clustering," Proc. 12th ACM SIGKDD Int'l Conf. Knowledge Discovery and Data Mining (KDD '06), pp. 554-560, 2006.
[45] Y. Chi, X. Song, D. Zhou, K. Hino, and B.L. Tseng, "Evolutionary Spectral Clustering by Incorporating Temporal Smoothness," Proc. 13th ACM SIGKDD Int'l Conf. Knowledge Discovery and Data Mining (KDD '07), pp. 153-162, 2007.
[46] Y.-R. Lin, Y. Chi, S. Zhu, H. Sundaram, and B.L. Tseng, "Facetnet: A Framework for Analyzing Communities and Their Evolutions in Dynamic Networks," Proc. 17th Int'l Conf. World Wide Web (WWW '08), pp. 685-694, 2008.
[47] T. Yang, Y. Chi, S. Zhu, Y. Gao, and R. Jin, "A Bayesian Approach Toward Finding Communities and Their Evolutions in Dynamic Social Networks," Proc. SIAM Int'l Conf. Data Mining, 2009.
[48] P. Sarkar and A.W. Moore, "Dynamic Social Network Analysis Using Latent Space Models," ACM SIGKDD Explorations Newsletter, vol. 7, no. 2, pp. 31-40, 2005.
[49] C. Tantipathananandh, T. Berger-Wolf, and D. Kempe, "A Framework for Community Identification in Dynamic Social Networks," Proc. 13th ACM SIGKDD Int'l Conf. Knowledge Discovery and Data Mining (KDD '07), pp. 717-726, 2007.
[50] C. Tantipathananandh and T. Berger-Wolf, "Constant-Factor Approximation Algorithms for Identifying Dynamic Communities," Proc. 15th ACM SIGKDD Int'l Conf. Knowledge Discovery and Data Mining (KDD '09), pp. 827-836, 2009.
[51] J. Sun, C. Faloutsos, S. Papadimitriou, and P.S. Yu, "Graphscope: Parameter-Free Mining of Large Time-Evolving Graphs," Proc. 13th ACM SIGKDD Int'l Conf. Knowledge Discovery and Data Mining (KDD '07), pp. 687-696, 2007.
[52] T. Xu, Z.M. Zhang, P.S. Yu, and B. Long, "Evolutionary Clustering by Hierarchical Dirichlet Process with Hidden Markov State," Proc. IEEE Eighth Int'l Conf. Data Mining (ICDM '08), pp. 658-667, 2008.
[53] T. Xu, Z.M. Zhang, P.S. Yu, and B. Long, "Dirichlet Process Based Evolutionary Clustering," Proc. IEEE Eighth Int'l Conf. Data Mining (ICDM '08) pp. 648-657, 2008.
[54] A. Java, A. Joshi, and T. Finin, "Approximating the Community Structure of the Long Tail," Proc. Second Int'l Conf. Weblogs and Social Media (ICWSM '08), Mar. 2008.
[55] C. Fowlkes, S. Belongie, F. Chung, and J. Malik, "Spectral Grouping Using the Nyström Method," IEEE Trans. Pattern Analysis and Machine Intelligence, vol. 26, no. 2, pp. 214-225, Feb. 2004.
[56] L. Tang and H. Liu, "Scalable Learning of Collective Behavior Based on Sparse Social Dimensions," Proc. 18th ACM Conf. Information and Knowledge Management (CIKM '09), pp. 1107-1116, 2009.
23 ms
(Ver 2.0)

Marketing Automation Platform Marketing Automation Tool