{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,4]],"date-time":"2026-05-04T05:47:54Z","timestamp":1777873674002,"version":"3.51.4"},"publisher-location":"New York, NY, USA","reference-count":65,"publisher":"ACM","funder":[{"name":"Institute of Information and Communications Technology Planning and Evaluation (IITP) grant funded by the Korea Government (MSIT)","award":["No.RS-2022-00155586"],"award-info":[{"award-number":["No.RS-2022-00155586"]}]},{"name":"Institute of Information and Communications Technology Planning and Evaluation (IITP) grant funded by the Korea Government (MSIT)","award":["No.RS- 2020-II201373"],"award-info":[{"award-number":["No.RS- 2020-II201373"]}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2025,8,3]]},"DOI":"10.1145\/3711896.3737128","type":"proceedings-article","created":{"date-parts":[[2025,8,3]],"date-time":"2025-08-03T21:07:39Z","timestamp":1754255259000},"page":"2420-2431","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":0,"title":["SIGEM: A Simple yet Effective Similarity based Graph Embedding Method"],"prefix":"10.1145","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-1529-5473","authenticated-orcid":false,"given":"Masoud","family":"Reyhani Hamedani","sequence":"first","affiliation":[{"name":"Institution for Artificial Intelligence Research, Hanyang University, Seoul, Republic of Korea"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0009-0007-9918-1065","authenticated-orcid":false,"given":"Jeong-Seok","family":"Oh","sequence":"additional","affiliation":[{"name":"Department of Artificial Intelligence, Hanyang University, Seoul, Republic of Korea"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0009-0002-6367-9201","authenticated-orcid":false,"given":"Seong-Un","family":"Cho","sequence":"additional","affiliation":[{"name":"Department of Computer and Software, 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":"Department of Computer Science, Hanyang University, Seoul, Republic of Korea"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2025,8,3]]},"reference":[{"key":"e_1_3_2_2_1_1","doi-asserted-by":"publisher","DOI":"10.1016\/S0378-8733(03)00009-1"},{"key":"e_1_3_2_2_2_1","volume-title":"Proceedings of the 41st International ACM SIGIR Conference on Research and Development in Information Retrieval, SIGIR. 135-144","author":"Ai Qingyao","unstructured":"Qingyao Ai, Keping Bi, Jiafeng Guo, and W. Bruce Croft. 2018. Learning a Deep Listwise Context Model for Ranking Refinement. In Proceedings of the 41st International ACM SIGIR Conference on Research and Development in Information Retrieval, SIGIR. 135-144."},{"key":"e_1_3_2_2_3_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICCCN61486.2024.10637636"},{"key":"e_1_3_2_2_4_1","volume-title":"Proceedings of the International Conference on Learning Representations, ICLR. 1-26","author":"Brody Shaked","year":"2022","unstructured":"Shaked Brody, Uri Alon, and Eran Yahav. 2022. How Attentive Are Graph Attention Networks? In Proceedings of the International Conference on Learning Representations, ICLR. 1-26."},{"key":"e_1_3_2_2_5_1","doi-asserted-by":"publisher","DOI":"10.1145\/3442381.3449794"},{"key":"e_1_3_2_2_6_1","doi-asserted-by":"publisher","DOI":"10.1145\/1273496.1273513"},{"key":"e_1_3_2_2_7_1","doi-asserted-by":"publisher","DOI":"10.1145\/3308558.3313445"},{"key":"e_1_3_2_2_8_1","article-title":"ROLE: Rotated Lorentzian Graph Embedding Model for Asymmetric Proximity","volume":"35","author":"Feng Shanshan","year":"2023","unstructured":"Shanshan Feng, Lisi Chen, Kaiqi Zhao, Wei Wei, Xuemeng Song, Shuo Shang, Panos Kalnis, and Ling Shao. 2023. ROLE: Rotated Lorentzian Graph Embedding Model for Asymmetric Proximity. IEEE Transactions on Knowledge and Data Engineering, TKDE, Vol. 35 (September 2023), 9140-9153.","journal-title":"IEEE Transactions on Knowledge and Data Engineering, TKDE"},{"key":"e_1_3_2_2_9_1","doi-asserted-by":"publisher","DOI":"10.1609\/aaai.v37i6.25919"},{"key":"e_1_3_2_2_10_1","doi-asserted-by":"publisher","DOI":"10.1007\/s41019-023-00222-x"},{"key":"e_1_3_2_2_11_1","doi-asserted-by":"publisher","DOI":"10.5555\/3454287.3455484"},{"key":"e_1_3_2_2_12_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, 4th Edition.","edition":"4"},{"key":"e_1_3_2_2_13_1","doi-asserted-by":"publisher","DOI":"10.1145\/2939672.2939754"},{"key":"e_1_3_2_2_14_1","doi-asserted-by":"publisher","DOI":"10.1002\/jgt.22057"},{"key":"e_1_3_2_2_15_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.ins.2015.12.001"},{"key":"e_1_3_2_2_16_1","doi-asserted-by":"publisher","DOI":"10.1145\/3543507.3583193"},{"key":"e_1_3_2_2_17_1","doi-asserted-by":"publisher","DOI":"10.5555\/3294771.3294869"},{"key":"e_1_3_2_2_18_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."},{"key":"e_1_3_2_2_19_1","doi-asserted-by":"publisher","DOI":"10.1145\/1835804.1835874"},{"key":"e_1_3_2_2_20_1","doi-asserted-by":"publisher","DOI":"10.1145\/582415.582418"},{"key":"e_1_3_2_2_21_1","doi-asserted-by":"publisher","DOI":"10.1137\/S1064827595287997"},{"key":"e_1_3_2_2_22_1","doi-asserted-by":"publisher","DOI":"10.1006\/jpdc.1997.1404"},{"key":"e_1_3_2_2_23_1","volume-title":"Proceedings of the 41sh International Conference on Machine Learning, ICML. 1-19","author":"Ke Zhaoru","year":"2024","unstructured":"Zhaoru Ke, Hang Yu, Jianguo Li, and Haipeng Zhang. 2024. DUPLEX: Dual GAT for Complex Embedding of Directed Graphs. In Proceedings of the 41sh International Conference on Machine Learning, ICML. 1-19."},{"key":"e_1_3_2_2_24_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."},{"key":"e_1_3_2_2_25_1","volume-title":"Kipf and Max Welling","author":"Thomas","year":"2016","unstructured":"Thomas N. Kipf and Max Welling. 2016. Variational Graph AutoEncoders. arXiv:1611.07308 [stat.ML]"},{"key":"e_1_3_2_2_26_1","volume-title":"Proceedings of the International Conference on Learning Representations, ICLR. 1-14","author":"Thomas","unstructured":"Thomas N. Kipf and Max Welling. 2017. Semi-supervised Classification with Graph Convolutional Networks. In Proceedings of the International Conference on Learning Representations, ICLR. 1-14."},{"key":"e_1_3_2_2_27_1","volume-title":"Elementary Number Theory with Applications","author":"Koshy Thomas","unstructured":"Thomas Koshy. 2001. Elementary Number Theory with Applications. Academic Press."},{"key":"e_1_3_2_2_28_1","doi-asserted-by":"publisher","DOI":"10.1145\/2588555.2610526"},{"key":"e_1_3_2_2_29_1","doi-asserted-by":"publisher","DOI":"10.1609\/icwsm.v15i1.18067"},{"key":"e_1_3_2_2_30_1","first-page":"7","article-title":"The Link-prediction Problem for Social Networks","volume":"58","author":"Liben-Nowell David","year":"2007","unstructured":"David Liben-Nowell and Jon Kleinberg. 2007. The Link-prediction Problem for Social Networks. Journal of the American Society for Information Science and Technology, JASIST, Vol. 58, 7 (May 2007), 1-23.","journal-title":"Journal of the American Society for Information Science and Technology, JASIST"},{"key":"e_1_3_2_2_31_1","doi-asserted-by":"publisher","DOI":"10.1145\/2487575.2487623"},{"key":"e_1_3_2_2_32_1","unstructured":"Tomas Mikolov Kai Chen Greg Corrado and Jeffrey Dean. 2013. Efficient Estimation of Word Representations in Vector Space. arXiv:1301.3781 [cs.CL]"},{"key":"e_1_3_2_2_33_1","doi-asserted-by":"crossref","unstructured":"Pritish Mohapatra Michal Rolinek C.V. Jawahar Vladimir Kolmogorov and M. Pawan Kumar. 2018. Efficient Optimization for Rank-based Loss Functions. arXiv:1604.08269 [cs.CV]","DOI":"10.1109\/CVPR.2018.00389"},{"key":"e_1_3_2_2_34_1","doi-asserted-by":"crossref","unstructured":"Isaac Newton. 1687. Philosophiae Naturalis Principia Mathematica.","DOI":"10.5479\/sil.52126.39088015628399"},{"key":"e_1_3_2_2_35_1","doi-asserted-by":"publisher","DOI":"10.1145\/2348283.2348384"},{"key":"e_1_3_2_2_36_1","doi-asserted-by":"publisher","DOI":"10.1145\/2939672.2939751"},{"key":"e_1_3_2_2_37_1","doi-asserted-by":"publisher","DOI":"10.1145\/2623330.2623732"},{"key":"e_1_3_2_2_38_1","volume-title":"Proceedings of 37th International Conference on Machine Learning, ICML. 1-10","author":"Prillo Sebastian","year":"2020","unstructured":"Sebastian Prillo and Julian Martin Eisenschlos. 2020. SoftSort: A Continuous Relaxation for the argsort Operator. In Proceedings of 37th International Conference on Machine Learning, ICML. 1-10."},{"key":"e_1_3_2_2_39_1","first-page":"375","volume-title":"Information Retrieval","volume":"13","author":"Qin Tao","year":"2010","unstructured":"Tao Qin, Tie-Yan Liu, and Hang Li. 2010. A General Approximation Framework for Direct Optimization of Information Retrieval Measures. Information Retrieval, Vol. 13 (December 2010), 375-197."},{"key":"e_1_3_2_2_40_1","doi-asserted-by":"publisher","DOI":"10.1145\/3159652.3159706"},{"key":"e_1_3_2_2_41_1","doi-asserted-by":"publisher","DOI":"10.5555\/829576"},{"key":"e_1_3_2_2_42_1","doi-asserted-by":"publisher","DOI":"10.1145\/3357384.3358023"},{"key":"e_1_3_2_2_43_1","doi-asserted-by":"publisher","DOI":"10.1109\/WACV51458.2022.00364"},{"key":"e_1_3_2_2_44_1","unstructured":"Christian Szegedy Wojciech Zaremba Ilya Sutskever Joan Bruna Dumitru Erhan Ian Goodfellow and Rob Fergus. 2014. Intriguing Properties of Neural Networks. arXiv:1312.6199 [cs.CV]"},{"key":"e_1_3_2_2_45_1","doi-asserted-by":"publisher","DOI":"10.1145\/2736277.2741093"},{"key":"e_1_3_2_2_46_1","first-page":"1435","volume-title":"Proceedings of ACM Conference on Information and Knowledge Management, CIKM'20","author":"Tang Xianfeng","year":"2020","unstructured":"Xianfeng Tang, Huaxiu Yao, Yiwei Sun, Yiqi Wang, and Jiliang Tang. 2020. Investigating and Mitigating Degree-Related Biases in Graph Convolutional Networks. In Proceedings of ACM Conference on Information and Knowledge Management, CIKM'20. 1435-1444."},{"key":"e_1_3_2_2_47_1","volume-title":"Proceedings of the International Conference on Learning Representations, ICLR. 1-21","author":"Thakoor Shantanu","year":"2022","unstructured":"Shantanu Thakoor, Corentin Tallec, Mohammad Gheshlaghi Azar, Mehdi Azabou, Eva Dyer, R\u00e9mi Munos, Petar Veli\u010dkovi\u0107, and Michal Valko. 2022. Large-Scale Representation Learning on Graphs Via Bootstrapping. In Proceedings of the International Conference on Learning Representations, ICLR. 1-21."},{"key":"e_1_3_2_2_48_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICDM.2006.70"},{"key":"e_1_3_2_2_49_1","doi-asserted-by":"publisher","DOI":"10.1145\/3178876.3186120"},{"key":"e_1_3_2_2_50_1","doi-asserted-by":"publisher","DOI":"10.14778\/3447689.3447713"},{"key":"e_1_3_2_2_51_1","volume-title":"Proceedings of the International Conference on Learning Representations, ICLR. 1-12","author":"Veli\u010dkovi\u0107 Petar","year":"2018","unstructured":"Petar Veli\u010dkovi\u0107, Guillem Cucurull, Arantxa Casanova, Adriana Romero, Pietro Li\u00f2, and Yoshua Bengio. 2018. Graph Attention Networks. In Proceedings of the International Conference on Learning Representations, ICLR. 1-12."},{"key":"e_1_3_2_2_52_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."},{"key":"e_1_3_2_2_53_1","doi-asserted-by":"publisher","DOI":"10.1145\/1390156.1390306"},{"key":"e_1_3_2_2_54_1","first-page":"11831","article-title":"Revisiting Embedding Based Graph Analyses: Hyperparameters Matter! IEEE Transactions on Knowledge and Data Engineering","volume":"35","author":"Yang Dingqi","year":"2023","unstructured":"Dingqi Yang, Bingqing Qu, Rana Hussein, and Paolo Rosso. 2023. Revisiting Embedding Based Graph Analyses: Hyperparameters Matter! IEEE Transactions on Knowledge and Data Engineering, TKDE, Vol. 35, 11 (2023), 11831-11845.","journal-title":"TKDE"},{"key":"e_1_3_2_2_55_1","doi-asserted-by":"publisher","DOI":"10.1145\/3292500.3330951"},{"key":"e_1_3_2_2_56_1","volume-title":"Proceedings of the 12th IEEE International Conference on Data Mining, ICDM. 745-754","author":"Yang Jaewon","year":"2012","unstructured":"Jaewon Yang and Jure Leskovec. 2012. Defining and Evaluating Network Communities Based on Ground-Truth. In Proceedings of the 12th IEEE International Conference on Data Mining, ICDM. 745-754."},{"key":"e_1_3_2_2_57_1","doi-asserted-by":"publisher","DOI":"10.1145\/3292500.3330860"},{"key":"e_1_3_2_2_58_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00778-018-0536-3"},{"key":"e_1_3_2_2_59_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.patcog.2022.108661"},{"key":"e_1_3_2_2_60_1","doi-asserted-by":"publisher","DOI":"10.1609\/aaai.v37i4.25621"},{"key":"e_1_3_2_2_61_1","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611976700.32"},{"key":"e_1_3_2_2_62_1","doi-asserted-by":"publisher","DOI":"10.1145\/3466754"},{"key":"e_1_3_2_2_63_1","doi-asserted-by":"publisher","DOI":"10.1145\/3459637.3482168"},{"key":"e_1_3_2_2_64_1","volume-title":"Proceedings of the International Conference on Learning Representations, ICLR. 1-15","author":"Zhu Hao","year":"2021","unstructured":"Hao Zhu and Piotr Koniusz. 2021b. Simple Spectral Graph Convolution. In Proceedings of the International Conference on Learning Representations, ICLR. 1-15."},{"key":"e_1_3_2_2_65_1","unstructured":"Yanqiao Zhu Yichen Xu Feng Yu Qiang Liu Shu Wu and Liang Wang. 2020. Deep Graph Contrastive Representation Learning. arXiv:2006.04131 [cs.LG]"}],"event":{"name":"KDD '25: The 31st ACM SIGKDD Conference on Knowledge Discovery and Data Mining","location":"Toronto ON Canada","acronym":"KDD '25","sponsor":["SIGKDD ACM Special Interest Group on Knowledge Discovery in Data","SIGMOD ACM Special Interest Group on Management of Data"]},"container-title":["Proceedings of the 31st ACM SIGKDD Conference on Knowledge Discovery and Data Mining V.2"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3711896.3737128","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,4,30]],"date-time":"2026-04-30T18:10:42Z","timestamp":1777572642000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3711896.3737128"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,8,3]]},"references-count":65,"alternative-id":["10.1145\/3711896.3737128","10.1145\/3711896"],"URL":"https:\/\/doi.org\/10.1145\/3711896.3737128","relation":{},"subject":[],"published":{"date-parts":[[2025,8,3]]},"assertion":[{"value":"2025-08-03","order":3,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}