Non-link Preserving Network Embedding using Subspace Learning for Network Reconstruction
Pages 10 - 17
Abstract
Learning meaningful vector representations of nodes of a network has been a subject of intense study in the past few years, with various objectives such as node or link labeling, preserving higher order structures, etc. In this paper, we focus on reconstruction of adjacency matrix, which also leads to preservation of higher order structures, through spectral distance. Methodologically, existing techniques focus on construction of various neighborhoods based on the link-structure, but do not explicitly give importance to nonlinks. Our method, called the subspace learning method (SLM), is based on a simple observation that in addition to representations of neighbors sharing a common subspace, representations of non-neighbors should lie in each others' null-space. We devise an efficient, negative sampling based algorithm for learning the node representations. Experimental results on many real world benchmark networks show surprising improvement in both reconstruction error and spectral distance over state of the art methods. Moreover, we show that the representations given by SLM perform better than state of the art representations on the tasks of community detection and link prediction.
References
[1]
Amr Ahmed, Nino Shervashidze, Shravan Narayanamurthy, Vanja Josifovski, and Alexander J Smola. 2013. Distributed large-scale natural graph factorization. In Proceedings of the 22nd international conference on World Wide Web. ACM, 37--48.
[2]
Albert-László Barabási and Réka Albert. 1999. Emergence of scaling in random networks. science 286, 5439 (1999), 509--512.
[3]
Mikhail Belkin and Partha Niyogi. 2002. Laplacian eigenmaps and spectral techniques for embedding and clustering. In Advances in neural information processing systems. 585--591.
[4]
VD Blondel, JL Guillaume, R Lambiotte, and E Lefebvre. 2011. The Louvain method for community detection in large networks. J of Statistical Mechanics: Theory and Experiment 10 (2011), P10008.
[5]
Marián Boguná, Romualdo Pastor-Satorras, Albert Díaz-Guilera, and Alex Arenas. 2004. Models of social networks based on social distance attachment. Physical review E 70, 5 (2004), 056122.
[6]
Stefan Bornholdt and Heinz Georg Schuster. 2006. Handbook of graphs and networks: from the genome to the internet. John Wiley & Sons.
[7]
Dongbo Bu, Yi Zhao, Lun Cai, Hong Xue, Xiaopeng Zhu, Hongchao Lu, Jingfen Zhang, Shiwei Sun, Lunjiang Ling, Nan Zhang, et al. 2003. Topological structure analysis of the protein--protein interaction network in budding yeast. Nucleic acids research 31, 9 (2003), 2443--2450.
[8]
Steve Butler and Fan Chung. 2006. Spectral graph theory. Handbook of linear algebra (2006), 47.
[9]
Shaosheng Cao, Wei Lu, and Qiongkai Xu. 2015. Grarep: Learning graph representations with global structural information. In Proceedings of the 24th ACM International on Conference on Information and Knowledge Management. ACM, 891--900.
[10]
Peng Cui, Xiao Wang, Jian Pei, and Wenwu Zhu. 2017. A Survey on Network Embedding. arXiv preprint arXiv:1711.08752 (2017).
[11]
Abir De, Sourangshu Bhattacharya, Sourav Sarkar, Niloy Ganguly, and Soumen Chakrabarti. 2016. Discriminative link prediction using local, community, and global signals. IEEE Transactions on Knowledge and Data Engineering 28, 8 (2016), 2057--2070.
[12]
Jacques Ferber. 1999. Multi-agent systems: an introduction to distributed artificial intelligence. Vol. 1. Addison-Wesley Reading.
[13]
Palash Goyal and Emilio Ferrara. 2017. Graph embedding techniques, applications, and performance: A survey. arXiv preprint arXiv:1705.02801 (2017).
[14]
Aditya Grover and Jure Leskovec. 2016. node2vec: Scalable feature learning for networks. In Proceedings of the 22nd ACM SIGKDD international conference on Knowledge discovery and data mining. ACM, 855--864.
[15]
Roger Guimera, Leon Danon, Albert Diaz-Guilera, Francesc Giralt, and Alex Arenas. 2003. Self-similar community structure in a network of human interactions. Physical review E 68, 6 (2003), 065103.
[16]
William L Hamilton, Rex Ying, and Jure Leskovec. 2017. Representation Learning on Graphs: Methods and Applications. arXiv preprint arXiv:1709.05584 (2017).
[17]
Matthew O Jackson. 2010. Social and economic networks. Princeton university press.
[18]
Jure Leskovec, Jon Kleinberg, and Christos Faloutsos. 2007. Graph evolution: Densification and shrinking diameters. ACM Transactions on Knowledge Discovery from Data (TKDD) 1, 1 (2007), 2.
[19]
Jure Leskovec and Andrej Krevl. 2014. SNAP Datasets: Stanford Large Network Dataset Collection. http://snap.stanford.edu/data.
[20]
Mark EJ Newman. 2004. Fast algorithm for detecting community structure in networks. Physical review E 69, 6 (2004), 066133.
[21]
Mark EJ Newman. 2011. Complex systems: A survey. arXiv preprint arXiv:1112.1440 (2011).
[22]
Mark EJ Newman and Michelle Girvan. 2004. Finding and evaluating community structure in networks. Physical review E 69, 2 (2004), 026113.
[23]
Mingdong Ou, Peng Cui, Jian Pei, Ziwei Zhang, and Wenwu Zhu. 2016. Asymmetric Transitivity Preserving Graph Embedding. In KDD. 1105--1114.
[24]
Pradumn Kumar Pandey and Bibhas Adhikari. 2015. Context dependent preferential attachment model for complex networks. Physica A: Statistical Mechanics and its Applications 436 (2015), 499--508.
[25]
Pradumn Kumar Pandey and Bibhas Adhikari. 2017. A parametric model approach for structural reconstruction of scale-free networks. IEEE Transactions on Knowledge and Data Engineering 29, 10 (2017), 2072--2085.
[26]
Pradumn Kumar Pandey and Venkataramana Badarla. 2018. Reconstruction of network topology using status-time-series data. Physica A: Statistical Mechanics and its Applications 490 (2018), 573--583.
[27]
Bryan Perozzi, Rami Al-Rfou, and Steven Skiena. 2014. Deepwalk: Online learning of social representations. In Proceedings of the 20th ACM SIGKDD international conference on Knowledge discovery and data mining. ACM, 701--710.
[28]
John Scott. 2017. Social network analysis. Sage.
[29]
Richard Socher, Alex Perelygin, Jean Wu, Jason Chuang, Christopher D Manning, Andrew Ng, and Christopher Potts. 2013. Recursive deep models for semantic compositionality over a sentiment treebank. In Proceedings of the 2013 conference on empirical methods in natural language processing. 1631--1642.
[30]
Jian Tang, Meng Qu, Mingzhe Wang, Ming Zhang, Jun Yan, and Qiaozhu Mei. 2015. Line: Large-scale information network embedding. In Proceedings of the 24th International Conference on World Wide Web. International World Wide Web Conferences Steering Committee, 1067--1077.
[31]
Cunchao Tu, Hao Wang, Xiangkai Zeng, Zhiyuan Liu, and Maosong Sun. 2016. Community-enhanced network representation learning for network analysis. arXiv preprint arXiv:1611.06645 (2016).
[32]
Daixin Wang, Peng Cui, and Wenwu Zhu. 2016. Structural deep network embedding. In Proceedings of the 22nd ACM SIGKDD international conference on Knowledge discovery and data mining. ACM, 1225--1234.
[33]
Xiao Wang, Peng Cui, Jing Wang, Jian Pei, Wenwu Zhu, and Shiqiang Yang. 2017. Community Preserving Network Embedding. In AAAI. 203--209.
[34]
Duncan J Watts and Steven H Strogatz. 1998. Collective dynamics of 'small-world' networks. nature 393, 6684 (1998), 440.
[35]
Scott White and Padhraic Smyth. 2005. A spectral clustering approach to finding communities in graphs. In Proceedings of the 2005 SIAM international conference on data mining. SIAM, 274--285.
[36]
Cheng Yang, Maosong Sun, Zhiyuan Liu, and Cunchao Tu. 2017. Fast network embedding enhancement via high order proximity approximation. In Proceedings of the Twenty-Sixth International Joint Conference on Artificial Intelligence, IJCAI. 19--25.
[37]
Yanlei Yu, Zhiwu Lu, Jiajun Liu, Guoping Zhao, Ji-Rong Wen, and Kai Zheng. 2017. RUM: network Representation learning throUgh Multi-level structural information preservation. arXiv preprint arXiv:1710.02836 (2017).
Recommendations
Locality preserving embedding for face and handwriting digital recognition
Most supervised manifold learning-based methods preserve the original neighbor relationships to pursue the discriminating power. Thus, structure information of the data distributions might be neglected and destroyed in low-dimensional space in a certain ...
Locality Preserving Embedding
ICISE '09: Proceedings of the 2009 First IEEE International Conference on Information Science and EngineeringMost manifold learning based methods preserve the original neighbor relationships to pursue the discriminating power. Thus, structure information of data distribution might be neglected and destroyed in low-dimensional space in a sense. In this paper, a ...
Betweenness centrality-based community adaptive network representation for link prediction
AbstractLink prediction is a fundamental problem in biological network analysis, personalized recommendation, network evolution modeling, etc. It aims at discovering links in the network that are unknown, missing, or will be formed in the future. Network ...
Comments
Information & Contributors
Information
Published In
January 2019
380 pages
ISBN:9781450362078
DOI:10.1145/3297001
- General Chairs:
- Lipika Dey,
- Surajit Chaudhury,
- Program Chairs:
- Raghu Krishnapuram,
- Parag Singla,
- Publications Chair:
- Rishiraj Saha Roy
Copyright © 2019 ACM.
Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than the author(s) must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected].
Publisher
Association for Computing Machinery
New York, NY, United States
Publication History
Published: 03 January 2019
Check for updates
Author Tags
Qualifiers
- Research-article
- Research
- Refereed limited
Conference
CoDS-COMAD '19
Acceptance Rates
CODS-COMAD '19 Paper Acceptance Rate 62 of 198 submissions, 31%;
Overall Acceptance Rate 197 of 680 submissions, 29%
Contributors
Other Metrics
Bibliometrics & Citations
Bibliometrics
Article Metrics
- 0Total Citations
- 227Total Downloads
- Downloads (Last 12 months)7
- Downloads (Last 6 weeks)1
Reflects downloads up to 27 Jul 2024
Other Metrics
Citations
View Options
Get Access
Login options
Check if you have access through your login credentials or your institution to get full access on this article.
Sign in