{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,14]],"date-time":"2026-03-14T18:05:28Z","timestamp":1773511528251,"version":"3.50.1"},"publisher-location":"New York, NY, USA","reference-count":50,"publisher":"ACM","license":[{"start":{"date-parts":[[2023,10,21]],"date-time":"2023-10-21T00:00:00Z","timestamp":1697846400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"name":"Institute of Information & communications Technology Planning & Evaluation (IITP) grant funded by the Korea government(MSIT)","award":["No.2022-0-00352,No.RS-2022-00155586,No. 2020-0-01373"],"award-info":[{"award-number":["No.2022-0-00352,No.RS-2022-00155586,No. 2020-0-01373"]}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2023,10,21]]},"DOI":"10.1145\/3583780.3614862","type":"proceedings-article","created":{"date-parts":[[2023,10,21]],"date-time":"2023-10-21T07:45:26Z","timestamp":1697874326000},"page":"2116-2125","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":3,"title":["ELTRA: An Embedding Method based on Learning-to-Rank to Preserve Asymmetric Information in Directed Graphs"],"prefix":"10.1145","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-1529-5473","authenticated-orcid":false,"given":"Masoud","family":"Rehyani Hamedani","sequence":"first","affiliation":[{"name":"Hanyang University, Seoul, Republic of Korea"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-0880-0323","authenticated-orcid":false,"given":"Jin-Su","family":"Ryu","sequence":"additional","affiliation":[{"name":"Hanyang University, Seoul, Republic of Korea"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-6345-9084","authenticated-orcid":false,"given":"Sang-Wook","family":"Kim","sequence":"additional","affiliation":[{"name":"Hanyang University, Seoul, Republic of Korea"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2023,10,21]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1145\/1273496.1273513"},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1145\/3038912.3052585"},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1145\/3308558.3313445"},{"key":"e_1_3_2_1_4_1","volume-title":"Van Loan","author":"Golub Gene H.","year":"2013","unstructured":"Gene H. Golub and Charles F . Van Loan . 2013 . Matrix Computations. Johns Hopkins Univ. Press , 4 th Edition. Gene H. Golub and Charles F. Van Loan. 2013. Matrix Computations. Johns Hopkins Univ. Press, 4th Edition.","edition":"4"},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1145\/2939672.2939754"},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1145\/3459637.3482316"},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1109\/ACCESS.2021.3123114"},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1145\/3543507.3583193"},{"key":"e_1_3_2_1_9_1","volume-title":"Data Mining: Concepts and Techniques","author":"Han Jiawei","year":"2006","unstructured":"Jiawei Han , Micheline Kamber , and Jian Pei . 2006 . Data Mining: Concepts and Techniques , Second Edition. Morgan Kaufmann , San Francisco . Jiawei Han, Micheline Kamber, and Jian Pei. 2006. Data Mining: Concepts and Techniques, Second Edition. Morgan Kaufmann, San Francisco."},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.cosrev.2020.100296"},{"key":"e_1_3_2_1_11_1","unstructured":"Swayambhoo Jain Akshay Soni Nikolay Laptev and Yashar Mehdad. 2017. Rank-to-Engage: New Listwise Approaches to Maximize Engagement. arxiv: 1702.07798 [stat.ML]  Swayambhoo Jain Akshay Soni Nikolay Laptev and Yashar Mehdad. 2017. Rank-to-Engage: New Listwise Approaches to Maximize Engagement. arxiv: 1702.07798 [stat.ML]"},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1145\/582415.582418"},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1007\/BF02289026"},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1371\/journal.pone.0221172"},{"key":"e_1_3_2_1_15_1","volume-title":"Proceedings of the European Conference on Machine Learning and Principles and Practice of Knowledge Discovery in Database, ECML-PKDD. 395--411","author":"Khosla Megha","year":"2019","unstructured":"Megha Khosla , Jurek Leonhardt , Wolfgang Nejdl , and Avishek Anandm . 2019 . Node Representation Learning for Directed Graphs . In Proceedings of the European Conference on Machine Learning and Principles and Practice of Knowledge Discovery in Database, ECML-PKDD. 395--411 . Megha Khosla, Jurek Leonhardt, Wolfgang Nejdl, and Avishek Anandm. 2019. Node Representation Learning for Directed Graphs. In Proceedings of the European Conference on Machine Learning and Principles and Practice of Knowledge Discovery in Database, ECML-PKDD. 395--411."},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1145\/3178876.3186117"},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1145\/1553374.1553449"},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1145\/3340531.3412107"},{"key":"e_1_3_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1145\/1081870.1081893"},{"key":"e_1_3_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.14778\/1453856.1453904"},{"key":"e_1_3_2_1_21_1","volume-title":"Learning to predict Reciprocity and Triadic Closure in Social Networks. ACM Transactions on Knowledge Discovery from Data","author":"Lou Tiancheng","year":"2013","unstructured":"Tiancheng Lou , Jie Tang , John Hopcroft , Zhanpeng Fang , and Xiaowen Ding . 2013. Learning to predict Reciprocity and Triadic Closure in Social Networks. ACM Transactions on Knowledge Discovery from Data , Vol. 7 , 2 ( 2013 ), 1--25. Tiancheng Lou, Jie Tang, John Hopcroft, Zhanpeng Fang, and Xiaowen Ding. 2013. Learning to predict Reciprocity and Triadic Closure in Social Networks. ACM Transactions on Knowledge Discovery from Data, Vol. 7, 2 (2013), 1--25."},{"key":"e_1_3_2_1_22_1","volume-title":"Introduction to Information Retrieval","author":"Manning D.","unstructured":"Christopher. D. Manning , Prabhakar Raghavan , and Hinrich Schutze . 2008. Introduction to Information Retrieval . Cambridge University Press . Christopher.D. Manning, Prabhakar Raghavan, and Hinrich Schutze. 2008. Introduction to Information Retrieval. Cambridge University Press."},{"key":"e_1_3_2_1_23_1","volume-title":"Analyzing and Modeling Rank Data","author":"Marden John I.","unstructured":"John I. Marden . 1995. Analyzing and Modeling Rank Data . Chapman and Hall\/CRC. John I. Marden. 1995. Analyzing and Modeling Rank Data. Chapman and Hall\/CRC."},{"key":"e_1_3_2_1_24_1","doi-asserted-by":"publisher","DOI":"10.1177\/0272989X8900900307"},{"key":"e_1_3_2_1_25_1","unstructured":"Tomas Mikolov Kai Chen Greg Corrado and Jeffrey Dean. 2013a. Efficient Estimation of Word Representations in Vector Space. arxiv: 1301.3781 [cs.CL]  Tomas Mikolov Kai Chen Greg Corrado and Jeffrey Dean. 2013a. Efficient Estimation of Word Representations in Vector Space. arxiv: 1301.3781 [cs.CL]"},{"key":"e_1_3_2_1_26_1","volume-title":"Proceedings of the 26th International Conference on Neural Information Processing Systems, NIPS. 3111--3119","author":"Mikolov Tomas","year":"2013","unstructured":"Tomas Mikolov , Ilya Sutskever , Kai Chen , Greg Corrado , and Jeffrey Dean . 2013 b. Distributed Representations of Words and Phrases and Their Compositionality . In Proceedings of the 26th International Conference on Neural Information Processing Systems, NIPS. 3111--3119 . Tomas Mikolov, Ilya Sutskever, Kai Chen, Greg Corrado, and Jeffrey Dean. 2013b. Distributed Representations of Words and Phrases and Their Compositionality. In Proceedings of the 26th International Conference on Neural Information Processing Systems, NIPS. 3111--3119."},{"key":"e_1_3_2_1_27_1","volume-title":"Proceedings of the Advances in Neural Information Processing Systems, NeurIPS. 1396--1404","author":"Musco Cameron","year":"2015","unstructured":"Cameron Musco and Christopher Musco . 2015 . Randomized Block Krylov Methods for Stronger and Faster Approximate Singular Value Decomposition . In Proceedings of the Advances in Neural Information Processing Systems, NeurIPS. 1396--1404 . Cameron Musco and Christopher Musco. 2015. Randomized Block Krylov Methods for Stronger and Faster Approximate Singular Value Decomposition. In Proceedings of the Advances in Neural Information Processing Systems, NeurIPS. 1396--1404."},{"key":"e_1_3_2_1_28_1","doi-asserted-by":"publisher","DOI":"10.1145\/2939672.2939751"},{"key":"e_1_3_2_1_29_1","doi-asserted-by":"publisher","DOI":"10.1145\/2623330.2623732"},{"key":"e_1_3_2_1_30_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.ipm.2007.07.016"},{"key":"e_1_3_2_1_31_1","doi-asserted-by":"publisher","DOI":"10.1145\/3159652.3159706"},{"key":"e_1_3_2_1_32_1","volume-title":"Iterative Methods for Sparse Linear Systems","author":"Saad Y.","unstructured":"Y. Saad . 2003. Iterative Methods for Sparse Linear Systems . Society for Industrial and Applied Mathematics , Philadelphia, PA, USA . Y. Saad. 2003. Iterative Methods for Sparse Linear Systems. Society for Industrial and Applied Mathematics, Philadelphia, PA, USA."},{"key":"e_1_3_2_1_33_1","doi-asserted-by":"publisher","DOI":"10.1145\/3357384.3358023"},{"key":"e_1_3_2_1_34_1","doi-asserted-by":"publisher","DOI":"10.1609\/aaai.v33i01.3301265"},{"key":"e_1_3_2_1_35_1","doi-asserted-by":"publisher","DOI":"10.1609\/aaai.v36i8.20826"},{"key":"e_1_3_2_1_36_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICDM.2006.70"},{"key":"e_1_3_2_1_37_1","doi-asserted-by":"publisher","DOI":"10.1145\/3178876.3186120"},{"key":"e_1_3_2_1_38_1","doi-asserted-by":"publisher","DOI":"10.14778\/3447689.3447713"},{"key":"e_1_3_2_1_39_1","doi-asserted-by":"publisher","DOI":"10.1609\/aaai.v32i1.11872"},{"key":"e_1_3_2_1_40_1","volume-title":"Proceedings of the 22th International Conference on Neural Information Processing Systems, NIPS. 2098--2106","author":"Xia Fen","year":"2009","unstructured":"Fen Xia , Tie-Yan Liu , and Hang Li . 2009 . Statistical Consistency of Top-k Ranking . In Proceedings of the 22th International Conference on Neural Information Processing Systems, NIPS. 2098--2106 . Fen Xia, Tie-Yan Liu, and Hang Li. 2009. Statistical Consistency of Top-k Ranking. In Proceedings of the 22th International Conference on Neural Information Processing Systems, NIPS. 2098--2106."},{"key":"e_1_3_2_1_41_1","doi-asserted-by":"publisher","DOI":"10.1145\/1390156.1390306"},{"key":"e_1_3_2_1_42_1","doi-asserted-by":"publisher","DOI":"10.14778\/3377369.3377376"},{"key":"e_1_3_2_1_43_1","doi-asserted-by":"publisher","DOI":"10.1145\/3292500.3330860"},{"key":"e_1_3_2_1_44_1","doi-asserted-by":"publisher","DOI":"10.1145\/3488560.3498470"},{"key":"e_1_3_2_1_45_1","doi-asserted-by":"publisher","DOI":"10.1145\/3543507.3583271"},{"key":"e_1_3_2_1_46_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00778-018-0536-3"},{"key":"e_1_3_2_1_47_1","doi-asserted-by":"publisher","DOI":"10.1145\/3447548.3467296"},{"key":"e_1_3_2_1_48_1","doi-asserted-by":"publisher","DOI":"10.1145\/3466754"},{"key":"e_1_3_2_1_49_1","doi-asserted-by":"publisher","DOI":"10.1145\/3336191.3371814"},{"key":"e_1_3_2_1_50_1","volume-title":"Proceedings of the 22nd International Conference on World Wide Web, WWW Companion. 527--530","author":"Marko Bajec Lovro","year":"2013","unstructured":"Lovro ?ubelj and Marko Bajec . 2013 . Model of Complex Networks based on Citation Dynamics . In Proceedings of the 22nd International Conference on World Wide Web, WWW Companion. 527--530 . Lovro ?ubelj and Marko Bajec. 2013. Model of Complex Networks based on Citation Dynamics. In Proceedings of the 22nd International Conference on World Wide Web, WWW Companion. 527--530."}],"event":{"name":"CIKM '23: The 32nd ACM International Conference on Information and Knowledge Management","location":"Birmingham United Kingdom","acronym":"CIKM '23","sponsor":["SIGWEB ACM Special Interest Group on Hypertext, Hypermedia, and Web","SIGIR ACM Special Interest Group on Information Retrieval"]},"container-title":["Proceedings of the 32nd ACM International Conference on Information and Knowledge Management"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3583780.3614862","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3583780.3614862","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,17]],"date-time":"2025-06-17T16:36:57Z","timestamp":1750178217000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3583780.3614862"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,10,21]]},"references-count":50,"alternative-id":["10.1145\/3583780.3614862","10.1145\/3583780"],"URL":"https:\/\/doi.org\/10.1145\/3583780.3614862","relation":{},"subject":[],"published":{"date-parts":[[2023,10,21]]},"assertion":[{"value":"2023-10-21","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}