{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,25]],"date-time":"2026-04-25T14:42:38Z","timestamp":1777128158361,"version":"3.51.4"},"reference-count":56,"publisher":"Association for Computing Machinery (ACM)","issue":"3","license":[{"start":{"date-parts":[[2020,5,5]],"date-time":"2020-05-05T00:00:00Z","timestamp":1588636800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"name":"CCF Opening Project of Information System"},{"DOI":"10.13039\/501100012166","name":"National Key Research and Development Program","doi-asserted-by":"crossref","award":["2016YFB1000101"],"award-info":[{"award-number":["2016YFB1000101"]}],"id":[{"id":"10.13039\/501100012166","id-type":"DOI","asserted-by":"crossref"}]},{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"crossref","award":["61722214,11801595"],"award-info":[{"award-number":["61722214,11801595"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"crossref"}]},{"DOI":"10.13039\/501100003453","name":"Natural Science Foundation of Guangdong","doi-asserted-by":"crossref","award":["2018A030310076"],"award-info":[{"award-number":["2018A030310076"]}],"id":[{"id":"10.13039\/501100003453","id-type":"DOI","asserted-by":"crossref"}]},{"name":"Program for Science and Technology Planning Project of Guangdong Province of China","award":["NO.2018B010109001"],"award-info":[{"award-number":["NO.2018B010109001"]}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":["ACM Trans. Inf. Syst."],"published-print":{"date-parts":[[2020,7,31]]},"abstract":"<jats:p>Network embedding which aims to learn the low-dimensional representations for vertices in networks has been extensively studied in recent years. Although there are various models designed for networks with different properties and different structures for different tasks, most of them are only applied to normal networks which only contain pairwise relationships between vertices. In many realistic cases, relationships among objects are not pairwise and such relationships can be better modeled by a hyper-network in which each edge can connect an uncertain number of vertices. In this article, we focus on two properties of hyper-networks: nonuniform and dual property. In order to make full use of these two properties, we firstly propose a flexible model called Hyper2vec to learn the embeddings of hyper-networks by applying a biased second order random walk strategy to hyper-networks in the framework of Skip-gram. Then, we combine the features of hyperedges by considering the dual hyper-networks to build a further model called NHNE based on 1D convolutional neural networks, and train a tuplewise similarity function for the nonuniform relationships in hyper-networks. Extensive experiments demonstrate the significant effectiveness of our methods for hyper-network embedding.<\/jats:p>","DOI":"10.1145\/3388924","type":"journal-article","created":{"date-parts":[[2020,5,6]],"date-time":"2020-05-06T00:28:15Z","timestamp":1588724895000},"page":"1-18","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":12,"title":["Nonuniform Hyper-Network Embedding with Dual Mechanism"],"prefix":"10.1145","volume":"38","author":[{"given":"Jie","family":"Huang","sequence":"first","affiliation":[{"name":"Sun Yat-sen University, Guangzhou, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Chuan","family":"Chen","sequence":"additional","affiliation":[{"name":"Sun Yat-sen University, Guangzhou, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Fanghua","family":"Ye","sequence":"additional","affiliation":[{"name":"University College London, London, UK"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Weibo","family":"Hu","sequence":"additional","affiliation":[{"name":"Sun Yat-sen University, Guangzhou, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Zibin","family":"Zheng","sequence":"additional","affiliation":[{"name":"Sun Yat-sen University, Guangzhou, China"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2020,5,5]]},"reference":[{"key":"#cr-split#-e_1_2_1_1_1.1","doi-asserted-by":"crossref","unstructured":"Sameer Agarwal Kristin Branson and Serge Belongie. 2006. Higher order learning with graphs. In ICML. ACM 17--24. DOI:https:\/\/doi.org\/10.1145\/1143844.1143847 10.1145\/1143844.1143847","DOI":"10.1145\/1143844.1143847"},{"key":"#cr-split#-e_1_2_1_1_1.2","doi-asserted-by":"crossref","unstructured":"Sameer Agarwal Kristin Branson and Serge Belongie. 2006. Higher order learning with graphs. In ICML. ACM 17--24. DOI:https:\/\/doi.org\/10.1145\/1143844.1143847","DOI":"10.1145\/1143844.1143847"},{"key":"#cr-split#-e_1_2_1_2_1.1","doi-asserted-by":"crossref","unstructured":"Lars Backstrom and Jure Leskovec. 2011. Supervised random walks: Predicting and recommending links in social networks. In WSDM. ACM 635--644. DOI:https:\/\/doi.org\/10.1145\/1935826.1935914 10.1145\/1935826.1935914","DOI":"10.1145\/1935826.1935914"},{"key":"#cr-split#-e_1_2_1_2_1.2","doi-asserted-by":"crossref","unstructured":"Lars Backstrom and Jure Leskovec. 2011. Supervised random walks: Predicting and recommending links in social networks. In WSDM. ACM 635--644. DOI:https:\/\/doi.org\/10.1145\/1935826.1935914","DOI":"10.1145\/1935826.1935914"},{"key":"e_1_2_1_3_1","volume-title":"Heterogeneous hyper-network embedding","author":"Baytas Inci M.","unstructured":"Inci M. Baytas , Cao Xiao , Fei Wang , Anil K. Jain , and Jiayu Zhou . 2018. Heterogeneous hyper-network embedding . In ICDM. IEEE , 875--880. Inci M. Baytas, Cao Xiao, Fei Wang, Anil K. Jain, and Jiayu Zhou. 2018. Heterogeneous hyper-network embedding. In ICDM. IEEE, 875--880."},{"key":"e_1_2_1_4_1","unstructured":"Luca Becchetti Carlos Castillo Debora Donato Adriano Fazzone and I. Rome. 2006. A comparison of sampling techniques for web graph characterization. In LinkKDD. Luca Becchetti Carlos Castillo Debora Donato Adriano Fazzone and I. Rome. 2006. A comparison of sampling techniques for web graph characterization. In LinkKDD."},{"key":"e_1_2_1_5_1","doi-asserted-by":"crossref","unstructured":"Mikhail Belkin and Partha Niyogi. 2002. Laplacian eigenmaps and spectral techniques for embedding and clustering. In NIPS. 585--591. Mikhail Belkin and Partha Niyogi. 2002. Laplacian eigenmaps and spectral techniques for embedding and clustering. In NIPS. 585--591.","DOI":"10.7551\/mitpress\/1120.003.0080"},{"key":"e_1_2_1_6_1","volume-title":"Hypergraphs: Combinatorics of Finite Sets.","author":"Berge Claude","year":"1984","unstructured":"Claude Berge . 1984 . Hypergraphs: Combinatorics of Finite Sets. Vol. 45 . Elsevier . Claude Berge. 1984. Hypergraphs: Combinatorics of Finite Sets. Vol. 45. Elsevier."},{"key":"e_1_2_1_7_1","volume-title":"Graphs and hypergraphs. North-Holland","author":"Berge Claude","unstructured":"Claude Berge and Edward Minieka . 1973. Graphs and hypergraphs. North-Holland , Amsterdam . Claude Berge and Edward Minieka. 1973. Graphs and hypergraphs. North-Holland, Amsterdam."},{"key":"e_1_2_1_8_1","unstructured":"Shaosheng Cao Wei Lu and Qiongkai Xu. 2016. Deep neural networks for learning graph representations. In AAAI. 1145--1152. Shaosheng Cao Wei Lu and Qiongkai Xu. 2016. Deep neural networks for learning graph representations. In AAAI. 1145--1152."},{"key":"e_1_2_1_9_1","volume-title":"Huang","author":"Chang Shiyu","year":"2015","unstructured":"Shiyu Chang , Wei Han , Jiliang Tang , Guo-Jun Qi , Charu C. Aggarwal , and Thomas S . Huang . 2015 . Heterogeneous network embedding via deep architectures. In KDD. ACM , 119--128. Shiyu Chang, Wei Han, Jiliang Tang, Guo-Jun Qi, Charu C. Aggarwal, and Thomas S. Huang. 2015. Heterogeneous network embedding via deep architectures. In KDD. ACM, 119--128."},{"key":"e_1_2_1_10_1","volume-title":"A survey on network embedding","author":"Cui Peng","year":"2018","unstructured":"Peng Cui , Xiao Wang , Jian Pei , and Wenwu Zhu . 2018. A survey on network embedding . IEEE Transactions on Knowledge and Data Engineering ( 2018 ). Peng Cui, Xiao Wang, Jian Pei, and Wenwu Zhu. 2018. A survey on network embedding. IEEE Transactions on Knowledge and Data Engineering (2018)."},{"key":"e_1_2_1_11_1","doi-asserted-by":"crossref","unstructured":"Yuxiao Dong Nitesh V. Chawla and Ananthram Swami. 2017. metapath2vec: Scalable representation learning for heterogeneous networks. In KDD. ACM 135--144. Yuxiao Dong Nitesh V. Chawla and Ananthram Swami. 2017. metapath2vec: Scalable representation learning for heterogeneous networks. In KDD. ACM 135--144.","DOI":"10.1145\/3097983.3098036"},{"key":"e_1_2_1_12_1","doi-asserted-by":"crossref","unstructured":"Rui Feng Yang Yang Wenjie Hu Fei Wu and Yueting Zhang. 2018. Representation learning for scale-free networks. In AAAI. Rui Feng Yang Yang Wenjie Hu Fei Wu and Yueting Zhang. 2018. Representation learning for scale-free networks. In AAAI.","DOI":"10.1609\/aaai.v32i1.11256"},{"key":"e_1_2_1_13_1","doi-asserted-by":"crossref","unstructured":"Ming Gao Leihui Chen Xiangnan He and Aoying Zhou. 2018. BiNE: Bipartite network embedding. In SIGIR. 715--724. Ming Gao Leihui Chen Xiangnan He and Aoying Zhou. 2018. BiNE: Bipartite network embedding. In SIGIR. 715--724.","DOI":"10.1145\/3209978.3209987"},{"key":"#cr-split#-e_1_2_1_14_1.1","doi-asserted-by":"crossref","unstructured":"Aditya Grover and Jure Leskovec. 2016. node2vec: Scalable feature learning for networks. In KDD. ACM 855--864. DOI:https:\/\/doi.org\/10.1145\/2939672.2939754 10.1145\/2939672.2939754","DOI":"10.1145\/2939672.2939754"},{"key":"#cr-split#-e_1_2_1_14_1.2","doi-asserted-by":"crossref","unstructured":"Aditya Grover and Jure Leskovec. 2016. node2vec: Scalable feature learning for networks. In KDD. ACM 855--864. DOI:https:\/\/doi.org\/10.1145\/2939672.2939754","DOI":"10.1145\/2939672.2939754"},{"key":"e_1_2_1_15_1","unstructured":"Xiangnan He Lizi Liao Hanwang Zhang Liqiang Nie Xia Hu and Tat-Seng Chua. 2017. Neural collaborative filtering. In WWW. 173--182. Xiangnan He Lizi Liao Hanwang Zhang Liqiang Nie Xia Hu and Tat-Seng Chua. 2017. Neural collaborative filtering. In WWW. 173--182."},{"key":"e_1_2_1_16_1","volume-title":"Retrieved on","author":"Hinton Geoffrey","year":"2012","unstructured":"Geoffrey Hinton , Nitish Srivastava , and Kevin Swersky . 2012 . Neural networks for machine learning lecture 6a overview of mini-batch gradient descent . Retrieved on January 20, 2019 from http:\/\/www.cs.toronto.edu\/\u223chinton\/coursera\/lecture6\/lec6.pdf. Geoffrey Hinton, Nitish Srivastava, and Kevin Swersky. 2012. Neural networks for machine learning lecture 6a overview of mini-batch gradient descent. Retrieved on January 20, 2019 from http:\/\/www.cs.toronto.edu\/\u223chinton\/coursera\/lecture6\/lec6.pdf."},{"key":"e_1_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1198\/016214502388618906"},{"key":"e_1_2_1_18_1","volume-title":"Hyper2vec: Biased random walk for hyper-network embedding","author":"Huang Jie","unstructured":"Jie Huang , Chuan Chen , Fanghua Ye , Jiajing Wu , Zibin Zheng , and Guohui Ling . 2019. Hyper2vec: Biased random walk for hyper-network embedding . In DASFAA. Springer , 273--277. Jie Huang, Chuan Chen, Fanghua Ye, Jiajing Wu, Zibin Zheng, and Guohui Ling. 2019. Hyper2vec: Biased random walk for hyper-network embedding. In DASFAA. Springer, 273--277."},{"key":"e_1_2_1_19_1","volume-title":"Kipf and Max Welling","author":"Thomas","year":"2016","unstructured":"Thomas N. Kipf and Max Welling . 2016 . Semi-supervised classification with graph convolutional networks. arXiv preprint arXiv:1609.02907. Thomas N. Kipf and Max Welling. 2016. Semi-supervised classification with graph convolutional networks. arXiv preprint arXiv:1609.02907."},{"key":"e_1_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1080\/00031305.1979.10482697"},{"key":"e_1_2_1_21_1","volume-title":"On the bias of BFS (breadth first search)","author":"Kurant Maciej","unstructured":"Maciej Kurant , Athina Markopoulou , and Patrick Thiran . 2010. On the bias of BFS (breadth first search) . In ITC. IEEE , 1--8. DOI:https:\/\/doi.org\/10.1109\/ITC.2010.5608727 10.1109\/ITC.2010.5608727 Maciej Kurant, Athina Markopoulou, and Patrick Thiran. 2010. On the bias of BFS (breadth first search). In ITC. IEEE, 1--8. DOI:https:\/\/doi.org\/10.1109\/ITC.2010.5608727"},{"key":"e_1_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevE.73.016102"},{"key":"e_1_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.5555\/1241540.1241551"},{"key":"e_1_2_1_24_1","unstructured":"Tomas Mikolov Kai Chen Greg Corrado and Jeffrey Dean. 2013. Efficient estimation of word representations in vector space. arXiv preprint arXiv:1301.3781. Tomas Mikolov Kai Chen Greg Corrado and Jeffrey Dean. 2013. Efficient estimation of word representations in vector space. arXiv preprint arXiv:1301.3781."},{"key":"e_1_2_1_25_1","volume-title":"Wiener","author":"Najork Marc","year":"2001","unstructured":"Marc Najork and Janet L . Wiener . 2001 . Breadth-first crawling yields high-quality pages. In WWW. ACM , 114--118. DOI:https:\/\/doi.org\/10.1145\/371920.371965 10.1145\/371920.371965 Marc Najork and Janet L. Wiener. 2001. Breadth-first crawling yields high-quality pages. In WWW. ACM, 114--118. DOI:https:\/\/doi.org\/10.1145\/371920.371965"},{"key":"e_1_2_1_26_1","unstructured":"Andrew Y. Ng Michael I. Jordan and Yair Weiss. 2002. On spectral clustering: Analysis and an algorithm. In NIPS. 849--856. Andrew Y. Ng Michael I. Jordan and Yair Weiss. 2002. On spectral clustering: Analysis and an algorithm. In NIPS. 849--856."},{"key":"e_1_2_1_27_1","volume-title":"Deepwalk: Online learning of social representations. In KDD. ACM, 701--710. DOI:https:\/\/doi.org\/10.1145\/2623330.2623732","author":"Perozzi Bryan","year":"2014","unstructured":"Bryan Perozzi , Rami Al-Rfou , and Steven Skiena . 2014 . Deepwalk: Online learning of social representations. In KDD. ACM, 701--710. DOI:https:\/\/doi.org\/10.1145\/2623330.2623732 10.1145\/2623330.2623732 Bryan Perozzi, Rami Al-Rfou, and Steven Skiena. 2014. Deepwalk: Online learning of social representations. In KDD. ACM, 701--710. DOI:https:\/\/doi.org\/10.1145\/2623330.2623732"},{"key":"e_1_2_1_28_1","volume-title":"BPR: Bayesian personalized ranking from implicit feedback","author":"Rendle Steffen","year":"2009","unstructured":"Steffen Rendle , Christoph Freudenthaler , Zeno Gantner , and Lars Schmidt-Thieme . 2009 . BPR: Bayesian personalized ranking from implicit feedback . In UAI. AUAI Press , 452--461. Steffen Rendle, Christoph Freudenthaler, Zeno Gantner, and Lars Schmidt-Thieme. 2009. BPR: Bayesian personalized ranking from implicit feedback. In UAI. AUAI Press, 452--461."},{"key":"e_1_2_1_29_1","doi-asserted-by":"publisher","DOI":"10.1126\/science.290.5500.2323"},{"key":"e_1_2_1_30_1","volume-title":"Ivan Titov, and Max Welling.","author":"Schlichtkrull Michael","year":"2018","unstructured":"Michael Schlichtkrull , Thomas N. Kipf , Peter Bloem , Rianne Van Den Berg , Ivan Titov, and Max Welling. 2018 . Modeling relational data with graph convolutional networks. In ESWC. Springer , 593--607. Michael Schlichtkrull, Thomas N. Kipf, Peter Bloem, Rianne Van Den Berg, Ivan Titov, and Max Welling. 2018. Modeling relational data with graph convolutional networks. In ESWC. Springer, 593--607."},{"key":"e_1_2_1_31_1","doi-asserted-by":"publisher","DOI":"10.1109\/TKDE.2018.2833443"},{"key":"#cr-split#-e_1_2_1_32_1.1","doi-asserted-by":"crossref","unstructured":"Liang Sun Shuiwang Ji and Jieping Ye. 2008. Hypergraph spectral learning for multi-label classification. In KDD. ACM 668--676. DOI:https:\/\/doi.org\/10.1145\/1401890.1401971 10.1145\/1401890.1401971","DOI":"10.1145\/1401890.1401971"},{"key":"#cr-split#-e_1_2_1_32_1.2","doi-asserted-by":"crossref","unstructured":"Liang Sun Shuiwang Ji and Jieping Ye. 2008. Hypergraph spectral learning for multi-label classification. In KDD. ACM 668--676. DOI:https:\/\/doi.org\/10.1145\/1401890.1401971","DOI":"10.1145\/1401890.1401971"},{"key":"e_1_2_1_33_1","volume-title":"Line: Large-scale information network embedding. In WWW. 1067--1077. DOI:https:\/\/doi.org\/10.1145\/2736277.2741093","author":"Tang Jian","year":"2015","unstructured":"Jian Tang , Meng Qu , Mingzhe Wang , Ming Zhang , Jun Yan , and Qiaozhu Mei . 2015 . Line: Large-scale information network embedding. In WWW. 1067--1077. DOI:https:\/\/doi.org\/10.1145\/2736277.2741093 10.1145\/2736277.2741093 Jian Tang, Meng Qu, Mingzhe Wang, Ming Zhang, Jun Yan, and Qiaozhu Mei. 2015. Line: Large-scale information network embedding. In WWW. 1067--1077. DOI:https:\/\/doi.org\/10.1145\/2736277.2741093"},{"key":"e_1_2_1_34_1","doi-asserted-by":"publisher","DOI":"10.1007\/s10618-010-0210-x"},{"key":"e_1_2_1_35_1","doi-asserted-by":"publisher","DOI":"10.1126\/science.290.5500.2319"},{"key":"e_1_2_1_36_1","doi-asserted-by":"crossref","unstructured":"Ke Tu Peng Cui Xiao Wang Fei Wang and Wenwu Zhu. 2018. Structural deep embedding for hyper-networks. In AAAI. Ke Tu Peng Cui Xiao Wang Fei Wang and Wenwu Zhu. 2018. Structural deep embedding for hyper-networks. In AAAI.","DOI":"10.1609\/aaai.v32i1.11266"},{"key":"#cr-split#-e_1_2_1_37_1.1","doi-asserted-by":"crossref","unstructured":"Daixin Wang Peng Cui and Wenwu Zhu. 2016. Structural deep network embedding. In KDD. ACM 1225--1234. DOI:https:\/\/doi.org\/10.1145\/2939672.2939753 10.1145\/2939672.2939753","DOI":"10.1145\/2939672.2939753"},{"key":"#cr-split#-e_1_2_1_37_1.2","doi-asserted-by":"crossref","unstructured":"Daixin Wang Peng Cui and Wenwu Zhu. 2016. Structural deep network embedding. In KDD. ACM 1225--1234. DOI:https:\/\/doi.org\/10.1145\/2939672.2939753","DOI":"10.1145\/2939672.2939753"},{"key":"e_1_2_1_38_1","volume-title":"Shine: Signed heterogeneous information network embedding for sentiment link prediction. In WSDM. ACM, 592--600.","author":"Wang Hongwei","year":"2018","unstructured":"Hongwei Wang , Fuzheng Zhang , Min Hou , Xing Xie , Minyi Guo , and Qi Liu . 2018 . Shine: Signed heterogeneous information network embedding for sentiment link prediction. In WSDM. ACM, 592--600. Hongwei Wang, Fuzheng Zhang, Min Hou, Xing Xie, Minyi Guo, and Qi Liu. 2018. Shine: Signed heterogeneous information network embedding for sentiment link prediction. In WSDM. ACM, 592--600."},{"key":"e_1_2_1_39_1","volume-title":"Signed network embedding in social media","author":"Wang Suhang","unstructured":"Suhang Wang , Jiliang Tang , Charu Aggarwal , Yi Chang , and Huan Liu . 2017. Signed network embedding in social media . In SDM. SIAM , 327--335. Suhang Wang, Jiliang Tang, Charu Aggarwal, Yi Chang, and Huan Liu. 2017. Signed network embedding in social media. In SDM. SIAM, 327--335."},{"key":"e_1_2_1_40_1","doi-asserted-by":"publisher","DOI":"10.1145\/96105.96107"},{"key":"e_1_2_1_41_1","first-page":"65","article-title":"Random walks and their applications: Widely used as mathematical models, random walks play an important role in several areas of physics, chemistry, and biology","volume":"71","author":"Weiss George H.","year":"1983","unstructured":"George H. Weiss . 1983 . Random walks and their applications: Widely used as mathematical models, random walks play an important role in several areas of physics, chemistry, and biology . American Scientist 71 , 1 (1983), 65 -- 71 . George H. Weiss. 1983. Random walks and their applications: Widely used as mathematical models, random walks play an important role in several areas of physics, chemistry, and biology. American Scientist 71, 1 (1983), 65--71.","journal-title":"American Scientist"},{"key":"e_1_2_1_42_1","doi-asserted-by":"publisher","DOI":"10.5555\/1946459.1946468"},{"key":"e_1_2_1_43_1","unstructured":"Biao Xiang Ziqi Liu Jun Zhou and Xiaolong Li. 2018. Feature propagation on graph: A new perspective to graph representation learning. arXiv preprint arXiv:1804.06111. Biao Xiang Ziqi Liu Jun Zhou and Xiaolong Li. 2018. Feature propagation on graph: A new perspective to graph representation learning. arXiv preprint arXiv:1804.06111."},{"key":"e_1_2_1_44_1","volume-title":"Yu","author":"Xu Linchuan","year":"2017","unstructured":"Linchuan Xu , Xiaokai Wei , Jiannong Cao , and Philip S . Yu . 2017 . Embedding of embedding (eoe): Joint embedding for coupled heterogeneous networks. In WSDM. ACM , 741--749. Linchuan Xu, Xiaokai Wei, Jiannong Cao, and Philip S. Yu. 2017. Embedding of embedding (eoe): Joint embedding for coupled heterogeneous networks. In WSDM. ACM, 741--749."},{"key":"#cr-split#-e_1_2_1_45_1.1","doi-asserted-by":"crossref","unstructured":"Chia-An Yu Ching-Lun Tai Tak-Shing Chan and Yi-Hsuan Yang. 2018. Modeling multi-way relations with hypergraph embedding. In CIKM. ACM 1707--1710. DOI:https:\/\/doi.org\/10.1145\/3269206.3269274 10.1145\/3269206.3269274","DOI":"10.1145\/3269206.3269274"},{"key":"#cr-split#-e_1_2_1_45_1.2","doi-asserted-by":"crossref","unstructured":"Chia-An Yu Ching-Lun Tai Tak-Shing Chan and Yi-Hsuan Yang. 2018. Modeling multi-way relations with hypergraph embedding. In CIKM. ACM 1707--1710. DOI:https:\/\/doi.org\/10.1145\/3269206.3269274","DOI":"10.1145\/3269206.3269274"},{"key":"e_1_2_1_46_1","doi-asserted-by":"crossref","unstructured":"Ziqian Zeng Xin Liu and Yangqiu Song. 2018. Biased random walk based social regularization for word embeddings. In IJCAI. 4560--4566. Ziqian Zeng Xin Liu and Yangqiu Song. 2018. Biased random walk based social regularization for word embeddings. In IJCAI. 4560--4566.","DOI":"10.24963\/ijcai.2018\/634"},{"key":"#cr-split#-e_1_2_1_47_1.1","doi-asserted-by":"crossref","unstructured":"Ziwei Zhang Peng Cui Xiao Wang Jian Pei Xuanrong Yao and Wenwu Zhu. 2018. Arbitrary-order proximity preserved network embedding. In KDD. ACM 2778--2786. DOI:https:\/\/doi.org\/10.1145\/3219819.3219969 10.1145\/3219819.3219969","DOI":"10.1145\/3219819.3219969"},{"key":"#cr-split#-e_1_2_1_47_1.2","doi-asserted-by":"crossref","unstructured":"Ziwei Zhang Peng Cui Xiao Wang Jian Pei Xuanrong Yao and Wenwu Zhu. 2018. Arbitrary-order proximity preserved network embedding. In KDD. ACM 2778--2786. DOI:https:\/\/doi.org\/10.1145\/3219819.3219969","DOI":"10.1145\/3219819.3219969"},{"key":"e_1_2_1_48_1","doi-asserted-by":"crossref","unstructured":"Denny Zhou Jiayuan Huang and Bernhard Sch\u00f6lkopf. 2007. Learning with hypergraphs: Clustering classification and embedding. In NIPS. 1601--1608. Denny Zhou Jiayuan Huang and Bernhard Sch\u00f6lkopf. 2007. Learning with hypergraphs: Clustering classification and embedding. In NIPS. 1601--1608.","DOI":"10.7551\/mitpress\/7503.003.0205"},{"key":"e_1_2_1_49_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.neucom.2016.07.030"}],"container-title":["ACM Transactions on Information Systems"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3388924","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3388924","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,17]],"date-time":"2025-06-17T22:33:02Z","timestamp":1750199582000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3388924"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020,5,5]]},"references-count":56,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2020,7,31]]}},"alternative-id":["10.1145\/3388924"],"URL":"https:\/\/doi.org\/10.1145\/3388924","relation":{},"ISSN":["1046-8188","1558-2868"],"issn-type":[{"value":"1046-8188","type":"print"},{"value":"1558-2868","type":"electronic"}],"subject":[],"published":{"date-parts":[[2020,5,5]]},"assertion":[{"value":"2019-07-01","order":0,"name":"received","label":"Received","group":{"name":"publication_history","label":"Publication History"}},{"value":"2020-03-01","order":1,"name":"accepted","label":"Accepted","group":{"name":"publication_history","label":"Publication History"}},{"value":"2020-05-05","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}