{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,18]],"date-time":"2026-04-18T16:24:48Z","timestamp":1776529488764,"version":"3.51.2"},"reference-count":73,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2023,3,21]],"date-time":"2023-03-21T00:00:00Z","timestamp":1679356800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"},{"start":{"date-parts":[[2023,3,21]],"date-time":"2023-03-21T00:00:00Z","timestamp":1679356800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Soc. Netw. Anal. Min."],"abstract":"<jats:title>Abstract<\/jats:title><jats:p>Research on graph representation learning (a.k.a. embedding) has received great attention in recent years and shows effective results for various types of networks. Nevertheless, few initiatives have been focused on the particular case of embeddings for bipartite graphs. In this paper, we first define the graph embedding problem in the case of bipartite graphs. Next, we propose a taxonomy of approaches used to tackle this problem and draw a description of state-of-the-art methods. Then, we establish their pros and cons with respect to conventional network embeddings. Finally, we provide a description of available resources to lead experiments on the subject.<\/jats:p>","DOI":"10.1007\/s13278-023-01058-z","type":"journal-article","created":{"date-parts":[[2023,3,21]],"date-time":"2023-03-21T18:02:59Z","timestamp":1679421779000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":21,"title":["A survey on bipartite graphs embedding"],"prefix":"10.1007","volume":"13","author":[{"given":"Edward","family":"Giamphy","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jean-Loup","family":"Guillaume","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Antoine","family":"Doucet","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Kevin","family":"Sanchis","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2023,3,21]]},"reference":[{"key":"1058_CR1","unstructured":"Arsov N, Mirceva G (2019) Network Embedding: An Overview. arXiv. arxiv:1911.11726"},{"key":"1058_CR2","unstructured":"Asghar N (2016) Yelp dataset challenge: review rating prediction. arXiv . arxiv:1605.05362"},{"key":"1058_CR3","doi-asserted-by":"publisher","unstructured":"Backstrom L, Huttenlocher D, Kleinberg J, Lan X (2006) Group formation in large social networks: Membership, growth, and evolution. In: Proceedings of the 12th ACM SIGKDD international conference on knowledge discovery and data mining. KDD \u201906, pp 44\u201354. Association for Computing Machinery, New York, NY, USA . https:\/\/doi.org\/10.1145\/1150402.1150412","DOI":"10.1145\/1150402.1150412"},{"key":"1058_CR4","unstructured":"Baltrunas L, Church K, Karatzoglou A, Oliver N (2015) Frappe: understanding the usage and perception of mobile app recommendations in-the-wild. arXiv . arxiv:1505.03014"},{"key":"1058_CR5","unstructured":"Barros CDT, Mendon\u00e7a MRF, Vieira AB, Ziviani A (2021) A survey on embedding dynamic graphs. arXiv . arxiv:2101.01229"},{"issue":"9","key":"1058_CR6","doi-asserted-by":"publisher","first-page":"624","DOI":"10.1016\/j.tips.2019.07.005","volume":"40","author":"AO Basile","year":"2019","unstructured":"Basile AO, Yahi A, Tatonetti NP (2019) Artificial intelligence for drug toxicity and safety. Trends Pharmacol Sci 40(9):624\u2013635. https:\/\/doi.org\/10.1016\/j.tips.2019.07.005","journal-title":"Trends Pharmacol Sci"},{"key":"1058_CR7","unstructured":"Bennett J, Lanning S (2007) The netflix prize"},{"key":"1058_CR8","unstructured":"Bertin-Mahieux T, Ellis DPW, Whitman B, Lamere P (2011) The million song dataset. In: Proceedings of the 12th international conference on music information retrieval (ISMIR 2011)"},{"key":"1058_CR9","doi-asserted-by":"publisher","first-page":"109","DOI":"10.1016\/j.knosys.2013.03.012","volume":"46","author":"J Bobadilla","year":"2013","unstructured":"Bobadilla J, Ortega F, Hernando A, Guti\u00e9rrez A (2013) Recommender systems survey. Knowl-Based Syst 46:109\u2013132. https:\/\/doi.org\/10.1016\/j.knosys.2013.03.012","journal-title":"Knowl-Based Syst"},{"key":"1058_CR10","unstructured":"Cai H, Zheng VW, Chang KC-C (2017) A comprehensive survey of graph embedding: problems, techniques and applications. arXiv . arxiv:1709.07604"},{"key":"1058_CR11","doi-asserted-by":"crossref","unstructured":"Celma O (2010) Music recommendation and discovery in the long tail. Springer, ???","DOI":"10.1007\/978-3-642-13287-2"},{"issue":"1","key":"1058_CR12","doi-asserted-by":"publisher","first-page":"2","DOI":"10.1145\/1132952.1132954","volume":"38","author":"D Chakrabarti","year":"2006","unstructured":"Chakrabarti D, Faloutsos C (2006) Graph mining: laws generators and algorithms. ACM Comput Surv 38(1):2. https:\/\/doi.org\/10.1145\/1132952.1132954","journal-title":"ACM Comput Surv"},{"key":"1058_CR13","doi-asserted-by":"crossref","unstructured":"Cheng H-T, Koc L, Harmsen J, Shaked T, Chandra T, Aradhye H, Anderson G, Corrado G, Chai W, Ispir M, Anil R, Haque Z, Hong L, Jain V, Liu X, Shah H (2016) Wide & deep learning for recommender systems","DOI":"10.1145\/2988450.2988454"},{"issue":"6","key":"1058_CR14","doi-asserted-by":"publisher","first-page":"3468","DOI":"10.1137\/090775087","volume":"33","author":"J Chen","year":"2011","unstructured":"Chen J, Safro I (2011) Algebraic distance on graphs. SIAM J Sci Comput 33(6):3468\u20133490","journal-title":"SIAM J Sci Comput"},{"key":"1058_CR15","doi-asserted-by":"crossref","unstructured":"Chen C-M, Wang C-J, Tsai M-F, Yang Y-H (2019) Collaborative similarity embedding for recommender systems. arXiv . arxiv:1902.06188","DOI":"10.1145\/3308558.3313493"},{"key":"1058_CR16","unstructured":"Dwivedi VP, Luu AT, Laurent T, Bengio Y, Bresson X (2022) Graph neural networks with learnable structural and positional representations. In: International conference on learning representations . https:\/\/openreview.net\/forum?id=wTTjnvGphYj"},{"key":"1058_CR17","doi-asserted-by":"crossref","unstructured":"Gao M, Chen L, He X, Zhou A (2018) Bine: bipartite network embedding. In: The 41st International ACM SIGIR conference on research & development in information retrieval, pp 715\u2013724","DOI":"10.1145\/3209978.3209987"},{"key":"1058_CR18","unstructured":"Gao M, He X, Chen L, Liu T, Zhang J, Zhou A (2019) Learning vertex representations for bipartite networks. arXiv . arXiv:1901.09676"},{"key":"1058_CR19","unstructured":"Gao C, Zheng Y, Li N, Li Y, Qin Y, Piao J, Quan Y, Chang J, Jin D, He X, Li Y (2021) A survey of graph neural networks for recommender systems: challenges, methods, and directions. arXiv . arxiv:2109.12843"},{"issue":"5629","key":"1058_CR20","doi-asserted-by":"publisher","first-page":"102","DOI":"10.1126\/science.1081900","volume":"301","author":"TS Gardner","year":"2003","unstructured":"Gardner TS, di Bernardo D, Lorenz D, Collins JJ (2003) Inferring genetic networks and identifying compound mode of action via expression profiling. Science 301(5629):102\u2013105. https:\/\/doi.org\/10.1126\/science.1081900","journal-title":"Science"},{"key":"1058_CR21","doi-asserted-by":"crossref","unstructured":"Giles CL, Bollacker KD, Lawrence S (1998) Citeseer: an automatic citation indexing system. In: DL \u201998","DOI":"10.1145\/276675.276685"},{"key":"1058_CR22","unstructured":"Godwin J, Keck T, Battaglia P, Bapst V, Kipf T, Li Y, Stachenfeld K, Veli\u010dkovi\u0107 P, Sanchez-Gonzalez A Jraph: a library for graph neural networks In jax. http:\/\/github.com\/deepmind\/jraph"},{"key":"1058_CR23","unstructured":"Grattarola D, Alippi C (2020) Graph neural networks in tensorflow and keras with spektral. arXiv . arxiv:2006.12138"},{"key":"1058_CR24","doi-asserted-by":"crossref","unstructured":"Grover, A, Leskovec, J (2016) node2vec: scalable feature learning for networks. arXiv . arxiv:1607.00653","DOI":"10.1145\/2939672.2939754"},{"issue":"5","key":"1058_CR25","doi-asserted-by":"publisher","first-page":"215","DOI":"10.1016\/j.ipl.2004.03.007","volume":"90","author":"J-L Guillaume","year":"2004","unstructured":"Guillaume J-L, Latapy M (2004) Bipartite structure of all complex networks. Inf Process Lett 90(5):215\u2013221","journal-title":"Inf Process Lett"},{"issue":"3","key":"1058_CR26","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/978-3-031-01588-5","volume":"14","author":"WL Hamilton","year":"2020","unstructured":"Hamilton WL (2020) Graph representation learning. Synthesis Lectures Artif Intell Mach Learn 14(3):1\u2013159","journal-title":"Synthesis Lectures Artif Intell Mach Learn"},{"key":"1058_CR27","unstructured":"Hamilton WL, Ying R, Leskovec J (2017) Representation learning on graphs: methods and applications. arXiv preprint arXiv:1709.05584"},{"key":"1058_CR28","unstructured":"Hamilton WL, Ying R, Leskovec J (2018) Representation learning on graphs: methods and applications"},{"key":"1058_CR29","doi-asserted-by":"publisher","unstructured":"Harper FM, Konstan JA (2015) The movielens datasets: history and context. ACM Trans Interact Intell Syst, 5(4) . https:\/\/doi.org\/10.1145\/2827872","DOI":"10.1145\/2827872"},{"issue":"4","key":"1058_CR30","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/2827872","volume":"5","author":"FM Harper","year":"2015","unstructured":"Harper FM, Konstan JA (2015) The movielens datasets: history and context. ACM Trans Interact Intell Syst 5(4):1\u201319. https:\/\/doi.org\/10.1145\/2827872","journal-title":"ACM Trans Interact Intell Syst"},{"key":"1058_CR31","unstructured":"Ha D, Dai A, Le QV (2016) HyperNetworks. arXiv. arxiv:1609.09106"},{"key":"1058_CR32","unstructured":"He C (2019) Heterogeneous graph convolutional networks for bipartite graph embedding"},{"key":"1058_CR33","unstructured":"Hegeman T, Iosup A (2018) Survey of Graph Analysis Applications. arXiv. arxiv:1807.00382"},{"key":"1058_CR34","doi-asserted-by":"publisher","unstructured":"He R, McAuley J (2016) Ups and downs. In: Proceedings of the 25th international conference on world wide web. international world wide web conferences steering committee, ??? . https:\/\/doi.org\/10.1145\/2872427.2883037","DOI":"10.1145\/2872427.2883037"},{"key":"1058_CR35","unstructured":"He C, Xie T, Rong Y, Huang W, Huang J, Ren X, Shahabi C Adversarial Representation Learning on Large-Scale Bipartite Graphs"},{"key":"1058_CR36","unstructured":"He C, Xie T, Rong Y, Huang W, Huang J, Ren X, Shahabi C (2020) Cascade-BGNN: toward efficient self-supervised representation learning on large-scale bipartite graphs"},{"key":"1058_CR37","doi-asserted-by":"crossref","unstructured":"Huang W, Li Y, Fang Y, Fan J, Yang H (2020) Biane: Bipartite attributed network embedding. In: Proceedings of the 43rd international ACM SIGIR conference on research and development in information retrieval, pp 149\u2013158","DOI":"10.1145\/3397271.3401068"},{"key":"1058_CR38","doi-asserted-by":"crossref","unstructured":"Jiang M, Cui P, Yuan NJ, Xie X, Yang S (2016) Little is much: Bridging cross-platform behaviors through overlapped crowds. In: Proceedings of the thirtieth AAAI conference on artificial intelligence. AAAI\u201916, pp 13\u201319. AAAI Press, ???","DOI":"10.1609\/aaai.v30i1.10001"},{"key":"1058_CR39","unstructured":"Kipf TN, Welling M (2016) Semi-supervised classification with graph convolutional networks. arXiv . arxiv:1609.02907"},{"issue":"1","key":"1058_CR40","doi-asserted-by":"publisher","first-page":"5","DOI":"10.1145\/1232722.1232727","volume":"1","author":"J Leskovec","year":"2007","unstructured":"Leskovec J, Adamic LA, Huberman BA (2007) The dynamics of viral marketing. ACM Trans Web 1(1):5. https:\/\/doi.org\/10.1145\/1232722.1232727","journal-title":"ACM Trans Web"},{"key":"1058_CR41","unstructured":"Leskovec J, Lang KJ, Dasgupta A, Mahoney MW (2008) Community structure in large networks: natural cluster sizes and the absence of large well-defined clusters. arXiv . arxiv:0810.1355"},{"key":"1058_CR42","doi-asserted-by":"publisher","unstructured":"Liu Z, Nguyen T-K, Fang Y (2021) Tail-gnn: Tail-node graph neural networks. In: Proceedings of the 27th ACM SIGKDD conference on knowledge discovery and data mining. KDD \u201921, pp 1109\u20131119. association for computing machinery, New York, NY, USA . https:\/\/doi.org\/10.1145\/3447548.3467276","DOI":"10.1145\/3447548.3467276"},{"key":"1058_CR43","doi-asserted-by":"publisher","unstructured":"Li C, Jia K, Shen D, Shi CJR, Yang H (2019) Hierarchical representation learning for bipartite graphs. In: proceedings of the twenty-eighth international joint conference on artificial intelligence, IJCAI-19, pp 2873\u20132879. international joint conferences on artificial intelligence organization, ??? . https:\/\/doi.org\/10.24963\/ijcai.2019\/398","DOI":"10.24963\/ijcai.2019\/398"},{"key":"1058_CR44","unstructured":"Li C, Shi M, Qu B, Li X (2021) Deep attributed network representation learning via attribute enhanced neighborhood. arXiv . arxiv:2104.05234"},{"key":"1058_CR45","unstructured":"Malkov YA, Yashunin DA (2016) Efficient and robust approximate nearest neighbor search using Hierarchical Navigable Small World graphs. arXiv . arxiv:1603.09320"},{"key":"1058_CR46","unstructured":"Matthias, F, Jan\u00a0Eric, L: Fast graph representation learning with pytorch geometric. https:\/\/github.com\/pyg-team\/pytorch_geometric"},{"key":"1058_CR47","doi-asserted-by":"publisher","first-page":"127","DOI":"10.1023\/A:1009953814988","volume":"3","author":"A McCallum","year":"2004","unstructured":"McCallum A, Nigam K, Rennie JDM, Seymore K (2004) Automating the construction of internet portals with machine learning. Inf Retrieval 3:127\u2013163","journal-title":"Inf Retrieval"},{"key":"1058_CR48","doi-asserted-by":"publisher","unstructured":"McFee B, Bertin-Mahieux T, Ellis DPW, Lanckriet GRG (2012) The million song dataset challenge. In: Proceedings of the 21st international conference on world wide web. WWW \u201912 Companion, pp 909\u2013916. association for computing machinery, New York, NY, USA . https:\/\/doi.org\/10.1145\/2187980.2188222","DOI":"10.1145\/2187980.2188222"},{"key":"1058_CR49","unstructured":"Mikolov T, Chen K, Corrado G, Dean J (2013) Efficient estimation of word representations in vector space. arXiv . arxiv:1301.3781"},{"key":"1058_CR50","unstructured":"Mikolov T, Sutskever I, Chen K, Corrado GS, Dean J (2013) Distributed representations of words and phrases and their compositionality. In: Burges, C.J, Bottou, L, Welling, M, Ghahramani, Z, Weinberger, K.Q (eds.) Advances in neural information processing systems, vol. 26. Curran Associates, Inc., ??? . https:\/\/proceedings.neurips.cc\/paper\/2013\/file\/9aa42b31882ec039965f3c4923ce901b-Paper.pdf"},{"key":"1058_CR51","doi-asserted-by":"publisher","DOI":"10.1016\/j.knosys.2021.106746","volume":"214","author":"S Min","year":"2021","unstructured":"Min S, Gao Z, Peng J, Wang L, Qin K, Fang B (2021) Stgsn - a spatial-temporal graph neural network framework for time-evolving social networks. Knowl-Based Syst 214:106746. https:\/\/doi.org\/10.1016\/j.knosys.2021.106746","journal-title":"Knowl-Based Syst"},{"key":"1058_CR52","unstructured":"Graph Nets, https:\/\/www.deepmind.com\/open-source\/graph-nets"},{"issue":"2","key":"1058_CR53","doi-asserted-by":"publisher","DOI":"10.1103\/physreve.64.026118","volume":"64","author":"MEJ Newman","year":"2001","unstructured":"Newman MEJ, Strogatz SH, Watts DJ (2001) Random graphs with arbitrary degree distributions and their applications. Phys Rev E 64(2):026118. https:\/\/doi.org\/10.1103\/physreve.64.026118","journal-title":"Phys Rev E"},{"key":"1058_CR54","doi-asserted-by":"publisher","unstructured":"Perozzi B, Al-Rfou R, Skiena S (2014) DeepWalk. In: Proceedings of the 20th ACM SIGKDD international conference on knowledge discovery and data Mining. ACM, ??? . https:\/\/doi.org\/10.1145\/2623330.2623732","DOI":"10.1145\/2623330.2623732"},{"key":"1058_CR55","doi-asserted-by":"crossref","unstructured":"Rumelhart DE, Mcclelland J (1986) Parallel distributed processing: explorations in the microstructure of cognition. Vol 1. Foundations,","DOI":"10.7551\/mitpress\/5236.001.0001"},{"issue":"3","key":"1058_CR56","doi-asserted-by":"publisher","first-page":"93","DOI":"10.1609\/aimag.v29i3.2157","volume":"29","author":"P Sen","year":"2008","unstructured":"Sen P, Namata G, Bilgic M, Getoor L, Galligher B, Eliassi-Rad T (2008) Collective classification in network data. AI Mag 29(3):93. https:\/\/doi.org\/10.1609\/aimag.v29i3.2157","journal-title":"AI Mag"},{"key":"1058_CR57","unstructured":"Shlens J (2014) Notes on Kullback-Leibler Divergence and Likelihood. arXiv . arxiv:1404.2000"},{"key":"1058_CR58","doi-asserted-by":"publisher","unstructured":"Stauffer M, Tschachtli T, Fischer A, Riesen K (2017). A survey on applications of bipartite graph edit distance. https:\/\/doi.org\/10.1007\/978-3-319-58961-9_22","DOI":"10.1007\/978-3-319-58961-9_22"},{"key":"1058_CR59","unstructured":"Sybrandt J, Safro I FOBE and HOBE: First- and High-Order Bipartite Embeddings"},{"key":"1058_CR60","doi-asserted-by":"publisher","unstructured":"Tang J, Zhang J, Yao L, Li J, Zhang L, Su Z (2008) Arnetminer: Extraction and mining of academic social networks. In: Proceedings of the 14th ACM SIGKDD international conference on knowledge discovery and data mining. KDD \u201908, pp 990\u2013998. association for computing machinery, New York, NY, USA . https:\/\/doi.org\/10.1145\/1401890.1402008","DOI":"10.1145\/1401890.1402008"},{"key":"1058_CR61","doi-asserted-by":"publisher","unstructured":"Tang J, Gao H, Liu H, Das\u00a0Sarma A (2012) Etrust: Understanding trust evolution in an online world. In: Proceedings of the 18th ACM SIGKDD international conference on knowledge discovery and data mining. KDD \u201912, pp. 253\u2013261. association for computing machinery, New York, NY, USA . https:\/\/doi.org\/10.1145\/2339530.2339574","DOI":"10.1145\/2339530.2339574"},{"key":"1058_CR62","unstructured":"Tencent records the watching behaviors of users on movies in QQlive. https:\/\/v.qq.com\/"},{"key":"1058_CR63","unstructured":"Wang H, Chen B, Li W-J (2013) Collaborative topic regression with social regularization for tag recommendation. In: IJCAI"},{"key":"1058_CR64","doi-asserted-by":"crossref","unstructured":"Wang M, Zhang J, Liu J, Hu W, Wang S, Li X, Liu W (2017) PDD Graph: bridging electronic medical records and biomedical knowledge graphs via entity linking. arXiv . arxiv:1707.05340","DOI":"10.1007\/978-3-319-68204-4_23"},{"key":"1058_CR65","unstructured":"Wang M, Zheng D, Ye Z, Gan Q, Li M, Song X, Zhou J, Ma C, Yu L, Gai Y, Xiao T, He T, Karypis G, Li J, Zhang Z (2019) Deep graph library: a graph-centric, highly-performant package for graph neural networks. arXiv. arxiv:1909.01315"},{"key":"1058_CR66","doi-asserted-by":"publisher","unstructured":"West R, Leskovec J (2012) Human wayfinding in information networks. In: proceedings of the 21st international conference on world wide web. WWW \u201912, pp 619\u2013628. association for computing machinery, New York, NY, USA . https:\/\/doi.org\/10.1145\/2187836.2187920","DOI":"10.1145\/2187836.2187920"},{"key":"1058_CR67","unstructured":"West R, Pineau J, Precup D (2009) Wikispeedia: An online game for inferring semantic distances between concepts. In: IJCAI"},{"issue":"1","key":"1058_CR68","doi-asserted-by":"publisher","first-page":"4","DOI":"10.1109\/tnnls.2020.2978386","volume":"32","author":"Z Wu","year":"2021","unstructured":"Wu Z, Pan S, Chen F, Long G, Zhang C, Yu PS (2021) A comprehensive survey on graph neural networks. IEEE Trans Neural Netw Learn Syst 32(1):4\u201324. https:\/\/doi.org\/10.1109\/tnnls.2020.2978386","journal-title":"IEEE Trans Neural Netw Learn Syst"},{"key":"1058_CR69","doi-asserted-by":"publisher","unstructured":"Xu Y, Cohen SB (2018) Stock movement prediction from tweets and historical prices. In: Proceedings of the 56th annual meeting of the association for computational linguistics (Volume 1: Long Papers), pp 1970\u20131979. association for computational linguistics, Melbourne, Australia . https:\/\/doi.org\/10.18653\/v1\/P18-1183","DOI":"10.18653\/v1\/P18-1183"},{"key":"1058_CR70","unstructured":"Yang J, Leskovec J Defining and evaluating network communities based on ground-truth. arXiv arxiv:1205.6233"},{"key":"1058_CR71","unstructured":"Yang C, Xiao Y, Zhang Y, Sun Y, Han J: Heterogeneous network representation learning: a unified framework with survey and benchmark. arXiv (2020). arxiv:2004.00216"},{"key":"1058_CR72","doi-asserted-by":"crossref","unstructured":"Yu L, Zhang C, Pei S, Sun G, Zhang X (2018) Walkranker: A unified pairwise ranking model with multiple relations for item recommendation. In: McIlraith, S.A, Weinberger, K.Q (eds.) proceedings of the thirty-second AAAI conference on artificial intelligence, (AAAI-18), the 30th Innovative Applications of Artificial Intelligence (IAAI-18), and the 8th AAAI Symposium on educational advances in artificial intelligence (EAAI-18), New Orleans, Louisiana, USA, February 2-7, 2018, pp 2596\u20132603. AAAI Press, ??? . https:\/\/www.aaai.org\/ocs\/index.php\/AAAI\/AAAI18\/paper\/view\/16520","DOI":"10.1609\/aaai.v32i1.11866"},{"key":"1058_CR73","doi-asserted-by":"publisher","unstructured":"Zhang Y, Xiong Y, Kong X, Zhu Y (2017) Learning node embeddings in interaction graphs. In: Proceedings of the 2017 ACM on conference on information and knowledge management. CIKM \u201917, pp 397\u2013406. Association for Computing Machinery, New York, NY, USA . https:\/\/doi.org\/10.1145\/3132847.3132918","DOI":"10.1145\/3132847.3132918"}],"container-title":["Social Network Analysis and Mining"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s13278-023-01058-z.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s13278-023-01058-z\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s13278-023-01058-z.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,12,14]],"date-time":"2023-12-14T21:28:19Z","timestamp":1702589299000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s13278-023-01058-z"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,3,21]]},"references-count":73,"journal-issue":{"issue":"1","published-online":{"date-parts":[[2023,12]]}},"alternative-id":["1058"],"URL":"https:\/\/doi.org\/10.1007\/s13278-023-01058-z","relation":{},"ISSN":["1869-5469"],"issn-type":[{"value":"1869-5469","type":"electronic"}],"subject":[],"published":{"date-parts":[[2023,3,21]]},"assertion":[{"value":"24 November 2022","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"2 March 2023","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"4 March 2023","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"21 March 2023","order":4,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}],"article-number":"54"}}