{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,12,20]],"date-time":"2025-12-20T22:07:59Z","timestamp":1766268479005,"version":"3.41.0"},"reference-count":19,"publisher":"Association for Computing Machinery (ACM)","issue":"1","license":[{"start":{"date-parts":[[2022,5,31]],"date-time":"2022-05-31T00:00:00Z","timestamp":1653955200000},"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":["SIGMOD Rec."],"published-print":{"date-parts":[[2022,5,31]]},"abstract":"<jats:p>Given a graph G where each node is associated with a set of attributes, attributed network embedding (ANE) maps each node v 2 G to a compact vector Xv, which can be used in downstream machine learning tasks in a variety of applications. Existing ANE solutions do not scale to massive graphs due to prohibitive computation costs or generation of low-quality embeddings. This paper proposes PANE, an effective and scalable approach to ANE computation for massive graphs in a single server that achieves state-of-the-art result quality on multiple benchmark datasets for two common prediction tasks: link prediction and node classification. Under the hood, PANE takes inspiration from well-established data management techniques to scale up ANE in a single server. Specifically, it exploits a carefully formulated problem based on a novel random walk model, a highly efficient solver, and non-trivial parallelization by utilizing modern multi-core CPUs. Extensive experiments demonstrate that PANE consistently outperforms all existing methods in terms of result quality, while being orders of magnitude faster.<\/jats:p>","DOI":"10.1145\/3542700.3542711","type":"journal-article","created":{"date-parts":[[2022,6,1]],"date-time":"2022-06-01T22:10:16Z","timestamp":1654121416000},"page":"42-49","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":3,"title":["No PANE, No Gain"],"prefix":"10.1145","volume":"51","author":[{"given":"Renchi","family":"Yang","sequence":"first","affiliation":[{"name":"National University of Singapore"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jieming","family":"Shi","sequence":"additional","affiliation":[{"name":"Hong Kong Polytechnic University"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Xiaokui","family":"Xiao","sequence":"additional","affiliation":[{"name":"National University of Singapore"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yin","family":"Yang","sequence":"additional","affiliation":[{"name":"Hamad bin Khalifa University"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Sourav S.","family":"Bhowmick","sequence":"additional","affiliation":[{"name":"Nanyang Technological University"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Juncheng","family":"Liu","sequence":"additional","affiliation":[{"name":"National University of Singapore"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2022,6]]},"reference":[{"key":"e_1_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.5555\/876875.879034"},{"key":"e_1_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1145\/3292500.3330964"},{"key":"e_1_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.ymeth.2017.05.015"},{"key":"e_1_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.5555\/89086.89095"},{"key":"e_1_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1109\/TKDE.2018.2849727"},{"key":"e_1_2_1_6_1","volume-title":"A map of human cancer signaling. Molecular systems biology, 3(1):152","author":"Cui Q.","year":"2007","unstructured":"Q. Cui , Y. Ma , M. Jaramillo , H. Bari , A. Awan , S. Yang , S. Zhang , L. Liu , M. Lu , M. O'Connor-McCourt , A map of human cancer signaling. Molecular systems biology, 3(1):152 , 2007 . Q. Cui, Y. Ma, M. Jaramillo, H. Bari, A. Awan, S. Yang, S. Zhang, L. Liu, M. Lu, M. O'Connor-McCourt, et al. A map of human cancer signaling. Molecular systems biology, 3(1):152, 2007."},{"key":"e_1_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.14778\/2140436.2140441"},{"key":"e_1_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1145\/3219819.3219988"},{"key":"e_1_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1145\/3289600.3291015"},{"key":"e_1_2_1_10_1","first-page":"1396","volume-title":"NeurIPS","author":"Musco C.","year":"2015","unstructured":"C. Musco and C. Musco . Randomized block krylov methods for stronger and faster approximate singular value decomposition . In NeurIPS , pages 1396 -- 1404 , 2015 . C. Musco and C. Musco. Randomized block krylov methods for stronger and faster approximate singular value decomposition. In NeurIPS, pages 1396--1404, 2015."},{"key":"e_1_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.5555\/3304889.3305023"},{"issue":"4","key":"e_1_2_1_12_1","first-page":"420","article-title":"The ubiquity of large graphs and surprising challenges of graph processing","volume":"11","author":"Sahu S.","year":"2017","unstructured":"S. Sahu , A. Mhedhbi , S. Salihoglu , J. Lin , and M. T. \u00a8 Ozsu . The ubiquity of large graphs and surprising challenges of graph processing . PVLDB , 11 ( 4 ): 420 -- 431 , 2017 . S. Sahu, A. Mhedhbi, S. Salihoglu, J. Lin, and M. T. \u00a8Ozsu. The ubiquity of large graphs and surprising challenges of graph processing. PVLDB, 11(4):420--431, 2017.","journal-title":"PVLDB"},{"key":"e_1_2_1_13_1","first-page":"1843","volume-title":"ICLR","author":"Velickovi\u00b4c P.","year":"2019","unstructured":"P. Velickovi\u00b4c , W. Fedus , W. L. Hamilton , P. Li'o , Y. Bengio , and R. D. Hjelm . Deep Graph Infomax . In ICLR , pages 1843 -- 1852 , 2019 . P. Velickovi\u00b4c, W. Fedus, W. L. Hamilton, P. Li'o, Y. Bengio, and R. D. Hjelm. Deep Graph Infomax. In ICLR, pages 1843--1852, 2019."},{"key":"e_1_2_1_14_1","first-page":"2111","volume-title":"IJCAI","author":"Yang C.","year":"2015","unstructured":"C. Yang , Z. Liu , D. Zhao , M. Sun , and E. Chang . Network representation learning with rich text information . In IJCAI , pages 2111 -- 2117 , 2015 . C. Yang, Z. Liu, D. Zhao, M. Sun, and E. Chang. Network representation learning with rich text information. In IJCAI, pages 2111--2117, 2015."},{"key":"e_1_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.24963\/ijcai.2019\/562"},{"key":"e_1_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICDM.2018.8626170"},{"key":"e_1_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.14778\/3377369.3377376"},{"key":"e_1_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1023\/A:1009982220290"},{"key":"e_1_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1145\/3269206.3271741"}],"container-title":["ACM SIGMOD Record"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3542700.3542711","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3542700.3542711","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,17]],"date-time":"2025-06-17T19:02:22Z","timestamp":1750186942000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3542700.3542711"}},"subtitle":["Scaling Attributed Network Embedding in a Single Server"],"short-title":[],"issued":{"date-parts":[[2022,5,31]]},"references-count":19,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2022,5,31]]}},"alternative-id":["10.1145\/3542700.3542711"],"URL":"https:\/\/doi.org\/10.1145\/3542700.3542711","relation":{},"ISSN":["0163-5808"],"issn-type":[{"type":"print","value":"0163-5808"}],"subject":[],"published":{"date-parts":[[2022,5,31]]},"assertion":[{"value":"2022-06-01","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}