{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,7]],"date-time":"2025-11-07T13:39:12Z","timestamp":1762522752216,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":43,"publisher":"ACM","license":[{"start":{"date-parts":[[2022,10,17]],"date-time":"2022-10-17T00:00:00Z","timestamp":1665964800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0\/"}],"funder":[{"DOI":"10.13039\/100000002","name":"NIH (National Institutes of Health)","doi-asserted-by":"publisher","award":["R35-HL135772"],"award-info":[{"award-number":["R35-HL135772"]}],"id":[{"id":"10.13039\/100000002","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100002252","name":"NEC","doi-asserted-by":"publisher","id":[{"id":"10.13039\/100002252","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100000001","name":"NSF (National Science Foundation)","doi-asserted-by":"publisher","award":["1829071, 2106859, 2119643"],"award-info":[{"award-number":["1829071, 2106859, 2119643"]}],"id":[{"id":"10.13039\/100000001","id-type":"DOI","asserted-by":"publisher"}]},{"name":"NIBIB","award":["R01-EB027650"],"award-info":[{"award-number":["R01-EB027650"]}]},{"DOI":"10.13039\/100001451","name":"Amazon","doi-asserted-by":"publisher","id":[{"id":"10.13039\/100001451","id-type":"DOI","asserted-by":"publisher"}]},{"name":"Cisco"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2022,10,17]]},"DOI":"10.1145\/3511808.3557689","type":"proceedings-article","created":{"date-parts":[[2022,10,16]],"date-time":"2022-10-16T01:22:22Z","timestamp":1665883342000},"page":"3878-3882","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":4,"title":["Scalable Graph Representation Learning via Locality-Sensitive Hashing"],"prefix":"10.1145","author":[{"given":"Xiusi","family":"Chen","sequence":"first","affiliation":[{"name":"University of California, Los Angeles, Los Angeles, CA, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jyun-Yu","family":"Jiang","sequence":"additional","affiliation":[{"name":"Amazon Search, Palo Alto, CA, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Wei","family":"Wang","sequence":"additional","affiliation":[{"name":"University of California, Los Angeles, Los Angeles, CA, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2022,10,17]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1109\/MLSP.2016.7738886"},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"crossref","unstructured":"Moses S Charikar. 2002. Similarity estimation techniques from rounding algorithms. In STOC. ACM 380--388.  Moses S Charikar. 2002. Similarity estimation techniques from rounding algorithms. In STOC. ACM 380--388.","DOI":"10.1145\/509907.509965"},{"key":"e_1_3_2_1_3_1","unstructured":"Jie Chen Tengfei Ma and Cao Xiao. 2018. FastGCN: Fast Learning with Graph Convolutional Networks via Importance Sampling. In ICLR.  Jie Chen Tengfei Ma and Cao Xiao. 2018. FastGCN: Fast Learning with Graph Convolutional Networks via Importance Sampling. In ICLR."},{"key":"e_1_3_2_1_4_1","unstructured":"Silviu Cucerzan. 2007. Large-scale named entity disambiguation based on Wikipedia data. In EMNLP-CoNLL. 708--716.  Silviu Cucerzan. 2007. Large-scale named entity disambiguation based on Wikipedia data. In EMNLP-CoNLL. 708--716."},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"crossref","unstructured":"Ganqu Cui Jie Zhou Cheng Yang and Zhiyuan Liu. 2020. Adaptive graph encoder for attributed graph embedding. In KDD. 976--985.  Ganqu Cui Jie Zhou Cheng Yang and Zhiyuan Liu. 2020. Adaptive graph encoder for attributed graph embedding. In KDD. 976--985.","DOI":"10.1145\/3394486.3403140"},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"crossref","unstructured":"Anirban Dasgupta Ravi Kumar and Tam\u00e1s Sarl\u00f3s. 2011. Fast locality-sensitive hashing. In KDD. 1073--1081.  Anirban Dasgupta Ravi Kumar and Tam\u00e1s Sarl\u00f3s. 2011. Fast locality-sensitive hashing. In KDD. 1073--1081.","DOI":"10.1145\/2020408.2020578"},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"crossref","unstructured":"Mayur Datar Nicole Immorlica Piotr Indyk and Vahab S Mirrokni. 2004. Locality-sensitive hashing scheme based on p-stable distributions. In SCG. ACM 253--262.  Mayur Datar Nicole Immorlica Piotr Indyk and Vahab S Mirrokni. 2004. Locality-sensitive hashing scheme based on p-stable distributions. In SCG. ACM 253--262.","DOI":"10.1145\/997817.997857"},{"key":"e_1_3_2_1_8_1","volume-title":"NeurIPS","volume":"29","author":"Defferrard Micha\u00ebl","year":"2016","unstructured":"Micha\u00ebl Defferrard , Xavier Bresson , and Pierre Vandergheynst . 2016 . Convolutional neural networks on graphs with fast localized spectral filtering . NeurIPS , Vol. 29 (2016). Micha\u00ebl Defferrard, Xavier Bresson, and Pierre Vandergheynst. 2016. Convolutional neural networks on graphs with fast localized spectral filtering. NeurIPS, Vol. 29 (2016)."},{"volume-title":"ACM SIGCOMM computer communication review","author":"Faloutsos Michalis","key":"e_1_3_2_1_9_1","unstructured":"Michalis Faloutsos , Petros Faloutsos , and Christos Faloutsos . 1999. On power-law relationships of the internet topology . In ACM SIGCOMM computer communication review , Vol. 29 . ACM , 251--262. Michalis Faloutsos, Petros Faloutsos, and Christos Faloutsos. 1999. On power-law relationships of the internet topology. In ACM SIGCOMM computer communication review, Vol. 29. ACM, 251--262."},{"key":"e_1_3_2_1_10_1","volume-title":"JMLR","volume":"9","author":"Fan Rong-En","year":"2008","unstructured":"Rong-En Fan , Kai-Wei Chang , Cho-Jui Hsieh , Xiang-Rui Wang , and Chih-Jen Lin . 2008 . LIBLINEAR: A library for large linear classification . JMLR , Vol. 9 , Aug (2008), 1871--1874. Rong-En Fan, Kai-Wei Chang, Cho-Jui Hsieh, Xiang-Rui Wang, and Chih-Jen Lin. 2008. LIBLINEAR: A library for large linear classification. JMLR, Vol. 9, Aug (2008), 1871--1874."},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.24963\/ijcai.2018\/467"},{"key":"e_1_3_2_1_12_1","first-page":"518","article-title":"Similarity search in high dimensions via hashing","volume":"99","author":"Gionis Aristides","year":"1999","unstructured":"Aristides Gionis , Piotr Indyk , Rajeev Motwani , 1999 . Similarity search in high dimensions via hashing . In VLDB , Vol. 99. 518 -- 529 . Aristides Gionis, Piotr Indyk, Rajeev Motwani, et al. 1999. Similarity search in high dimensions via hashing. In VLDB, Vol. 99. 518--529.","journal-title":"VLDB"},{"volume-title":"Linear Algebra","author":"Golub Gene H","key":"e_1_3_2_1_13_1","unstructured":"Gene H Golub and Christian Reinsch . 1971. Singular value decomposition and least squares solutions . In Linear Algebra . Springer , 134--151. Gene H Golub and Christian Reinsch. 1971. Singular value decomposition and least squares solutions. In Linear Algebra. Springer, 134--151."},{"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. ACM 855--864.  Aditya Grover and Jure Leskovec. 2016. node2vec: Scalable feature learning for networks. In KDD. ACM 855--864.","DOI":"10.1145\/2939672.2939754"},{"key":"e_1_3_2_1_15_1","unstructured":"Will Hamilton Zhitao Ying and Jure Leskovec. 2017. Inductive representation learning on large graphs. In NeurIPS. 1024--1034.  Will Hamilton Zhitao Ying and Jure Leskovec. 2017. Inductive representation learning on large graphs. In NeurIPS. 1024--1034."},{"key":"e_1_3_2_1_16_1","volume-title":"Deep convolutional networks on graph-structured data. arXiv preprint arXiv:1506.05163","author":"Henaff Mikael","year":"2015","unstructured":"Mikael Henaff , Joan Bruna , and Yann LeCun . 2015. Deep convolutional networks on graph-structured data. arXiv preprint arXiv:1506.05163 ( 2015 ). Mikael Henaff, Joan Bruna, and Yann LeCun. 2015. Deep convolutional networks on graph-structured data. arXiv preprint arXiv:1506.05163 (2015)."},{"key":"e_1_3_2_1_17_1","unstructured":"Ziniu Hu Yuxiao Dong Kuansan Wang and Yizhou Sun. 2020. Heterogeneous graph transformer. In WWW. 2704--2710.  Ziniu Hu Yuxiao Dong Kuansan Wang and Yizhou Sun. 2020. Heterogeneous graph transformer. In WWW. 2704--2710."},{"volume-title":"Accelerated attributed network embedding","author":"Huang Xiao","key":"e_1_3_2_1_18_1","unstructured":"Xiao Huang , Jundong Li , and Xia Hu. 2017a. Accelerated attributed network embedding . In SDM. SIAM , 633--641. Xiao Huang, Jundong Li, and Xia Hu. 2017a. Accelerated attributed network embedding. In SDM. SIAM, 633--641."},{"key":"e_1_3_2_1_19_1","doi-asserted-by":"crossref","unstructured":"Xiao Huang Jundong Li and Xia Hu. 2017b. Label informed attributed network embedding. In WSDM. 731--739.  Xiao Huang Jundong Li and Xia Hu. 2017b. Label informed attributed network embedding. In WSDM. 731--739.","DOI":"10.1145\/3018661.3018667"},{"key":"e_1_3_2_1_20_1","unstructured":"Dongkwan Kim and Alice Oh. 2020. How to find your friendly neighborhood: Graph attention design with self-supervision. In ICLR.  Dongkwan Kim and Alice Oh. 2020. How to find your friendly neighborhood: Graph attention design with self-supervision. In ICLR."},{"key":"e_1_3_2_1_21_1","volume-title":"Semi-supervised classification with graph convolutional networks. arXiv preprint arXiv:1609.02907","author":"Kipf Thomas N","year":"2016","unstructured":"Thomas N Kipf and Max Welling . 2016. Semi-supervised classification with graph convolutional networks. arXiv preprint arXiv:1609.02907 ( 2016 ). Thomas N Kipf and Max Welling. 2016. Semi-supervised classification with graph convolutional networks. arXiv preprint arXiv:1609.02907 (2016)."},{"key":"e_1_3_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.1109\/TPAMI.2011.219"},{"key":"e_1_3_2_1_23_1","unstructured":"Quoc Le and Tomas Mikolov. 2014. Distributed representations of sentences and documents. In ICML. 1188--1196.  Quoc Le and Tomas Mikolov. 2014. Distributed representations of sentences and documents. In ICML. 1188--1196."},{"volume-title":"Mining of massive datasets","author":"Leskovec Jure","key":"e_1_3_2_1_24_1","unstructured":"Jure Leskovec , Anand Rajaraman , and Jeffrey David Ullman . 2014. Mining of massive datasets . Cambridge university press . Jure Leskovec, Anand Rajaraman, and Jeffrey David Ullman. 2014. Mining of massive datasets. Cambridge university press."},{"key":"e_1_3_2_1_25_1","unstructured":"Kar Wai Lim and Wray Buntine. 2015. Bibliographic analysis with the citation network topic model. In ACML. PMLR 142--158.  Kar Wai Lim and Wray Buntine. 2015. Bibliographic analysis with the citation network topic model. In ACML. PMLR 142--158."},{"key":"e_1_3_2_1_26_1","unstructured":"Yankai Lin Zhiyuan Liu Maosong Sun Yang Liu and Xuan Zhu. 2015. Learning Entity and Relation Embeddings for Knowledge Graph Completion. In AAAI. 2181--2187.  Yankai Lin Zhiyuan Liu Maosong Sun Yang Liu and Xuan Zhu. 2015. Learning Entity and Relation Embeddings for Knowledge Graph Completion. In AAAI. 2181--2187."},{"key":"e_1_3_2_1_27_1","volume-title":"Is Heterophily A Real Nightmare For Graph Neural Networks To Do Node Classification? arXiv preprint arXiv:2109.05641","author":"Luan Sitao","year":"2021","unstructured":"Sitao Luan , Chenqing Hua , Qincheng Lu , Jiaqi Zhu , Mingde Zhao , Shuyuan Zhang , Xiao-Wen Chang , and Doina Precup . 2021. Is Heterophily A Real Nightmare For Graph Neural Networks To Do Node Classification? arXiv preprint arXiv:2109.05641 ( 2021 ). Sitao Luan, Chenqing Hua, Qincheng Lu, Jiaqi Zhu, Mingde Zhao, Shuyuan Zhang, Xiao-Wen Chang, and Doina Precup. 2021. Is Heterophily A Real Nightmare For Graph Neural Networks To Do Node Classification? arXiv preprint arXiv:2109.05641 (2021)."},{"key":"e_1_3_2_1_28_1","unstructured":"Jiaqi Ma Bo Chang Xuefei Zhang and Qiaozhu Mei. 2021. CopulaGNN: towards integrating representational and correlational roles of graphs in graph neural networks. (2021).  Jiaqi Ma Bo Chang Xuefei Zhang and Qiaozhu Mei. 2021. CopulaGNN: towards integrating representational and correlational roles of graphs in graph neural networks. (2021)."},{"key":"e_1_3_2_1_29_1","volume-title":"Efficient estimation of word representations in vector space. arXiv preprint arXiv:1301.3781","author":"Mikolov Tomas","year":"2013","unstructured":"Tomas Mikolov , Kai Chen , Greg Corrado , and Jeffrey Dean . 2013a. Efficient estimation of word representations in vector space. arXiv preprint arXiv:1301.3781 ( 2013 ). Tomas Mikolov, Kai Chen, Greg Corrado, and Jeffrey Dean. 2013a. Efficient estimation of word representations in vector space. arXiv preprint arXiv:1301.3781 (2013)."},{"key":"e_1_3_2_1_30_1","unstructured":"Tomas Mikolov Ilya Sutskever Kai Chen Greg S Corrado and Jeff Dean. 2013b. Distributed representations of words and phrases and their compositionality. In NeurIPS. 3111--3119.  Tomas Mikolov Ilya Sutskever Kai Chen Greg S Corrado and Jeff Dean. 2013b. Distributed representations of words and phrases and their compositionality. In NeurIPS. 3111--3119."},{"key":"e_1_3_2_1_31_1","first-page":"12","article-title":"Tri-party deep network representation","volume":"11","author":"Pan Shirui","year":"2016","unstructured":"Shirui Pan , Jia Wu , Xingquan Zhu , Chengqi Zhang , and Yang Wang . 2016 . Tri-party deep network representation . Network , Vol. 11 , 9 (2016), 12 . Shirui Pan, Jia Wu, Xingquan Zhu, Chengqi Zhang, and Yang Wang. 2016. Tri-party deep network representation. Network, Vol. 11, 9 (2016), 12.","journal-title":"Network"},{"key":"e_1_3_2_1_32_1","doi-asserted-by":"publisher","DOI":"10.1145\/2623330.2623732"},{"key":"e_1_3_2_1_33_1","volume-title":"Gmnn: Graph markov neural networks. In ICML. PMLR, 5241--5250.","author":"Qu Meng","year":"2019","unstructured":"Meng Qu , Yoshua Bengio , and Jian Tang . 2019 . Gmnn: Graph markov neural networks. In ICML. PMLR, 5241--5250. Meng Qu, Yoshua Bengio, and Jian Tang. 2019. Gmnn: Graph markov neural networks. In ICML. PMLR, 5241--5250."},{"key":"e_1_3_2_1_34_1","unstructured":"Meng Qu Huiyu Cai and Jian Tang. 2022. Neural Structured Prediction for Inductive Node Classification. In ICLR.  Meng Qu Huiyu Cai and Jian Tang. 2022. Neural Structured Prediction for Inductive Node Classification. In ICLR."},{"key":"e_1_3_2_1_35_1","doi-asserted-by":"publisher","DOI":"10.1145\/2736277.2741093"},{"key":"e_1_3_2_1_36_1","doi-asserted-by":"crossref","unstructured":"Jie Tang Jing Zhang Limin Yao Juanzi Li Li Zhang and Zhong Su. 2008. Arnetminer: extraction and mining of academic social networks. In KDD. 990--998.  Jie Tang Jing Zhang Limin Yao Juanzi Li Li Zhang and Zhong Su. 2008. Arnetminer: extraction and mining of academic social networks. In KDD. 990--998.","DOI":"10.1145\/1401890.1402008"},{"key":"e_1_3_2_1_37_1","doi-asserted-by":"publisher","DOI":"10.1609\/aaai.v35i11.17211"},{"key":"e_1_3_2_1_38_1","doi-asserted-by":"crossref","unstructured":"Suhang Wang Charu Aggarwal Jiliang Tang and Huan Liu. 2017. Attributed signed network embedding. In CIKM. 137--146.  Suhang Wang Charu Aggarwal Jiliang Tang and Huan Liu. 2017. Attributed signed network embedding. In CIKM. 137--146.","DOI":"10.1145\/3132847.3132905"},{"key":"e_1_3_2_1_39_1","doi-asserted-by":"crossref","unstructured":"Zhen Wang Jianwen Zhang Jianlin Feng and Zheng Chen. 2014. Knowledge Graph Embedding by Translating on Hyperplanes. In AAAI. 1112--1119.  Zhen Wang Jianwen Zhang Jianlin Feng and Zheng Chen. 2014. Knowledge Graph Embedding by Translating on Hyperplanes. In AAAI. 1112--1119.","DOI":"10.1609\/aaai.v28i1.8870"},{"key":"e_1_3_2_1_40_1","unstructured":"Cheng Yang Zhiyuan Liu Deli Zhao Maosong Sun and Edward Y Chang. 2015. Network Representation Learning with Rich Text Information. In IJCAI. 2111--2117.  Cheng Yang Zhiyuan Liu Deli Zhao Maosong Sun and Edward Y Chang. 2015. Network Representation Learning with Rich Text Information. In IJCAI. 2111--2117."},{"key":"e_1_3_2_1_41_1","doi-asserted-by":"publisher","DOI":"10.1609\/aaai.v28i1.9133"},{"key":"e_1_3_2_1_42_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. 2942--2948.  Chang Zhou Yuqiong Liu Xiaofei Liu Zhongyi Liu and Jun Gao. 2017. Scalable Graph Embedding for Asymmetric Proximity. In AAAI. 2942--2948.","DOI":"10.1609\/aaai.v31i1.10878"},{"key":"e_1_3_2_1_43_1","volume-title":"NeurIPS","volume":"32","author":"Zou Difan","year":"2019","unstructured":"Difan Zou , Ziniu Hu , Yewen Wang , Song Jiang , Yizhou Sun , and Quanquan Gu . 2019 . Layer-dependent importance sampling for training deep and large graph convolutional networks . NeurIPS , Vol. 32 (2019). Difan Zou, Ziniu Hu, Yewen Wang, Song Jiang, Yizhou Sun, and Quanquan Gu. 2019. Layer-dependent importance sampling for training deep and large graph convolutional networks. NeurIPS, Vol. 32 (2019)."}],"event":{"name":"CIKM '22: The 31st ACM International Conference on Information and Knowledge Management","sponsor":["SIGWEB ACM Special Interest Group on Hypertext, Hypermedia, and Web","SIGIR ACM Special Interest Group on Information Retrieval"],"location":"Atlanta GA USA","acronym":"CIKM '22"},"container-title":["Proceedings of the 31st ACM International Conference on Information & Knowledge Management"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3511808.3557689","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3511808.3557689","content-type":"application\/pdf","content-version":"vor","intended-application":"syndication"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3511808.3557689","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,17]],"date-time":"2025-06-17T17:48:49Z","timestamp":1750182529000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3511808.3557689"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,10,17]]},"references-count":43,"alternative-id":["10.1145\/3511808.3557689","10.1145\/3511808"],"URL":"https:\/\/doi.org\/10.1145\/3511808.3557689","relation":{},"subject":[],"published":{"date-parts":[[2022,10,17]]},"assertion":[{"value":"2022-10-17","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}