Wenchao Yu
Charu C. Aggarwal
ABSTRACT
The problem of evolutionary network analysis has gained increasing attention in recent years, because of an increasing number of networks, which are encountered in temporal settings. For example, social networks, communication networks, and information networks continuously evolve over time, and it is desirable to learn interesting trends about how the network structure evolves over time, and in terms of other interesting trends. One challenging aspect of networks is that they are inherently resistant to parametric modeling, which allows us to truly express the edges in the network as functions of time. This is because, unlike multidimensional data, the edges in the network reflect interactions among nodes, and it is difficult to independently model the edge as a function of time, without taking into account its correlations and interactions with neighboring edges. Fortunately, we show that it is indeed possible to achieve this goal with the use of a matrix factorization, in which the entries are parameterized by time. This approach allows us to represent the edge structure of the network purely as a function of time, and predict the evolution of the network over time. This opens the possibility of using the approach for a wide variety of temporal network analysis problems, such as predicting future trends in structures, predicting links, and node-centric anomaly/event detection. This flexibility is because of the general way in which the approach allows us to express the structure of the network as a function of time. We present a number of experimental results on a number of temporal data sets showing the effectiveness of the approach.
- C. Aggarwal and K. Subbian, "Evolutionary network analysis: A survey," ACM Computing Surveys, vol. 47, no. 1, p. 10, 2014. Google Scholar
Digital Library
- S. Ranshous, S. Shen, D. Koutra, S. Harenberg, C. Faloutsos, and N. F. Samatova, "Anomaly detection in dynamic networks: a survey," Wiley Interdisciplinary Reviews: Computational Statistics, vol. 7, no. 3, pp. 223--247, 2015. Google ScholarDigital Library
- D. M. Dunlavy, T. G. Kolda, and E. Acar, "Temporal link prediction using matrix and tensor factorizations," TKDD, vol. 5, no. 2, p. 10, 2011.Google ScholarDigital Library
- P. Sarkar, D. Chakrabarti, and M. Jordan, "Nonparametric link prediction in dynamic networks," pp. 1687--1694, 2012.Google Scholar
- L. Backstrom, D. Huttenlocher, J. Kleinberg, and X. Lan, "Group formation in large social networks: membership, growth, and evolution," in KDD, pp. 44--54, ACM, 2006. Google ScholarDigital Library
- M. Gupta, C. C. Aggarwal, J. Han, and Y. Sun, "Evolutionary clustering and analysis of bibliographic networks," in ASONAM, pp. 63--70, IEEE, 2011.Google Scholar
- Y. Chi, X. Song, D. Zhou, K. Hino, and B. L. Tseng, "Evolutionary spectral clustering by incorporating temporal smoothness," in KDD, pp. 153--162, ACM, 2007.Google Scholar
- L. Akoglu and C. Faloutsos, "Event detection in time series of mobile communication graphs," in Army Science Conference, pp. 77--79, 2010.Google Scholar
- T. Ide and H. Kashima, "Eigenspace-based anomaly detection in computer systems," in KDD, pp. 440--449, ACM, 2004.Google Scholar
- W. Yu, C. C. Aggarwal, S. Ma, and H. Wang, "On anomalous hotspot discovery in graph streams," in ICDM, pp. 1271--1276, IEEE, 2013.Google Scholar
- D. Kuang, H. Park, and C. H. Ding, "Symmetric nonnegative matrix factorization for graph clustering.," in SDM, vol. 12, pp. 106--117, SIAM, 2012.Google Scholar
- L. Tang, H. Liu, J. Zhang, and Z. Nazeri, "Community evolution in dynamic multi-mode networks," in KDD, pp. 677--685, ACM, 2008.Google Scholar
- S. Mankad and G. Michailidis, "Structural and functional discovery in dynamic networks with non-negative matrix factorization," Physical Review E, vol. 88, no. 4, 2013. Google ScholarCross Ref
- J. Sun, C. Faloutsos, S. Papadimitriou, and P. S. Yu, "Graphscope: parameter-free mining of large time-evolving graphs," in KDD, pp. 687--696, ACM, 2007. Google ScholarDigital Library
- T. Opsahl and P. Panzarasa, "Clustering in weighted networks," Social networks, pp. 155--163, 2009. Google ScholarCross Ref
- P. Massa and P. Avesani, "Trust-aware bootstrapping of recommender systems," in ECAI workshop on recommender systems, vol. 28, p. 29, 2006.Google Scholar
- L. Isella, J. Stehlé, A. Barrat, C. Cattuto, J.-F. Pinton, and W. Van den Broeck, "What's in a crowd? analysis of face-to-face behavioral networks," Journal of theoretical biology, vol. 271, no. 1, pp. 166--180, 2011. Google ScholarCross Ref
- J. Leskovec, J. Kleinberg, and C. Faloutsos, "Graph evolution: Densification and shrinking diameters," TKDD, vol. 1, no. 1, p. 2, 2007. Google ScholarDigital Library
- D. Liben-Nowell and J. Kleinberg, "The link-prediction problem for social networks," JASIST, vol. 58, no. 7, pp. 1019--1031, 2007. Google ScholarCross Ref
- T. Murata and S. Moriyasu, "Link prediction of social networks based on weighted proximity measures," in WI, pp. 85--88, IEEE, 2007.Google Scholar
- J. Zhao, L. Miao, J. Yang, H. Fang, Q.-M. Zhang, M. Nie, P. Holme, and T. Zhou, "Prediction of links and weights in networks by reliable routes," Scientific reports, vol. 5, 2015.Google Scholar
- L. A. Adamic and E. Adar, "Friends and neighbors on the web," Social networks, vol. 25, no. 3, pp. 211--230, 2003. Google ScholarCross Ref
- R. N. Lichtenwalter, J. T. Lussier, and N. V. Chawla, "New perspectives and methods in link prediction," in KDD, pp. 243--252, ACM, 2010.Google Scholar
- M. Mitzenmacher, "A brief history of generative models for power law and lognormal distributions," Internet mathematics, vol. 1, no. 2, pp. 226--251, 2004. Google ScholarCross Ref
- P. Sarkar, D. Chakrabarti, and M. I. Jordan, "Nonparametric link prediction in dynamic networks," in ICML, pp. 1687--1694, 2012.Google Scholar
- A. K. Menon and C. Elkan, "Link prediction via matrix factorization," in PKDD, pp. 437--452, Springer, 2011.Google Scholar
- D. M. Dunlavy, T. G. Kolda, and E. Acar, "Temporal link prediction using matrix and tensor factorizations," TKDD, vol. 5, no. 2, p. 10, 2011. Google ScholarDigital Library
- W. Fu, L. Song, and E. P. Xing, "Dynamic mixed membership blockmodel for evolving networks," in ICML, pp. 329--336, ACM, 2009.Google Scholar
- R. A. Rossi, B. Gallagher, J. Neville, and K. Henderson, "Modeling dynamic behavior in large evolving graphs," in WSDM, pp. 667--676, ACM, 2013.Google Scholar
- J. Sun, D. Tao, and C. Faloutsos, "Beyond streams and graphs: dynamic tensor analysis," in KDD, pp. 374--383, ACM, 2006. Google ScholarDigital Library
- Y. Koren, "Collaborative filtering with temporal dynamics," Communications of the ACM, pp. 89--97, 2010. Google ScholarDigital Library
Index Terms
- Temporally Factorized Network Modeling for Evolutionary Network Analysis
Recommendations
Robustness analysis of noise network link prediction
ACAI '20: Proceedings of the 2020 3rd International Conference on Algorithms, Computing and Artificial IntelligenceLink prediction is an important application in complex networks. It predicts existing but undiscovered associations or possible future relationships in the network. However, networks in real life have much noise. The networks we observe are incomplete ...
Invulnerability analysis of scale-free network and small-world network
AI2A '23: Proceedings of the 2023 3rd International Conference on Artificial Intelligence, Automation and AlgorithmsThis paper analyzes the invulnerability of two kinds of networks with different degrees of distribution. According to their topology, four attack strategies and two metrics were selected. The most effective attack strategy and the most appropriate ...
HEM: An Improved Parametric Link Prediction Algorithm Based on Hybrid Network Evolution Mechanism
Advanced Data Mining and ApplicationsAbstractLink prediction plays an important role in the research of complex networks. Its task is to predict missing links or possible new links in the future via existing information in the network. In recent years, many powerful link prediction ...
Comments