Kai Lei
ABSTRACT
The prediction of mobility, topology and traffic is an effective technique to improve the performance of various network systems, which can be generally represented as the temporal link prediction problem. In this paper, we propose a novel adaptive multiple non-negative matrix factorization (AM-NMF) method from the view of network embedding to cope with such problem. Under the framework of non-negative matrix factorization (NMF), the proposed method embeds the dynamic network into a low-dimensional hidden space, where the characteristics of different network snapshots are comprehensively preserved. Especially, our new method can effectively incorporate the hidden information of different time slices, because we introduce a novel adaptive parameter to automatically adjust the relative contribution of different terms in the uniform model. Accordingly, the prediction result of future network topology can be generated by conducting the inverse process of NMF form the shared hidden space. Moreover, we also derive the corresponding solving strategy whose convergence can be ensured. As an illustration, the new model will be applied to various network datasets such as human mobility networks, vehicle mobility networks, wireless mesh networks and data center networks. Experimental results show that our method outperforms some other state-of-the-art methods for the temporal link prediction of both unweighted and weighted networks.
- A. R. Benson, D. F. Gleich, and J Leskovec. 2016. Higher-order organization of complex networks. Science 353, 6295 (2016), 163--166.Google Scholar
- Peng Cui, Xiao Wang, Jian Pei, and Wenwu Zhu. 2017. A Survey on Network Embedding. (2017).Google Scholar
- D. Jin, B Gabrys, and J. Dang. 2015. Combined node and link partitions method for finding overlapping communities in complex networks. Sci Rep 5 (2015).Google Scholar
- Leo Katz. 1953. A new status index derived from sociometric analysis. Psychometrika 18, 1 (1953), 39--43.Google ScholarCross Ref
- D Lee. 1999. Learning the parts of objects with nonnegative matrix factorization. Nature 401, 6755 (1999), 788.Google Scholar
- K. Lee, S. Hong, S. J. Kim, and I. Rhee. 2009. SLAW: A New Mobility Model for Human Walks. In INFOCOM. 855--863.Google Scholar
- Xiaoke Ma, Penggang Sun, and Guimin Qin. 2017. Nonnegative matrix factorization algorithms for link prediction in temporal networks using graph communicability. Pattern Recognition 71 (2017), 361--374.Google ScholarCross Ref
- Xiaoke Ma, Penggang Sun, and Yu Wang. 2018. Graph regularized nonnegative matrix factorization for temporal link prediction in dynamic networks. Physica A Statistical Mechanics Its Applications 496 (2018).Google Scholar
- A. Mozo, B. Ordozgoiti, and S. GÃşmezcanaval. 2018. Forecasting short-term data center network traffic load with convolutional neural networks. Plos One 13, 2 (2018), e0191939.Google ScholarCross Ref
- Kanthi Nagaraj, Dinesh Bharadia, Hongzi Mao, Sandeep Chinchali, Mohammad Alizadeh, and Sachin Katti. 2016. NUMFabric: Fast and Flexible Bandwidth Allocation in Datacenters. In Conference on ACM SIGCOMM 2016 Conference. 188--201. Google ScholarDigital Library
- Nilesh B. Prajapati and D. R. Kathiriya. 2018. Mobility Prediction for Dynamic Location Area in Cellular Network Using Hidden Markov Model. (2018).Google Scholar
- Krishna Ramachandran, Irfan Sheriff, Elizabeth Belding, and Kevin Almeroth. 2007. Routing Stability in Static Wireless Mesh Networks. In Passive and Active Network Measurement, Internatinoal Conference, PAM 2007, Louvain-La-Neuve, Belgium, April 5-6, 2007, Proceedings. 73--82. Google ScholarDigital Library
- Fanhua Shang, L. C. Jiao, and Fei Wang. 2012. Graph dual regularization non-negative matrix factorization for co-clustering. Pattern Recognition 45, 6 (2012), 2237--2250. Google ScholarDigital Library
- Umang Sharan and Jennifer Neville. 2008. Temporal-Relational Classifiers for Prediction in Evolving Domains. In Eighth IEEE International Conference on Data Mining. 540--549. Google ScholarDigital Library
- Saurabh Verma, Arvind Narayanan, and Zhi Li Zhang. 2017. Multi-low-rank Approximation for Traffic Matrices. In Teletraffic Congress. 72--80.Google Scholar
- Xiao Wang, Peng Cui, Jing Wang, Jian Pei, Wenwu Zhu, and Shiqiang Yang. 2017. Community Preserving Network Embedding. In The AAAI Conference on Artificial Intelligence.Google Scholar
- Cheng Yang, Deli Zhao, Deli Zhao, Edward Y. Chang, and Edward Y. Chang. 2015. Network representation learning with rich text information. In International Conference on Artificial Intelligence. 2111--2117. Google ScholarDigital Library
- Jing Yuan, Yu Zheng, Xing Xie, and Guangzhong Sun. 2011. Driving with knowledge from the physical world. In ACM SIGKDD International Conference on Knowledge Discovery and Data Mining. 316--324. Google ScholarDigital Library
Index Terms
- Adaptive Multiple Non-negative Matrix Factorization for Temporal Link Prediction in Dynamic Networks
Recommendations
Deep Autoencoder-like non-negative matrix factorization with graph regularized for link prediction in dynamic networks▪
AbstractLink prediction in dynamic(temporal) networks refers to predicting future edges by analyzing the available network information. Among the existing temporal link prediction approaches, non-negative matrix factorization(NMF) is a kind of ...
Highlights- Deep Autoencoder-like NMF with graph regularized prediction methods are proposed.
- Using graph regularization to capture the local information of temporal networks.
- Using PageRank to extract the global information of temporal ...
Community detection in dynamic networks using constraint non-negative matrix factorization
Community structure, a foundational concept in understanding networks, is one of the most important properties of dynamic networks. A large number of dynamic community detection methods proposed are based on the temporal smoothness framework that ...
New SVD based initialization strategy for non-negative matrix factorization
We give a new method to determine the rank of the factorization for NMF algorithms.We propose a novel method SVD-NMF to enhance initialization for NMF.The compute process is cheap.Numerical results show that SVD-NMF convergent faster than NNDSVD and ...
Comments