Palash Goyal
Emilio Ferrara
ABSTRACT
Predicting links in information networks requires deep understanding and careful modeling of network structure. Network embedding, which aims to learn low-dimensional representations of nodes, has been used successfully for the task of link prediction in the past few decades. Existing methods utilize the observed edges in the network to model the interactions between nodes and learn representations which explain the behavior. In addition to the presence of edges, networks often have information which can be used to improve the embedding. For example, in author collaboration networks, the bag of words representing the abstract of co-authored paper can be used as edge attributes. In this paper, we propose a novel approach, which uses the edges and their associated labels to learn node embeddings. Our model jointly optimizes higher order node neighborhood, social roles and edge attributes reconstruction error using deep architecture which can model highly non-linear interactions. We demonstrate the efficacy of our model over existing state-of-the-art methods on two real world data sets. We observe that such attributes can improve the quality of embedding and yield better performance in link prediction.
- Lada A Adamic and Eytan Adar. 2003. Friends and neighbors on the web. Social networks, Vol. 25, 3 (2003), 211--230.Google Scholar
- Amr Ahmed, Nino Shervashidze, Shravan Narayanamurthy, Vanja Josifovski, and Alexander J Smola. 2013. Distributed large-scale natural graph factorization Proceedings of the 22nd international conference on World Wide Web. ACM, 37--48. Google ScholarDigital Library
- Réka Albert, Hawoong Jeong, and Albert-László Barabási. 2000. Error and attack tolerance of complex networks. nature, Vol. 406, 6794 (2000), 378--382.Google Scholar
- Lars Backstrom and Jure Leskovec. 2011. Supervised random walks: predicting and recommending links in social networks Proceedings of the fourth ACM international conference on Web search and data mining. ACM, 635--644. Google ScholarDigital Library
- Shaosheng Cao, Wei Lu, and Qiongkai Xu. 2015. Grarep: Learning graph representations with global structural information. 891--900. Google ScholarDigital Library
- Shiyu Chang, Wei Han, Jiliang Tang, Guo-Jun Qi, Charu C Aggarwal, and Thomas S Huang. 2015. Heterogeneous network embedding via deep architectures Proceedings of the 21th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining. ACM, 119--128. Google ScholarDigital Library
- Linton C Freeman. 2000. Visualizing social networks. Journal of social structure Vol. 1, 1 (2000), 4.Google Scholar
- Johannes Gehrke, Paul Ginsparg, and Jon Kleinberg. 2003. Overview of the 2003 KDD Cup. ACM SIGKDD Explorations Vol. 5, 2 (2003). Google ScholarDigital Library
- Palash Goyal and Emilio Ferrara. 2018. Graph embedding techniques, applications, and performance: A survey. Knowledge-Based Systems (2018).Google ScholarCross Ref
- Aditya Grover and Jure Leskovec. 2016. node2vec: Scalable feature learning for networks. Proceedings of the 22nd International Conference on Knowledge Discovery and Data Mining. ACM, 855--864. Google ScholarDigital Library
- Keith Henderson, Brian Gallagher, Tina Eliassi-Rad, Hanghang Tong, Sugato Basu, Leman Akoglu, Danai Koutra, Christos Faloutsos, and Lei Li. 2012. Rolx: structural role extraction & mining in large graphs Proceedings of the 18th ACM SIGKDD international conference on Knowledge discovery and data mining. ACM, 1231--1239. Google ScholarDigital Library
- Xiao Huang, Jundong Li, and Xia Hu. 2017. Accelerated attributed network embedding. In Proceedings of the 2017 SIAM International Conference on Data Mining. SIAM, 633--641.Google ScholarCross Ref
- Xiao Huang, Jundong Li, and Xia Hu. 2017. Label informed attributed network embedding. In Proceedings of the Tenth ACM International Conference on Web Search and Data Mining. ACM, 731--739. Google ScholarDigital Library
- Ramon Ferrer i Cancho and Richard V Solé. 2001. The small world of human language. Proceedings of the Royal Society of London B: Biological Sciences, Vol. 268, 1482 (2001), 2261--2265.Google ScholarCross Ref
- Paul Jaccard. 1901. Etude comparative de la distribution florale dans une portion des Alpes et du Jura. Impr. Corbaz.Google Scholar
- Leo Katz. 1953. A new status index derived from sociometric analysis. Psychometrika, Vol. 18, 1 (1953), 39--43.Google ScholarCross Ref
- Diederik Kingma and Jimmy Ba. 2014. Adam: A method for stochastic optimization. arXiv preprint arXiv:1412.6980 (2014).Google Scholar
- Bryan Klimt and Yiming Yang. 2004. The enron corpus: A new dataset for email classification research European Conference on Machine Learning. 217--226. Google ScholarDigital Library
- David Liben-Nowell and Jon Kleinberg. 2007. The link-prediction problem for social networks. journal of the Association for Information Science and Technology, Vol. 58, 7 (2007), 1019--1031. Google ScholarDigital Library
- Kurt Miller, Michael I Jordan, and Thomas L Griffiths. 2009. Nonparametric latent feature models for link prediction Advances in neural information processing systems. 1276--1284. Google ScholarDigital Library
- Mark EJ Newman. 2001. Clustering and preferential attachment in growing networks. Physical review E, Vol. 64, 2 (2001), 025102.Google Scholar
- Mingdong Ou, Peng Cui, Jian Pei, Ziwei Zhang, and Wenwu Zhu. 2016. Asymmetric transitivity preserving graph embedding Proc. of ACM SIGKDD. 1105--1114. Google ScholarDigital Library
- Christopher C Paige and Michael A Saunders. 1981. Towards a generalized singular value decomposition. SIAM J. Numer. Anal. Vol. 18, 3 (1981), 398--405.Google ScholarDigital Library
- Bryan Perozzi, Rami Al-Rfou, and Steven Skiena. 2014. Deepwalk: Online learning of social representations Proceedings 20th international conference on Knowledge discovery and data mining. 701--710. Google ScholarDigital Library
- David E Rumelhart, Geoffrey E Hinton, and Ronald J Williams. 1988. Neurocomputing: Foundations of research. JA Anderson and E. Rosenfeld, Eds (1988), 696--699. Google ScholarDigital Library
- Suvrit Sra and Inderjit S Dhillon. 2006. Generalized nonnegative matrix approximations with Bregman divergences Advances in neural information processing systems. 283--290. Google ScholarDigital Library
- Jian Tang, Meng Qu, Mingzhe Wang, Ming Zhang, Jun Yan, and Qiaozhu Mei. 2015. Line: Large-scale information network embedding. Proceedings 24th International Conference on World Wide Web. 1067--1077. Google ScholarDigital Library
- Athanasios Theocharidis, Stjin Van Dongen, Anton Enright, and Tom Freeman. 2009. Network visualization and analysis of gene expression data using BioLayout Express3D. Nature protocols Vol. 4 (2009), 1535--1550.Google Scholar
- Daixin Wang, Peng Cui, and Wenwu Zhu. 2016. Structural deep network embedding. In Proceedings of the 22nd International Conference on Knowledge Discovery and Data Mining. ACM, 1225--1234. Google ScholarDigital Library
Index Terms
- Embedding Networks with Edge Attributes
Recommendations
Unifying community detection and network embedding in attributed networks
AbstractTraditionally, community detection and network embedding are two separate tasks. Network embedding aims to output a vector representation for each node in the network, and community detection aims to find all densely connected groups of nodes and ...
Bipartite Network Embedding via Effective Integration of Explicit and Implicit Relations
Database Systems for Advanced ApplicationsAbstractNetwork representation learning, or network embedding, aims at mapping the nodes of the network to low-dimensional vector space, in which the learned node representations can be used for a variety of tasks, such as node classification, link ...
Hyperbolic node embedding for temporal networks
AbstractGenerating general-purpose vector representations of networks allows us to analyze them without the need for extensive feature-engineering. Recent works have shown that the hyperbolic space can naturally represent the structure of networks, and ...
Comments