Community discovery via MetaGraph Factorization

ACM Transactions on Knowledge Discovery from Data

Volumn 5, Issue 3, 2011, Pages

  Lin, Yu Ru ^a   Sun, Jimeng ^b   Sundaram, Hari ^a   Kelliher, Aisling ^a   Castro, Paul ^b   Konuru, Ravi ^b  

^a ARIZONA STATE UNIVERSITY   (United States)

^b IBM T J WATSON RESEARCH CENTER   (United States)

Author keywords

Community discovery; Dynamic social network analysis; MetaFac; MetaGraph Factorization; Nonnegative tensor factorization; Relational hypergraph

Indexed keywords

COMMUNITY DISCOVERY; HYPERGRAPH; META-GRAPH; METAFAC; NONNEGATIVE TENSOR FACTORIZATIONS;

DATA MINING; ELECTRIC NETWORK ANALYSIS; FORECASTING; INDUSTRY; SOCIAL NETWORKING (ONLINE); SOCIAL SCIENCES; TENSORS; TIME VARYING SYSTEMS; USER INTERFACES;

FACTORIZATION;

EID: 80052016150     PISSN: 15564681     EISSN: 1556472X     Source Type: Journal    
DOI: 10.1145/1993077.1993081     Document Type: Article

References (77)

1. ADAMIC, L. AND ADAR, E. 2003. Friends and neighbors on the web. Social Networks 25, 3, 211-230. (Pubitemid 36831776)
2. AGGARWAL, C. AND YU, P. 2005. Online analysis of community evolution in data streams. In Proceedings of SIAM Conference on Data Mining (SDM).
3. AHMED, A. AND XING, E. 2008. Dynamic non-parametric mixture models and the recurrent chinese restaurant process: With applications to evolutionary clustering. In Proceedings of the IEEE International Conference on Data Mining (ICDM).
4. AIROLDI, E., BLEI, D., FIENBERG, S., AND XING, E. 2008. Mixed membership stochastic blockmodels. J. Mach. Learn. Res. 9, 1981-2014.
5. ASUR, S., PARTHASARATHY, S., AND UCAR, D. 2007. An event-based framework for characterizing the evolutionary behavior of interaction graphs. In Proceedings of the ACM SIGKDD International Conference on Knowledge Discovery and Data Mining (SIGKDD).
6. BADER, B. AND KOLDA, T. 2006. Algorithm 862: Matlab tensor classes for fast algorithm prototyping. ACM Trans. Math. Softw. 32, 4, 635-653. (Pubitemid 44927149)
7. BADER, B., HARSHMAN, R., AND KOLDA, T. 2006. Temporal analysis of social networks using three-way dedicom. Tech. rep. SAND2006-2161, Sandia National Labs, Albuquerque, NM and Livermore, CA.
8. Backstrom, L., Huttenlocher, D., Kleinberg, J., and Lan, X. 2006. Group formation in large social networks: Membership, growth, and evolution. In Proceedings of the ACM SIGKDD International Conference on Knowledge Discovery and Data Mining (SIGKDD). 44-54. (Pubitemid 44535502)
9. BANERJEE, A., BASU, S., AND MERUGU, S. 2007. Multi-way clustering on relation graphs. In Proceedings of SIAM Conference on Data Mining (SDM).
10. BARBER, M., FARIA, M., STREIT, L., AND STROGAN, O. 2008. Searching for communities in bipartite networks. American Institute of Physics, arXiv:803.2854, 171-182.
11. BASU, A. AND BLANNING, R. 2007. Metagraphs and Their Applications. Springer-Verlag, Berlin.
12. BEKKERMAN, R., EL-YANIV, R., AND MCCALLUM, A. 2005. Multi-way distributional clustering via pairwise interactions. In Proceedings of the International Conference on Machine Learning (ICML). 41-48. (Pubitemid 43183314)
13. BERGE, C. 1976. Graphs and Hypergraphs. North-Holland.
14. BERGER-WOLF, T. AND SAIA, J. 2006. A framework for analysis of dynamic social networks. In Proceedings of the ACM SIGKDD International Conference on Knowledge Discovery and Data Mining.
15. BORG, I. AND GROENEN, P. 2005. Modern Multidimensional Scaling: Theory and Applications. Springer.
16. BORGATTI, S. AND CROSS, R. 2003. A relational view of information seeking and learning in social networks. Manag. Sci. 49, 4, 432-445.
17. CARROLL, J. AND CHANG, J. 1970. Analysis of individual differences in multidimensional scaling via an n-way generalization of "Eckart-Young" decomposition. Psychometrika 35, 3, 283-319.
18. CATRAL, M., HAN, L., NEUMANN, M., AND PLEMMONS, R. 2004. On reduced rank nonnegative matrix factorization for symmetric nonnegative matrices. Linear Alg. Appl. 393, 107-126.
19. CHAKRABARTI, D., KUMAR, R., AND TOMKINS, A. 2006. Evolutionary clustering. In Proceedings of the ACM SIGKDD International Conference on Knowledge Discovery and Data Mining. 554-560. (Pubitemid 44535554)
20. CHEN, P. 1976. The entity-relationship model-Toward a unified view of data. ACM Trans. Datab. Syst. 1, 1.
21. CHI, Y., SONG, X., ZHOU, D., HINO, K., AND TSENG, B. 2007. Evolutionary spectral clustering by incorporating temporal smoothness. In Proceedings of the ACM SIGKDD International Conference on Knowledge Discovery and Data Mining.
22. CHI, Y., ZHU, S., GONG, Y., AND ZHANG, Y. 2008. Probabilistic polyadic factorization and its application to personalized recommendation. In Proceedings of International Conference on Knowledge Management.
23. CHUNG, F. 1997. Spectral Graph Theory. American Mathematical Society.
24. DEMPSTER, A., LAIRD, N., AND RUBIN, D. 1977. Maximum likelihood from incomplete data via the em algorithm. J. Royal Statist. Society. Series B (Methodological) 39, 1, 1-38.
25. DING, C., HE, X., AND SIMON, H. 2005. On the equivalence of nonnegative matrix factorization and spectral clustering. In Proceedings of the SIAM Conference on Data Mining (SDM).
26. FALKOWSKI, T., BARTELHEIMER, J., AND SPILIOPOULOU, M. 2006. Mining and visualizing the evolution of subgroups in social networks. In Proceedings of the IEEE/WIC/ACM International Conference on Web Intelligence (WI). 52-58.
27. FORTUNATO, S. 2010. Community detection in graphs. Phys. Rep. 486, 3-5, 75-174.
28. FRIEDMAN, N., GETOOR, L., KOLLER, D., AND PFEFFER, A. 1999. Learning probabilistic relational models. In Proceedings of the International Joint Conference on Artificial Intelligence (IJCAI). 1300-1309.
29. GIRVAN, M. AND NEWMAN, M. 2002. Community structure in social and biological networks. Proc. Nat. Acad. Sci. 99, 12, 7821.
30. GRANOVETTER, M. 1985. Economic action and social structure: A theory of embeddedness. Amer J. Sociol. 91, 3, 481-510.
31. GRUJIC, J., MITROVIC, M., AND TADIC, B. 2009. Mixing patterns and communities on bipartite graphs on web-based social interactions. In Proceedings of the International Conference on Digital Signal Processing. 1-8.
32. HARADA, K., ISHIOKA, T., SUZUKI, I., AND FURUKAWA, M. 2007. A method for solving a bipartite-graph clustering problem with sequence optimization. In Proceedings of the IEEE International Conference on Computer and Information Technology. 915-920.
33. HARSHMAN, R. 1970. Foundations of the parafac procedure: Models and conditions for an "Explanatory" Multi-modal factor analysis. UCLA Work. Papers Phonetics 16, 1, 1.
34. HITCHCOCK, F. 1927. The expression of a tensor or a polyadic as a sum of products. J. Math. Phys 6, 1, 164-189.
35. HOFMAN, J. AND WIGGINS, C. 2008. Bayesian approach to network modularity. Phys. Rev. Lett. 100, 25, 258701.
36. HOFMANN, T. 1999. Probabilistic latent semantic indexing. In Proceeding of the ACM SIGIR Conference.
37. HOLLAND, P. AND LEINHARDT, S. 1981. An exponential family of probability distributions for directed graphs. J. Amer. Statistical Assoc. 76, 373, 33-50.
38. JÄRVELIN, K. AND KEKÄLÄINEN, J. 2000. Ir evaluation methods for retrieving highly relevant documents. In Proceedings of the ACM SIGIR Conference.
39. KEMP, C., GRIFFITHS, T., AND TENENBAUM, J. 2004. Discovering latent classes in relational data. M. I. T. AI memo 2004-19.
40. KEMP, C., TENENBAUM, J., GRIFFITHS, T., YAMADA, T., AND UEDA, N. 2006. Learning systems of concepts with an infinite relational model. Proc. Natl. Conf. AI. AAAI, 381.
41. KUMAR, R., NOVAK, J., AND TOMKINS, A. 2006. Structure and evolution of online social networks. In Proceedings of the ACM SIGKDD International Conference on Knowledge Discovery and Data Mining.
42. LAHIRI, M. AND BERGER-WOLF, T. 2008. Mining periodic behavior in dynamic social networks. In Proceedings of the International Conference on Data Mining (ICDM). 373-382.
43. LEE, D. AND SEUNG, H. 2001. Algorithms for non-negative matrix factorization. In Proceedings of the Conference on Neural Information Processing Systems (NIPS). 556-562.
44. LESKOVEC, J., BACKSTROM, L., KUMAR, R., AND TOMKINS, A. 2008. Microscopic evolution of social networks. In Proceedings of the ACM SIGKDD International Conference on Knowledge Discovery and Data Mining.
45. LIN, Y.-R., CHI, Y., ZHU, S., SUNDARAM, H., AND TSENG, B. L. 2008. Facenet: A framework for analyzing communities and their evolutions in dynamics networks. In Proceedings of the International World Wide Web Conference.
46. LIN, Y.-R., CHI, Y., ZHU, S., SUNDARAM, H., AND TSENG, B. L. 2009a. Analyzing communities and their evolutions in dynamics networks. Trans. Knowl. Discov. Data 3, 2.
47. LIN, Y.-R., SUN, J., CASTRO, P., KONURU, R., SUNDARAM, H., AND KELLIHER, A. 2009b. Metafac: Community discovery via relational hypergraph factorization. In Proceedings of the ACM SIGKDD International Conference on Knowledge Discovery and Data Mining.
48. LONG, B., ZHANG, Z., AND YU, P. 2007. A probabilistic framework for relational clustering. In Proceedings of the ACM SIGKDD International Conference on Knowledge Discovery and Data Mining. 470-479. (Pubitemid 350229232)
49. LOVASZ, L. AND PLUMMER, M. 1986. Matching Theory. North Holland.
50. MILLEN, D., FEINBERG, J., AND KERR, B. 2006. Dogear: Social bookmarking in the enterprise. In Proceedings of the SIGCHI Conference on Human Factors in Computing Systems. 111-120. (Pubitemid 44032094)
51. MONGE, P. AND CONTRACTOR, N. 2001. Emergence of communication networks. The New Handbook of Organizational Communication: Advances in Theory, Research, and Methods. F. M. Jablin and L. Putnam Eds. 440-502.
52. NEWMAN, M. AND GIRVAN, M. 2004. Finding and evaluating community structure in networks. Phys. Rev. E 69, 2, 26113.
53. NEWMAN, M. AND LEICHT, E. 2007. Mixture models and exploratory analysis in networks. Proc. Nat. Acad. Sci. 104, 23, 9564.
54. PALLA, G., BARABASI, A., AND VICSEK, T. 2007. Quantifying social group evolution. Nature 446, 7136, 664-667. (Pubitemid 46606882)
55. POPESCUL, A., UNGAR, L. H., PENNOCK, D. M., AND LAWRENCE, S. 2001. Probabilistic models for unified collaborative and content-based recommendation in sparse-data environments. In Proceedings of the Conference on Uncertainty in Artificial Intelligence (UAI). 437-444.
56. POWELL, W., KOPUT, K., AND SMITH-DOERR, L. 1996. Interorganizational collaboration and the locus of innovation: Networks of learning in biotechnology. Admin. Science Quart. 41, 1.
57. RUGG, R. 1984. Mathematical, algorithmic and data structure issues: Building a hypergraph-based data structure the examples of census geography and the road system. Cartographica: Inter. J. Geographic Inform. Geovisualization 21, 2, 179-187.
58. SARKAR, P. AND MOORE, A. 2005. Dynamic social network analysis using latent space models. SIGKDD Explorations Newsl. 7, 2, 31-40.
59. SCANDURA, T. A. AND WILLIAMS, E. A. 2000. Research methodology in management: Current practices, trends, and implications for future research. Academy Manag. J. 43, 6, 1248-1264. (Pubitemid 33216846)
60. SCHEIN, A., POPESCUL, A., UNGAR, L., AND PENNOCK, D. 2001. Generative models for cold-start recommendations. In Proceedings of the SIGIR Workshop on Recommender Systems.
61. SEIDMAN, S. 1981. Structures induced by collections of subsets: A hypergraph approach. Mathem. Social Sci. 1, 4, 381-396.
62. SHI, J. AND MALIK, J. 2000. Normalized cuts and image segmentation. IEEE Trans. Patt. Anal. Mach. Intell. 22, 8, 888-905.
63. SIMSEK, Z. AND VEIGA, J. F. 2000. The electronic survey technique: An integration and assessment. Organiz. Res. Meth. 3, 1, 93.
64. SINGH, A. AND GORDON, G. 2008. Relational learning via collective matrix factorization. In Proceedings of the ACM SIGKDD International Conference on Knowledge Discovery and Data Mining.
65. SPILIOPOULOU, M., NTOUTSI, I., THEODORIDIS, Y., AND SCHULT, R. 2006. Monic: Modeling and monitoring cluster transitions. In Proceedings of the ACM SIGKDD International Conference on Knowledge Discovery and Data Mining. 706-711. (Pubitemid 44535578)
66. STANTON, J. M. AND ROGELBERG, S. G. 2001. Using internet/intranet web pages to collect organizational research data. Organiz. Res. Meth. 4, 3, 200.
67. SUN, J., FALOUTSOS, C., PAPADIMITRIOU, S., AND YU, P. 2007. Graphscope: Parameter-free mining of large time-evolving graphs. In Proceedings of the ACM SIGKDD International Conference on Knowledge Discovery and Data Mining. 687-696. (Pubitemid 350229254)
68. TANG, L., LIU, H., ZHANG, J., AND NAZERI, Z. 2008. Community evolution in dynamic multi-mode networks. In Proceedings of the ACM SIGKDD International Conference on Knowledge Discovery and Data Mining.
69. TANTIPATHANANANDH, C., BERGER-WOLF, T., AND KEMPE, D. 2007. A framework for community identification in dynamic social networks. In Proceedings of the ACM SIGKDD International Conference on Knowledge Discovery and Data Mining. 717-726. (Pubitemid 350229257)
70. TASKAR, B., ABBEEL, P., AND KOLLER, D. 2002. Discriminative probabilistic models for relational data. In Proceedings of the Conference on Uncertainty in Artificial Intelligence (UAI). 895-902.
71. VAVASIS, S. 2007. On the complexity of nonnegative matrix factorization. arXiv-0708.4149v2[CS. NA].
72. WANG, X., SUN, J., CHEN, Z., AND ZHAI, C. 2006. Latent semantic analysis for multiple-type interrelated data objects. In Proceedings of International ACM SIGIR Conference on Research and Development on Information Retrieval. 236-243.
73. WASSERMAN, S. AND FAUST, K. 1994. Social Network Analysis: Methods and Applications. Cambridge University Press.
74. YANG, T., CHI, Y., ZHU, S., GONG, Y., AND JIN, R. 2009. A Bayesian approach toward finding communities and their evolutions in dynamic social networks. In Proceedings of SIAM International Conference on Data Mining (SDM).
75. YOU, C., HOLDER, L., AND COOK, D. 2009. Learning patterns in the dynamics of biological networks. In Proceedings of the ACM SIGKDD International Conference on Knowledge Discovery and Data Mining. 977-986.
76. YU, K., YU, S., AND TRESP, V. 2005. Soft clustering on graphs. In Proceedings of the Conference on Neural Information Processing Systems (NIPS).
77. ZHU, S., YU, K., CHI, Y., AND GONG, Y. 2007. Combining content and link for classification using matrix factorization. In Proceedings of the International ACM SIGIR Conference on Research and Development on Information Retrieval. 487-494. (Pubitemid 350164997)