{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,7]],"date-time":"2026-03-07T18:01:14Z","timestamp":1772906474203,"version":"3.50.1"},"publisher-location":"New York, NY, USA","reference-count":38,"publisher":"ACM","license":[{"start":{"date-parts":[[2019,11,3]],"date-time":"2019-11-03T00:00:00Z","timestamp":1572739200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"DOI":"10.13039\/100000001","name":"NSF","doi-asserted-by":"publisher","award":["IIS-1546113"],"award-info":[{"award-number":["IIS-1546113"]}],"id":[{"id":"10.13039\/100000001","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100000001","name":"NSF","doi-asserted-by":"publisher","award":["IIS-1927227"],"award-info":[{"award-number":["IIS-1927227"]}],"id":[{"id":"10.13039\/100000001","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2019,11,3]]},"DOI":"10.1145\/3357384.3357879","type":"proceedings-article","created":{"date-parts":[[2019,11,4]],"date-time":"2019-11-04T14:11:35Z","timestamp":1572876695000},"page":"399-408","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":62,"title":["Fast and Accurate Network Embeddings via Very Sparse Random Projection"],"prefix":"10.1145","author":[{"given":"Haochen","family":"Chen","sequence":"first","affiliation":[{"name":"Stony Brook University, Stony Brook, NY, USA"}]},{"given":"Syed Fahad","family":"Sultan","sequence":"additional","affiliation":[{"name":"Stony Brook University, Stony Brook, NY, USA"}]},{"given":"Yingtao","family":"Tian","sequence":"additional","affiliation":[{"name":"Stony Brook University, Stony Brook, NY, USA"}]},{"given":"Muhao","family":"Chen","sequence":"additional","affiliation":[{"name":"University of California, Los Angeles, Los Angeles, NY, USA"}]},{"given":"Steven","family":"Skiena","sequence":"additional","affiliation":[{"name":"Stony Brook University, Stony Brook, NY, USA"}]}],"member":"320","published-online":{"date-parts":[[2019,11,3]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1016\/S0022-0000(03)00025-4"},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1109\/SFFCS.1999.814637"},{"key":"e_1_3_2_1_3_1","volume-title":"Scale-free networks. Scientific american","author":"Barab\u00e1si Albert-L\u00e1szl\u00f3","year":"2003","unstructured":"Albert-L\u00e1szl\u00f3 Barab\u00e1si and Eric Bonabeau . 2003. Scale-free networks. Scientific american , Vol. 288 , 5 ( 2003 ), 60--69. Albert-L\u00e1szl\u00f3 Barab\u00e1si and Eric Bonabeau. 2003. Scale-free networks. Scientific american , Vol. 288, 5 (2003), 60--69."},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"crossref","unstructured":"Mikhail Belkin and Partha Niyogi. 2002. Laplacian eigenmaps and spectral techniques for embedding and clustering. In Advances in neural information processing systems. 585--591. Mikhail Belkin and Partha Niyogi. 2002. Laplacian eigenmaps and spectral techniques for embedding and clustering. In Advances in neural information processing systems. 585--591.","DOI":"10.7551\/mitpress\/1120.003.0080"},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1006\/jpdc.1996.0107"},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1080\/15427951.2013.865686"},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1145\/2806416.2806512"},{"key":"e_1_3_2_1_8_1","volume-title":"Jelena Kovavc evi\u0107 , and Christos Faloutsos","author":"Chen Siheng","year":"2017","unstructured":"Siheng Chen , Sufeng Niu , Leman Akoglu , Jelena Kovavc evi\u0107 , and Christos Faloutsos . 2017 . Fast, warped graph embedding: Unifying framework and one-click algorithm. arXiv preprint arXiv:1702.05764 (2017). Siheng Chen, Sufeng Niu, Leman Akoglu, Jelena Kovavc evi\u0107 , and Christos Faloutsos. 2017. Fast, warped graph embedding: Unifying framework and one-click algorithm. arXiv preprint arXiv:1702.05764 (2017)."},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1145\/2792838.2800180"},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1145\/2567948.2579244"},{"key":"e_1_3_2_1_11_1","volume-title":"d.]. Common Crawl's Web graph data","author":"Crawl Common","unstructured":"Common Crawl . [n. d.]. Common Crawl's Web graph data . http:\/\/commoncrawl.org\/2017\/05\/hostgraph-2017-feb-mar-apr-crawls\/. Accessed: 2018--12-01. Common Crawl. [n. d.]. Common Crawl's Web graph data. http:\/\/commoncrawl.org\/2017\/05\/hostgraph-2017-feb-mar-apr-crawls\/. Accessed: 2018--12-01."},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.5555\/1390681.1442794"},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1109\/WI.2005.9"},{"key":"e_1_3_2_1_15_1","volume-title":"Ferdinand Georg Frobenius, Ferdinand Georg Frobenius, and Germany Mathematician.","author":"Frobenius Georg","year":"1912","unstructured":"Georg Frobenius , Ferdinand Georg Frobenius , Ferdinand Georg Frobenius, Ferdinand Georg Frobenius, and Germany Mathematician. 1912 . \u00dcber Matrizen aus nicht negativen Elementen . (1912). Georg Frobenius, Ferdinand Georg Frobenius, Ferdinand Georg Frobenius, Ferdinand Georg Frobenius, and Germany Mathematician. 1912. \u00dcber Matrizen aus nicht negativen Elementen. (1912)."},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1145\/2939672.2939754"},{"key":"e_1_3_2_1_17_1","series-title":"SIAM review","volume-title":"Finding structure with randomness: Probabilistic algorithms for constructing approximate matrix decompositions","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 . SIAM review , Vol. 53 , 2 ( 2011 ), 217--288. Nathan Halko, Per-Gunnar Martinsson, and Joel A Tropp. 2011. Finding structure with randomness: Probabilistic algorithms for constructing approximate matrix decompositions. SIAM review , Vol. 53, 2 (2011), 217--288."},{"key":"e_1_3_2_1_18_1","volume-title":"A Comprehensive Comparison of Unsupervised Network Representation Learning Methods. arXiv preprint arXiv:1903.07902","author":"Khosla Megha","year":"2019","unstructured":"Megha Khosla , Avishek Anand , and Vinay Setty . 2019. A Comprehensive Comparison of Unsupervised Network Representation Learning Methods. arXiv preprint arXiv:1903.07902 ( 2019 ). Megha Khosla, Avishek Anand, and Vinay Setty. 2019. A Comprehensive Comparison of Unsupervised Network Representation Learning Methods. arXiv preprint arXiv:1903.07902 (2019)."},{"key":"e_1_3_2_1_19_1","unstructured":"Omer Levy and Yoav Goldberg. 2014. Neural word embedding as implicit matrix factorization. In Advances in neural information processing systems. 2177--2185. Omer Levy and Yoav Goldberg. 2014. Neural word embedding as implicit matrix factorization. In Advances in neural information processing systems. 2177--2185."},{"key":"e_1_3_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1145\/1150402.1150436"},{"key":"e_1_3_2_1_21_1","first-page":"2579","article-title":"Visualizing data using t-SNE","volume":"9","author":"van der Maaten Laurens","year":"2008","unstructured":"Laurens van der Maaten and Geoffrey Hinton . 2008 . Visualizing data using t-SNE . Journal of machine learning research , Vol. 9 , Nov (2008), 2579 -- 2605 . Laurens van der Maaten and Geoffrey Hinton. 2008. Visualizing data using t-SNE. Journal of machine learning research , Vol. 9, Nov (2008), 2579--2605.","journal-title":"Journal of machine learning research"},{"key":"e_1_3_2_1_22_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 . 2013. Efficient estimation of word representations in vector space. arXiv preprint arXiv:1301.3781 ( 2013 ). Tomas Mikolov, Kai Chen, Greg Corrado, and Jeffrey Dean. 2013. Efficient estimation of word representations in vector space. arXiv preprint arXiv:1301.3781 (2013)."},{"key":"e_1_3_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.1145\/2623330.2623732"},{"key":"e_1_3_2_1_24_1","first-page":"355","article-title":"Random-walk computation of similarities between nodes of a graph with application to collaborative recommendation","volume":"3","author":"Pirotte Alain","year":"2007","unstructured":"Alain Pirotte , Jean-Michel Renders , Marco Saerens , 2007 . Random-walk computation of similarities between nodes of a graph with application to collaborative recommendation . IEEE Transactions on Knowledge & Data Engineering 3 (2007), 355 -- 369 . Alain Pirotte, Jean-Michel Renders, Marco Saerens, et almbox. 2007. Random-walk computation of similarities between nodes of a graph with application to collaborative recommendation. IEEE Transactions on Knowledge & Data Engineering 3 (2007), 355--369.","journal-title":"IEEE Transactions on Knowledge & Data Engineering"},{"key":"e_1_3_2_1_25_1","unstructured":"Jiezhong Qiu Yuxiao Dong Hao Ma Jian Li Chi Wang and Kuansan Wang. 2019. NetSMF: Large-Scale Network Embedding as Sparse Matrix Factorization. (2019). Jiezhong Qiu Yuxiao Dong Hao Ma Jian Li Chi Wang and Kuansan Wang. 2019. NetSMF: Large-Scale Network Embedding as Sparse Matrix Factorization. (2019)."},{"key":"e_1_3_2_1_26_1","doi-asserted-by":"publisher","DOI":"10.1145\/3159652.3159706"},{"key":"e_1_3_2_1_27_1","volume-title":"Nonlinear dimensionality reduction by locally linear embedding. science","author":"Roweis Sam T","year":"2000","unstructured":"Sam T Roweis and Lawrence K Saul . 2000. Nonlinear dimensionality reduction by locally linear embedding. science , Vol. 290 , 5500 ( 2000 ), 2323--2326. Sam T Roweis and Lawrence K Saul. 2000. Nonlinear dimensionality reduction by locally linear embedding. science , Vol. 290, 5500 (2000), 2323--2326."},{"key":"e_1_3_2_1_28_1","volume-title":"Term-weighting approaches in automatic text retrieval. Information processing & management","author":"Salton Gerard","year":"1988","unstructured":"Gerard Salton and Christopher Buckley . 1988. Term-weighting approaches in automatic text retrieval. Information processing & management , Vol. 24 , 5 ( 1988 ), 513--523. Gerard Salton and Christopher Buckley. 1988. Term-weighting approaches in automatic text retrieval. Information processing & management , Vol. 24, 5 (1988), 513--523."},{"key":"e_1_3_2_1_29_1","doi-asserted-by":"publisher","DOI":"10.1145\/2783258.2783307"},{"key":"e_1_3_2_1_30_1","doi-asserted-by":"publisher","DOI":"10.1145\/2736277.2741093"},{"key":"e_1_3_2_1_31_1","doi-asserted-by":"publisher","DOI":"10.1145\/1645953.1646094"},{"key":"e_1_3_2_1_32_1","volume-title":"Vin De Silva, and John C Langford","author":"Tenenbaum Joshua B","year":"2000","unstructured":"Joshua B Tenenbaum , Vin De Silva, and John C Langford . 2000 . A global geometric framework for nonlinear dimensionality reduction. science , Vol. 290 , 5500 (2000), 2319--2323. Joshua B Tenenbaum, Vin De Silva, and John C Langford. 2000. A global geometric framework for nonlinear dimensionality reduction. science , Vol. 290, 5500 (2000), 2319--2323."},{"key":"e_1_3_2_1_33_1","doi-asserted-by":"publisher","DOI":"10.1145\/3178876.3186120"},{"key":"e_1_3_2_1_34_1","doi-asserted-by":"publisher","DOI":"10.1214\/aoms\/1177706875"},{"key":"e_1_3_2_1_35_1","volume-title":"The random projection method","author":"Vempala Santosh S","unstructured":"Santosh S Vempala . 2005. The random projection method . Vol. 65 . American Mathematical Soc . Santosh S Vempala. 2005. The random projection method . Vol. 65. American Mathematical Soc."},{"key":"e_1_3_2_1_36_1","doi-asserted-by":"publisher","DOI":"10.1145\/2939672.2939753"},{"key":"e_1_3_2_1_37_1","volume-title":"Twenty-Fourth International Joint Conference on Artificial Intelligence .","author":"Yang Cheng","year":"2015","unstructured":"Cheng Yang , Zhiyuan Liu , Deli Zhao , Maosong Sun , and Edward Chang . 2015 . Network representation learning with rich text information . In Twenty-Fourth International Joint Conference on Artificial Intelligence . Cheng Yang, Zhiyuan Liu, Deli Zhao, Maosong Sun, and Edward Chang. 2015. Network representation learning with rich text information. In Twenty-Fourth International Joint Conference on Artificial Intelligence ."},{"key":"e_1_3_2_1_38_1","volume-title":"Billion-scale Network Embedding with Iterative Random Projection. In 2018 IEEE International Conference on Data Mining (ICDM). IEEE, 787--796","author":"Zhang Ziwei","year":"2018","unstructured":"Ziwei Zhang , Peng Cui , Haoyang Li , Xiao Wang , and Wenwu Zhu . 2018 a. Billion-scale Network Embedding with Iterative Random Projection. In 2018 IEEE International Conference on Data Mining (ICDM). IEEE, 787--796 . Ziwei Zhang, Peng Cui, Haoyang Li, Xiao Wang, and Wenwu Zhu. 2018a. Billion-scale Network Embedding with Iterative Random Projection. In 2018 IEEE International Conference on Data Mining (ICDM). IEEE, 787--796."},{"key":"e_1_3_2_1_39_1","doi-asserted-by":"publisher","DOI":"10.1145\/3219819.3219969"}],"event":{"name":"CIKM '19: The 28th ACM International Conference on Information and Knowledge Management","location":"Beijing China","acronym":"CIKM '19","sponsor":["SIGWEB ACM Special Interest Group on Hypertext, Hypermedia, and Web","SIGIR ACM Special Interest Group on Information Retrieval"]},"container-title":["Proceedings of the 28th ACM International Conference on Information and Knowledge Management"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3357384.3357879","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3357384.3357879","content-type":"application\/pdf","content-version":"vor","intended-application":"syndication"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3357384.3357879","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,17]],"date-time":"2025-06-17T23:44:44Z","timestamp":1750203884000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3357384.3357879"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019,11,3]]},"references-count":38,"alternative-id":["10.1145\/3357384.3357879","10.1145\/3357384"],"URL":"https:\/\/doi.org\/10.1145\/3357384.3357879","relation":{},"subject":[],"published":{"date-parts":[[2019,11,3]]},"assertion":[{"value":"2019-11-03","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}