{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,23]],"date-time":"2026-01-23T11:50:25Z","timestamp":1769169025307,"version":"3.49.0"},"publisher-location":"New York, NY, USA","reference-count":49,"publisher":"ACM","funder":[{"name":"The High Performance Computing Center of Central South University"},{"name":"The Science and Technology Innovation Program of Hunan Province","award":["2022RC1105"],"award-info":[{"award-number":["2022RC1105"]}]},{"name":"Xiangjiang Laboratory","award":["No.22XJ03009,No.22XJ03004,No.22XJ03010"],"award-info":[{"award-number":["No.22XJ03009,No.22XJ03004,No.22XJ03010"]}]},{"name":"National Natural Science Foundation of China","award":["62172449,72374070,62302528"],"award-info":[{"award-number":["62172449,72374070,62302528"]}]},{"DOI":"10.13039\/501100006374","name":"Hunan Provincial Natural Science Foundation of China","doi-asserted-by":"publisher","award":["2022JJ3021,2025JJ20071"],"award-info":[{"award-number":["2022JJ3021,2025JJ20071"]}],"id":[{"id":"10.13039\/501100006374","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2025,7,13]]},"DOI":"10.1145\/3726302.3729993","type":"proceedings-article","created":{"date-parts":[[2025,7,14]],"date-time":"2025-07-14T14:55:26Z","timestamp":1752504926000},"page":"688-697","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":1,"title":["Heterogeneous Graph Embedding Made More Practical"],"prefix":"10.1145","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-7829-1539","authenticated-orcid":false,"given":"Fangfang","family":"Li","sequence":"first","affiliation":[{"name":"School of Computer Science and Engineering, Central South University, Changsha, China"}]},{"ORCID":"https:\/\/orcid.org\/0009-0005-4378-3257","authenticated-orcid":false,"given":"Huihui","family":"Zhang","sequence":"additional","affiliation":[{"name":"School of Computer Science and Engineering, Central South University, Changsha, China"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-6470-390X","authenticated-orcid":false,"given":"Wei","family":"Li","sequence":"additional","affiliation":[{"name":"School of Computer Science and Engineering, Central South University, Changsha, China"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-0975-4613","authenticated-orcid":false,"given":"Wei","family":"Wu","sequence":"additional","affiliation":[{"name":"School of Computer Science and Engineering, Central South University, Changsha, China"}]}],"member":"320","published-online":{"date-parts":[[2025,7,13]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"crossref","unstructured":"Charu Aggarwal Gewen He and Peixiang Zhao. 2016. Edge Classification in Networks. In ICDE. 1038--1049.","DOI":"10.1109\/ICDE.2016.7498311"},{"key":"e_1_3_2_1_2_1","first-page":"2987","article-title":"QUINT: Node Embedding using Network Hashing","volume":"35","author":"Bera Debajyoti","year":"2023","unstructured":"Debajyoti Bera, Rameshwar Pratap, Bhisham Dev Verma, Biswadeep Sen, and Tanmoy Chakraborty. 2023. QUINT: Node Embedding using Network Hashing. IEEE Transactions on Knowledge and Data Engineering, Vol. 35, 3 (2023), 2987--3000.","journal-title":"IEEE Transactions on Knowledge and Data Engineering"},{"key":"e_1_3_2_1_3_1","unstructured":"Cristian Bodnar Fabrizio Frasca Yuguang Wang Nina Otter Guido F Montufar Pietro Lio and Michael Bronstein. 2021. Weisfeiler and Lehman go Topological: Message Passing Simplicial Networks. In ICML. 1026--1037."},{"key":"e_1_3_2_1_4_1","first-page":"406","article-title":"The Simplex Tree","volume":"70","author":"Boissonnat Jean-Daniel","year":"2014","unstructured":"Jean-Daniel Boissonnat and Cl\u00e9ment Maria. 2014. The Simplex Tree: An Efficient Data Structure for General Simplicial Complexes. Algorithmica, Vol. 70, 3 (2014), 406--427.","journal-title":"An Efficient Data Structure for General Simplicial Complexes. Algorithmica"},{"key":"e_1_3_2_1_5_1","unstructured":"Andrei Z Broder. 1997. On the Resemblance and Containment of Documents. In Compression and Complexity of SEQUENCES. 21--29."},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"crossref","unstructured":"Andrei Z Broder Moses Charikar Alan M Frieze and Michael Mitzenmacher. 1998. Min-wise Independent Permutations. In STOC. 327--336.","DOI":"10.1145\/276698.276781"},{"key":"e_1_3_2_1_7_1","volume-title":"NODESIG: Binary Node Embeddings via Random Walk Diffusion. In ASONAM. 68--75.","author":"Celikkanat Abdulkadir","year":"2022","unstructured":"Abdulkadir Celikkanat, Fragkiskos D Malliaros, and Apostolos N Papadopoulos. 2022. NODESIG: Binary Node Embeddings via Random Walk Diffusion. In ASONAM. 68--75."},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"crossref","unstructured":"Moses S Charikar. 2002. Similarity Estimation Techniques from Rounding Algorithms. In STOC. 380--388.","DOI":"10.1145\/509907.509965"},{"key":"e_1_3_2_1_9_1","volume-title":"Quoc Viet Hung Nguyen, and Xue Li","author":"Chen Hongxu","year":"2018","unstructured":"Hongxu Chen, Hongzhi Yin, Weiqing Wang, Hao Wang, Quoc Viet Hung Nguyen, and Xue Li. 2018. PME: Projected Metric Embedding on Heterogeneous Networks for Link Prediction. In KDD. 1177--1186."},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"crossref","unstructured":"Farouk Damoun Hamida Seba Jean Hilger and Radu State. 2023. G-HIN2Vec: Distributed Heterogeneous Graph Representations for Cardholder Transactions. In SAC. 528--535.","DOI":"10.1145\/3555776.3577740"},{"key":"e_1_3_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. 135--144.","DOI":"10.1145\/3097983.3098036"},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"crossref","unstructured":"Tao-yang Fu Wang-Chien Lee and Zhen Lei. 2017. Hin2vec: Explore Meta-Paths in Heterogeneous Information Networks for Representation Learning. In CIKM. 1797--1806.","DOI":"10.1145\/3132847.3132953"},{"key":"e_1_3_2_1_13_1","volume-title":"Magnn: Metapath Aggregated Graph Neural Network for Heterogeneous Graph Embedding. In WWW. 2331--2341.","author":"Fu Xinyu","year":"2020","unstructured":"Xinyu Fu, Jiani Zhang, Ziqiao Meng, and Irwin King. 2020. Magnn: Metapath Aggregated Graph Neural Network for Heterogeneous Graph Embedding. In WWW. 2331--2341."},{"key":"e_1_3_2_1_14_1","unstructured":"Sravanthi Gurugubelli and Sundeep Prabhakar Chepuri. 2024. SaNN: Simple Yet Powerful Simplicial-aware Neural Networks. In ICLR."},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1145\/3357384.3358061"},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1080\/01621459.1963.10500830"},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"crossref","unstructured":"Rana Hussein Dingqi Yang and Philippe Cudr\u00e9-Mauroux. 2018. Are Meta-Paths Necessary? Revisiting Heterogeneous Graph Embeddings. In CIKM. 437--446.","DOI":"10.1145\/3269206.3271777"},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"crossref","unstructured":"Piotr Indyk and Rajeev Motwani. 1998. Approximate Nearest Neighbors: towards Removing the Curse of Dimensionality. In STOC. 604--613.","DOI":"10.1145\/276698.276876"},{"key":"e_1_3_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1145\/3472956"},{"key":"e_1_3_2_1_20_1","unstructured":"Nils M Kriege Matthias Fey Denis Fisseler Petra Mutzel and Frank Weichert. 2018. Recognizing Cuneiform Signs Using Graph Based Methods. In IWCL. 31--44."},{"key":"e_1_3_2_1_21_1","volume-title":"SGAT: Simplicial Graph Attention Network. In IJCAI. 3192--3200.","author":"Lee Hian","year":"2022","unstructured":"See Hian Lee, Feng Ji, and Wee Peng Tay. 2022. SGAT: Simplicial Graph Attention Network. In IJCAI. 3192--3200."},{"key":"e_1_3_2_1_22_1","doi-asserted-by":"crossref","unstructured":"Bin Li Xingquan Zhu Lianhua Chi and Chengqi Zhang. 2012. Nested Subtree Hash Kernels for Large-scale Graph Classification over Streams. In ICDM. 399--408.","DOI":"10.1109\/ICDM.2012.101"},{"key":"e_1_3_2_1_23_1","doi-asserted-by":"crossref","unstructured":"Qingqing Long Lingjun Xu Zheng Fang and Guojie Song. 2021. HGK-GNN: Heterogeneous Graph Kernel Based Graph Neural Networks. In KDD. 1129--1138.","DOI":"10.1145\/3447548.3467429"},{"key":"e_1_3_2_1_24_1","unstructured":"Kelly Maggs Celia Hacker and Bastian Rieck. 2024. Simplicial Representation Learning with Neural k-Forms. In ICLR."},{"key":"e_1_3_2_1_25_1","doi-asserted-by":"crossref","unstructured":"Emaad Manzoor Sadegh M Milajerdi and Leman Akoglu. 2016. Fast Memory-Efficient Anomaly Detection in Streaming Heterogeneous Graphs. In KDD. 1035--1044.","DOI":"10.1145\/2939672.2939783"},{"key":"e_1_3_2_1_26_1","doi-asserted-by":"publisher","DOI":"10.1109\/TPAMI.2023.3263079"},{"key":"e_1_3_2_1_27_1","volume-title":"Mentalnet: Heterogeneous Graph Representation for Early Depression Detection. In ICDM. 1113--1118.","author":"Mihov Ivan","year":"2022","unstructured":"Ivan Mihov, Haiquan Chen, Xiao Qin, Wei-Shinn Ku, Da Yan, and Yuhong Liu. 2022. Mentalnet: Heterogeneous Graph Representation for Early Depression Detection. In ICDM. 1113--1118."},{"key":"e_1_3_2_1_28_1","doi-asserted-by":"crossref","unstructured":"Christopher Morris Nils M Kriege Kristian Kersting and Petra Mutzel. 2016. Faster Kernels for Graphs with Continuous Attributes via Hashing. In ICDM. 1095--1100.","DOI":"10.1109\/ICDM.2016.0142"},{"key":"e_1_3_2_1_29_1","doi-asserted-by":"publisher","DOI":"10.1007\/s10994-015-5517-9"},{"key":"e_1_3_2_1_30_1","doi-asserted-by":"crossref","unstructured":"Shirui Pan Xingquan Zhu Chengqi Zhang and S Yu Philip. 2013. Graph Stream Classification Using Labeled and Unlabeled Graphs. In ICDE. 398--409.","DOI":"10.1109\/ICDE.2013.6544842"},{"key":"e_1_3_2_1_31_1","doi-asserted-by":"crossref","unstructured":"Yunsheng Pang Yunxiang Zhao and Dongsheng Li. 2021. Graph Pooling via Coarsened Graph Infomax. In SIGIR. 2177--2181.","DOI":"10.1145\/3404835.3463074"},{"key":"e_1_3_2_1_32_1","article-title":"Weisfeiler-Lehman Graph Kernels","volume":"12","author":"Shervashidze Nino","year":"2011","unstructured":"Nino Shervashidze, Pascal Schweitzer, Erik Jan Van Leeuwen, Kurt Mehlhorn, and Karsten M Borgwardt. 2011. Weisfeiler-Lehman Graph Kernels. Journal of Machine Learning Research, Vol. 12, 9 (2011).","journal-title":"Journal of Machine Learning Research"},{"key":"e_1_3_2_1_33_1","doi-asserted-by":"crossref","unstructured":"Xuan Tan Wei Wu and Chuan Luo. 2023. SCHash: Speedy Simplicial Complex Neural Networks via Randomized Hashing. In SIGIR. 1609--1618.","DOI":"10.1145\/3539618.3591762"},{"key":"e_1_3_2_1_34_1","doi-asserted-by":"crossref","unstructured":"Hui Tang and Xun Liang. 2023. Where to Find Fascinating Inter-Graph Supervision: Imbalanced Graph Classification with Kernel Information Bottleneck. In ACM MM. 3240--3249.","DOI":"10.1145\/3581783.3612039"},{"key":"e_1_3_2_1_35_1","doi-asserted-by":"crossref","unstructured":"Fengyi Wang Guanghui Zhu Chunfeng Yuan and Yihua Huang. 2024b. LLM-Enhanced Cascaded Multi-Level Learning on Temporal Heterogeneous Graphs. In SIGIR. 512--521.","DOI":"10.1145\/3626772.3657731"},{"key":"e_1_3_2_1_36_1","doi-asserted-by":"crossref","unstructured":"Shen Wang Zhengzhang Chen Ding Li Zhichun Li Lu-An Tang Jingchao Ni Junghwan Rhee Haifeng Chen and Philip S Yu. 2019. Attentional Heterogeneous Graph Neural Network: Application to Program Reidentification. In SDM. 693--701.","DOI":"10.1137\/1.9781611975673.78"},{"key":"e_1_3_2_1_37_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.eswa.2023.121525"},{"key":"e_1_3_2_1_38_1","doi-asserted-by":"publisher","DOI":"10.1109\/TPAMI.2023.3323624"},{"key":"e_1_3_2_1_39_1","unstructured":"Tailin Wu Hongyu Ren Pan Li and Jure Leskovec. 2020. Graph Information Bottleneck. In NeurIPS. 20437--20448."},{"key":"e_1_3_2_1_40_1","doi-asserted-by":"crossref","unstructured":"Wei Wu Bin Li Ling Chen and Chengqi Zhang. 2018a. Efficient Attributed Network Embedding via Recursive Randomized Hashing. In IJCAI. 2861--2867.","DOI":"10.24963\/ijcai.2018\/397"},{"key":"e_1_3_2_1_41_1","doi-asserted-by":"publisher","DOI":"10.1109\/TKDE.2017.2782278"},{"key":"e_1_3_2_1_42_1","doi-asserted-by":"crossref","unstructured":"Wei Wu Bin Li Chuan Luo and Wolfgang Nejdl. 2021. Hashing-Accelerated Graph Neural Networks for Link Prediction. In WWW. 2910--2920.","DOI":"10.1145\/3442381.3449884"},{"key":"e_1_3_2_1_43_1","doi-asserted-by":"publisher","DOI":"10.1109\/TCYB.2023.3243763"},{"key":"e_1_3_2_1_44_1","doi-asserted-by":"publisher","DOI":"10.1109\/TKDE.2024.3508256"},{"key":"e_1_3_2_1_45_1","doi-asserted-by":"crossref","unstructured":"Pengwei Yan Yangyang Kang Zhuoren Jiang Kaisong Song Tianqianjin Lin Changlong Sun and Xiaozhong Liu. 2024. Modeling Scholarly Collaboration and Temporal Dynamics in Citation Networks for Impact Prediction. In SIGIR. 2522--2526.","DOI":"10.1145\/3626772.3657926"},{"key":"e_1_3_2_1_46_1","doi-asserted-by":"publisher","DOI":"10.1109\/TKDE.2022.3149999"},{"key":"e_1_3_2_1_47_1","doi-asserted-by":"crossref","unstructured":"Dingqi Yang Paolo Rosso Bin Li and Philippe Cudre-Mauroux. 2019. NodeSketch: Highly-Efficient Graph Embeddings via Recursive Sketching. In KDD. 1162--1172.","DOI":"10.1145\/3292500.3330951"},{"key":"e_1_3_2_1_48_1","doi-asserted-by":"crossref","unstructured":"Qiang Yang Changsheng Ma Qiannan Zhang Xin Gao Chuxu Zhang and Xiangliang Zhang. 2023a. Counterfactual Learning on Heterogeneous Graphs with Greedy Perturbation. In KDD. 2988--2998.","DOI":"10.1145\/3580305.3599289"},{"key":"e_1_3_2_1_49_1","unstructured":"Cai Zhou Xiyuan Wang and Muhan Zhang. 2023. Facilitating Graph Neural Networks with Random Walk on Simplicial Complexes. In NeurIPS. 16172--16206."}],"event":{"name":"SIGIR '25: The 48th International ACM SIGIR Conference on Research and Development in Information Retrieval","location":"Padua Italy","acronym":"SIGIR '25","sponsor":["SIGIR ACM Special Interest Group on Information Retrieval"]},"container-title":["Proceedings of the 48th International ACM SIGIR Conference on Research and Development in Information Retrieval"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3726302.3729993","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,8,22]],"date-time":"2025-08-22T18:31:19Z","timestamp":1755887479000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3726302.3729993"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,7,13]]},"references-count":49,"alternative-id":["10.1145\/3726302.3729993","10.1145\/3726302"],"URL":"https:\/\/doi.org\/10.1145\/3726302.3729993","relation":{},"subject":[],"published":{"date-parts":[[2025,7,13]]},"assertion":[{"value":"2025-07-13","order":3,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}