Abstract
Network embedding aims to obtain a low-dimensional representation of vertices in a network, meanwhile preserving structural and inherent properties of the network. Recently, there has been growing interest in this topic while most of the existing network embedding models mainly focus on normal networks in which there are only pairwise relationships between the vertices. However, in many realistic situations, the relationships between the objects are not pairwise and can be better modeled by a hyper-network in which each edge can join an uncertain number of vertices. In this paper, we propose a deep model called Hyper2vec to learn the embeddings of hyper-networks. Our model applies a biased \(2^{nd}\) order random walk strategy to hyper-networks in the framework of Skip-gram, which can be flexibly applied to various types of hyper-networks.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Similar content being viewed by others
References
Berge, C.: Hypergraphs: Combinatorics of Finite Sets, vol. 45. Elsevier, Amsterdam (1984)
Feng, R., Yang, Y., Hu, W., Wu, F., Zhuang, Y.: Representation learning for scale-free networks. arXiv preprint arXiv:1711.10755 (2017)
Grover, A., Leskovec, J.: node2vec: scalable feature learning for networks. In: KDD, pp. 855–864. ACM (2016). https://doi.org/10.1145/2939672.2939754
Kurant, M., Markopoulou, A., Thiran, P.: On the bias of BFS. arXiv preprint arXiv:1004.1729 (2010)
Mikolov, T., Chen, K., Corrado, G., Dean, J.: Efficient estimation of word representations in vector space. arXiv preprint arXiv:1301.3781 (2013)
Najork, M., Wiener, J.L.: Breadth-first crawling yields high-quality pages. In: WWW, pp. 114–118. ACM (2001). https://doi.org/10.1145/371920.371965
Perozzi, B., Al-Rfou, R., Skiena, S.: DeepWalk: online learning of social representations. In: KDD, pp. 701–710. ACM (2014). https://doi.org/10.1145/2623330.2623732
Sun, L., Ji, S., Ye, J.: Hypergraph spectral learning for multi-label classification. In: KDD, pp. 668–676. ACM (2008). https://doi.org/10.1145/1401890.1401971
Tang, J., Qu, M., Wang, M., Zhang, M., Yan, J., Mei, Q.: Line: large-scale information network embedding. In: WWW, pp. 1067–1077. International World Wide Web Conferences Steering Committee (2015). https://doi.org/10.1145/2736277.2741093
Yu, C.A., Tai, C.L., Chan, T.S., Yang, Y.H.: Modeling multi-way relations with hypergraph embedding. In: CIKM, pp. 1707–1710. ACM (2018)
Zeng, Z., Liu, X., Song, Y.: Biased random walk based social regularization for word embeddings. In: IJCAI, pp. 4560–4566 (2018)
Zhou, D., Huang, J., Schölkopf, B.: Learning with hypergraphs: clustering, classification, and embedding. In: NIPS, pp. 1601–1608 (2007)
Zhu, Y., Guan, Z., Tan, S., Liu, H., Cai, D., He, X.: Heterogeneous hypergraph embedding for document recommendation. Neurocomputing 216, 150–162 (2016). https://doi.org/10.1016/j.neucom.2016.07.030
Acknowledgment
The paper was supported by the National Key Research and Development Program (2016YFB1000101), the National Natural Science Foundation of China (11801595, 61503420), the Natural Science Foundation of Guangdong (2018A030310076), the Program for Guangdong Introducing Innovative and Entrepreneurial Teams (2016ZT 06D211) and the CCF Opening Project of Information System.
Author information
Authors and Affiliations
Corresponding authors
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2019 Springer Nature Switzerland AG
About this paper
Cite this paper
Huang, J., Chen, C., Ye, F., Wu, J., Zheng, Z., Ling, G. (2019). Hyper2vec: Biased Random Walk for Hyper-network Embedding. In: Li, G., Yang, J., Gama, J., Natwichai, J., Tong, Y. (eds) Database Systems for Advanced Applications. DASFAA 2019. Lecture Notes in Computer Science(), vol 11448. Springer, Cham. https://doi.org/10.1007/978-3-030-18590-9_27
Download citation
DOI: https://doi.org/10.1007/978-3-030-18590-9_27
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-030-18589-3
Online ISBN: 978-3-030-18590-9
eBook Packages: Computer ScienceComputer Science (R0)