{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,1]],"date-time":"2026-02-01T06:15:01Z","timestamp":1769926501051,"version":"3.49.0"},"publisher-location":"New York, NY, USA","reference-count":53,"publisher":"ACM","license":[{"start":{"date-parts":[[2024,10,21]],"date-time":"2024-10-21T00:00:00Z","timestamp":1729468800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2024,10,21]]},"DOI":"10.1145\/3627673.3679540","type":"proceedings-article","created":{"date-parts":[[2024,10,20]],"date-time":"2024-10-20T19:34:21Z","timestamp":1729452861000},"page":"1420-1429","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":1,"title":["PSNE: Efficient Spectral Sparsification Algorithms for Scaling Network Embedding"],"prefix":"10.1145","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-2194-8146","authenticated-orcid":false,"given":"Longlong","family":"Lin","sequence":"first","affiliation":[{"name":"College of Computer and Information Science, Southwest University, Chongqing, China"}]},{"ORCID":"https:\/\/orcid.org\/0009-0009-3225-3997","authenticated-orcid":false,"given":"Yunfeng","family":"Yu","sequence":"additional","affiliation":[{"name":"College of Computer and Information Science, Southwest University, Chongqing, China"}]},{"ORCID":"https:\/\/orcid.org\/0009-0002-0264-3117","authenticated-orcid":false,"given":"Zihao","family":"Wang","sequence":"additional","affiliation":[{"name":"College of Computer and Information Science, Southwest University, Chongqing, China"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-5053-5201","authenticated-orcid":false,"given":"Zeli","family":"Wang","sequence":"additional","affiliation":[{"name":"Chongqing University of Posts and Telecommunications, Chongqing, China"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-1302-6544","authenticated-orcid":false,"given":"Yuying","family":"Zhao","sequence":"additional","affiliation":[{"name":"Vanderbilt University, Nashville, USA"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-4217-7886","authenticated-orcid":false,"given":"Jin","family":"Zhao","sequence":"additional","affiliation":[{"name":"Huazhong University of Science and Technology, Wuhan, China"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-2337-2857","authenticated-orcid":false,"given":"Tao","family":"Jia","sequence":"additional","affiliation":[{"name":"College of Computer and Information Science, Southwest University, Chongqing, China"}]}],"member":"320","published-online":{"date-parts":[[2024,10,21]]},"reference":[{"key":"e_1_3_2_1_1_1","volume-title":"Alemi","author":"Abu-El-Haija Sami","year":"2018","unstructured":"Sami Abu-El-Haija, Bryan Perozzi, Rami Al-Rfou, and Alexander A. Alemi. 2018. Watch Your Step: Learning Node Embeddings via Graph Attention. In NIPS. 9198--9208."},{"key":"e_1_3_2_1_2_1","volume-title":"Aggarwal and Haixun Wang","author":"Charu","year":"2010","unstructured":"Charu C. Aggarwal and Haixun Wang. 2010. An Introduction to Graph Data. In Managing and Mining Graph Data. Vol. 40. 1--11."},{"key":"e_1_3_2_1_3_1","volume-title":"Lang","author":"Andersen Reid","year":"2006","unstructured":"Reid Andersen, Fan R. K. Chung, and Kevin J. Lang. 2006. Local Graph Partitioning using PageRank Vectors. In FOCS. 475--486."},{"key":"e_1_3_2_1_4_1","volume-title":"Proceedings of the 7th Python in Science Conference","volume":"2","author":"Schult Daniel A.","year":"2008","unstructured":"Daniel A. Schult Aric A. Hagberg and Pieter J. Swart. 2008. Exploring Network Structure, Dynamics, and Function using NetworkX. In Proceedings of the 7th Python in Science Conference, Vol. 2, 1 (2008), 11--15."},{"key":"e_1_3_2_1_5_1","volume-title":"Emergence of Scaling in Random Networks. science","author":"Barabasi Albert-Laszlo","year":"1999","unstructured":"Albert-Laszlo Barabasi and Reka Albert. 1999. Emergence of Scaling in Random Networks. science (1999)."},{"key":"e_1_3_2_1_6_1","volume-title":"On Multi-query Local Community Detection. In 2018 IEEE International Conference on Data Mining (ICDM). 9--18","author":"Bian Yuchen","year":"2018","unstructured":"Yuchen Bian, Yaowei Yan, Wei Cheng, Wei Wang, Dongsheng Luo, and Xiang Zhang. 2018. On Multi-query Local Community Detection. In 2018 IEEE International Conference on Data Mining (ICDM). 9--18."},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"crossref","unstructured":"Shaosheng Cao Wei Lu and Qiongkai Xu. 2015. GraRep: Learning Graph Representations with Global Structural Information. In CIKM. ACM 891--900.","DOI":"10.1145\/2806416.2806512"},{"key":"e_1_3_2_1_8_1","unstructured":"Shaosheng Cao Wei Lu and Qiongkai Xu. 2016. Deep neural networks for learning graph representations. In AAAI."},{"key":"e_1_3_2_1_9_1","volume-title":"Spectral Sparsification of Random-Walk Matrix Polynomials. CoRR","author":"Cheng Dehua","year":"2015","unstructured":"Dehua Cheng, Yu Cheng, Yan Liu, Richard Peng, and Shang-Hua Teng. 2015. Spectral Sparsification of Random-Walk Matrix Polynomials. CoRR, Vol. abs\/1502.03496 (2015)."},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1109\/MSP.2017.2765202"},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"crossref","unstructured":"Quanyu Dai Xiao Shen Liang Zhang Qiang Li and Dan Wang. 2019. Adversarial Training Methods for Network Embedding. In WWW. 329--339.","DOI":"10.1145\/3308558.3313445"},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1145\/3588950"},{"key":"e_1_3_2_1_13_1","first-page":"17","article-title":"On the evolution of random graphs","volume":"5","author":"Erdos Paul","year":"1960","unstructured":"Paul Erdos, Alfr\u00e9d R\u00e9nyi, et al. 1960. On the evolution of random graphs. Publ. Math. Inst. Hung. Acad. Sci, Vol. 5, 1 (1960), 17--60.","journal-title":"Publ. Math. Inst. Hung. Acad. Sci"},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"crossref","unstructured":"Aditya Grover and Jure Leskovec. 2016. node2vec: Scalable feature learning for networks. In KDD. 855--864.","DOI":"10.1145\/2939672.2939754"},{"key":"e_1_3_2_1_15_1","volume-title":"Tropp","author":"Halko Nathan","year":"2011","unstructured":"Nathan Halko, Per-Gunnar Martinsson, and Joel A. Tropp. 2011. Finding structure with randomness: Probabilistic algorithms for constructing approximate matrix decompositions. , 217--288 pages."},{"key":"e_1_3_2_1_16_1","volume-title":"Graph Representation Learning","author":"Hamilton William L.","unstructured":"William L. Hamilton. 2020. Graph Representation Learning. Morgan & Claypool Publishers."},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.eswa.2024.123915"},{"key":"e_1_3_2_1_18_1","volume-title":"Johnson","author":"Horn Roger A.","year":"1991","unstructured":"Roger A. Horn and Charles R. Johnson. 1991. Topics in Matrix Analysis."},{"key":"e_1_3_2_1_19_1","volume-title":"Anonymous Walk Embeddings. arxiv","author":"Ivanov Sergey","year":"1805","unstructured":"Sergey Ivanov and Evgeny Burnaev. 2018. Anonymous Walk Embeddings. arxiv: 1805.11921 [cs.LG]"},{"key":"e_1_3_2_1_20_1","volume-title":"Kipf and Max Welling","author":"Thomas","year":"2017","unstructured":"Thomas N. Kipf and Max Welling. 2017. Semi-Supervised Classification with Graph Convolutional Networks. In ICLR."},{"key":"e_1_3_2_1_21_1","volume-title":"PRUNE: Preserving Proximity and Global Ranking for Network Embedding. In NIPS. 5257--5266.","author":"Lai Yi-An","year":"2017","unstructured":"Yi-An Lai, Chin-Chi Hsu, Wen-Hao Chen, Mi-Yen Yeh, and Shou-De Lin. 2017. PRUNE: Preserving Proximity and Global Ranking for Network Embedding. In NIPS. 5257--5266."},{"key":"e_1_3_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.1145\/3589308"},{"key":"e_1_3_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.1145\/3589305"},{"key":"e_1_3_2_1_24_1","volume-title":"PSMC: Provable and Scalable Algorithms for Motif Conductance Based Graph Clustering. CoRR","author":"Lin Longlong","year":"2024","unstructured":"Longlong Lin, Tao Jia, Zeli Wang, Jin Zhao, and Rong-Hua Li. 2024. PSMC: Provable and Scalable Algorithms for Motif Conductance Based Graph Clustering. CoRR, Vol. abs\/2406.07357 (2024)."},{"key":"e_1_3_2_1_25_1","doi-asserted-by":"crossref","unstructured":"Longlong Lin Ronghua Li and Tao Jia. 2023. Scalable and Effective Conductance-Based Graph Clustering. In AAAI. 4471--4478.","DOI":"10.1609\/aaai.v37i4.25568"},{"key":"e_1_3_2_1_26_1","doi-asserted-by":"publisher","DOI":"10.14778\/3648160.3648163"},{"key":"e_1_3_2_1_27_1","unstructured":"Tom\u00e1s Mikolov Kai Chen Greg Corrado and Jeffrey Dean. 2013. Efficient Estimation of Word Representations in Vector Space. In ICLR."},{"key":"e_1_3_2_1_28_1","doi-asserted-by":"crossref","unstructured":"Mingdong Ou Peng Cui Jian Pei Ziwei Zhang and Wenwu Zhu. 2016. Asymmetric transitivity preserving graph embedding. In KDD. 1105--1114.","DOI":"10.1145\/2939672.2939751"},{"key":"e_1_3_2_1_29_1","doi-asserted-by":"crossref","unstructured":"Mingdong Ou Peng Cui Jian Pei Ziwei Zhang and Wenwu Zhu. 2016. Asymmetric Transitivity Preserving Graph Embedding. In KDD. 1105--1114.","DOI":"10.1145\/2939672.2939751"},{"key":"e_1_3_2_1_30_1","volume-title":"The Web Conference.","author":"Page Lawrence","year":"1999","unstructured":"Lawrence Page, Sergey Brin, Rajeev Motwani, and Terry Winograd. 1999. The PageRank Citation Ranking : Bringing Order to the Web. In The Web Conference."},{"key":"e_1_3_2_1_31_1","doi-asserted-by":"publisher","DOI":"10.1145\/2623330.2623732"},{"key":"e_1_3_2_1_32_1","volume-title":"Netsmf: Large-scale network embedding as sparse matrix factorization. In WWW. 1509--1520.","author":"Qiu Jiezhong","year":"2019","unstructured":"Jiezhong Qiu, Yuxiao Dong, Hao Ma, Jian Li, Chi Wang, Kuansan Wang, and Jie Tang. 2019. Netsmf: Large-scale network embedding as sparse matrix factorization. In WWW. 1509--1520."},{"key":"e_1_3_2_1_33_1","doi-asserted-by":"crossref","unstructured":"Jiezhong Qiu Yuxiao Dong Hao Ma Jian Li Kuansan Wang and Jie Tang. 2018. Network Embedding as Matrix Factorization: Unifying DeepWalk LINE PTE and Node2vec. In WSDM. 459--467.","DOI":"10.1145\/3159652.3159706"},{"key":"e_1_3_2_1_34_1","doi-asserted-by":"crossref","unstructured":"Daniel A. Spielman. 2007. Spectral Graph Theory and its Applications. In FOCS. 29--38.","DOI":"10.1109\/FOCS.2007.56"},{"key":"e_1_3_2_1_35_1","doi-asserted-by":"publisher","DOI":"10.1137\/080734029"},{"key":"e_1_3_2_1_36_1","doi-asserted-by":"publisher","DOI":"10.1145\/2736277.2741093"},{"key":"e_1_3_2_1_37_1","unstructured":"Mingyue Tang Pan Li and Carl Yang. 2022. Graph Auto-Encoder via Neighborhood Wasserstein Reconstruction. In ICLR."},{"key":"e_1_3_2_1_38_1","doi-asserted-by":"publisher","DOI":"10.1145\/3178876.3186120"},{"key":"e_1_3_2_1_39_1","doi-asserted-by":"publisher","DOI":"10.14778\/3447689.3447713"},{"key":"e_1_3_2_1_40_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICDE.2002.994784"},{"key":"e_1_3_2_1_41_1","doi-asserted-by":"crossref","unstructured":"Daixin Wang Peng Cui and Wenwu Zhu. 2016. Structural deep network embedding. In KDD. 1225--1234.","DOI":"10.1145\/2939672.2939753"},{"key":"e_1_3_2_1_42_1","volume-title":"GraphGAN: Graph Representation Learning with Generative Adversarial Nets. CoRR","author":"Wang Hongwei","year":"2017","unstructured":"Hongwei Wang, Jia Wang, Jialin Wang, Miao Zhao, Weinan Zhang, Fuzheng Zhang, Xing Xie, and Minyi Guo. 2017. GraphGAN: Graph Representation Learning with Generative Adversarial Nets. CoRR, Vol. abs\/1711.08267 (2017)."},{"key":"e_1_3_2_1_43_1","doi-asserted-by":"publisher","DOI":"10.1038\/30918"},{"key":"e_1_3_2_1_44_1","doi-asserted-by":"publisher","unstructured":"Yuyang Xie Yuxiao Dong Jiezhong Qiu Wenjian Yu Xu Feng and Jie Tang. 2023. SketchNE: Embedding Billion-Scale Networks Accurately in One Hour. IEEE Transactions on Knowledge and Data Engineering (2023) 1--14. https:\/\/doi.org\/10.1109\/TKDE.2023.3250703","DOI":"10.1109\/TKDE.2023.3250703"},{"key":"e_1_3_2_1_45_1","doi-asserted-by":"publisher","DOI":"10.1145\/3639278"},{"key":"e_1_3_2_1_46_1","doi-asserted-by":"publisher","DOI":"10.14778\/3377369.3377376"},{"key":"e_1_3_2_1_47_1","doi-asserted-by":"crossref","unstructured":"Yuan Yin and Zhewei Wei. 2019. Scalable graph embeddings via sparse transpose proximities. In KDD. 1429--1437.","DOI":"10.1145\/3292500.3330860"},{"key":"e_1_3_2_1_48_1","doi-asserted-by":"crossref","unstructured":"Yunfeng Yu Longlong Lin Qiyu Liu Zeli Wang Xi Ou and Tao Jia. 2024. GSD-GNN: Generalizable and Scalable Algorithms for Decoupled Graph Neural Networks. In ICMR. 64--72.","DOI":"10.1145\/3652583.3658051"},{"key":"e_1_3_2_1_49_1","doi-asserted-by":"crossref","unstructured":"Pingpeng Yuan Longlong Lin Zhijuan Kou Ling Liu and Hai Jin. 2019. Big RDF Data Storage Computation and Analysis: A Strawman's Arguments. In ICDCS. 1693--1703.","DOI":"10.1109\/ICDCS.2019.00168"},{"key":"e_1_3_2_1_50_1","doi-asserted-by":"crossref","unstructured":"Jie Zhang Yuxiao Dong Yan Wang Jie Tang and Ming Ding. 2019. ProNE: Fast and Scalable Network Representation Learning.. In IJCAI. 4278--4284.","DOI":"10.24963\/ijcai.2019\/594"},{"key":"e_1_3_2_1_51_1","doi-asserted-by":"crossref","unstructured":"Xingyi Zhang Kun Xie Sibo Wang and Zengfeng Huang. 2021. Learning Based Proximity Matrix Factorization for Node Embedding. In KDD. 2243--2253.","DOI":"10.1145\/3447548.3467296"},{"key":"e_1_3_2_1_52_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":"10.1145\/3219819.3219969"},{"key":"e_1_3_2_1_53_1","doi-asserted-by":"crossref","unstructured":"Chang Zhou Yuqiong Liu Xiaofei Liu Zhongyi Liu and Jun Gao. 2017. Scalable graph embedding for asymmetric proximity. In AAAI.","DOI":"10.1609\/aaai.v31i1.10878"}],"event":{"name":"CIKM '24: The 33rd ACM International Conference on Information and Knowledge Management","location":"Boise ID USA","acronym":"CIKM '24","sponsor":["SIGIR ACM Special Interest Group on Information Retrieval"]},"container-title":["Proceedings of the 33rd ACM International Conference on Information and Knowledge Management"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3627673.3679540","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3627673.3679540","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,19]],"date-time":"2025-06-19T00:58:22Z","timestamp":1750294702000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3627673.3679540"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,10,21]]},"references-count":53,"alternative-id":["10.1145\/3627673.3679540","10.1145\/3627673"],"URL":"https:\/\/doi.org\/10.1145\/3627673.3679540","relation":{},"subject":[],"published":{"date-parts":[[2024,10,21]]},"assertion":[{"value":"2024-10-21","order":3,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}