{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,13]],"date-time":"2026-04-13T05:51:16Z","timestamp":1776059476403,"version":"3.50.1"},"publisher-location":"New York, NY, USA","reference-count":38,"publisher":"ACM","license":[{"start":{"date-parts":[[2019,7,25]],"date-time":"2019-07-25T00:00:00Z","timestamp":1564012800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"DOI":"10.13039\/100010663","name":"H2020 European Research Council","doi-asserted-by":"publisher","award":["683253\/GraphInt"],"award-info":[{"award-number":["683253\/GraphInt"]}],"id":[{"id":"10.13039\/100010663","id-type":"DOI","asserted-by":"publisher"}]},{"name":"Fudan University Startup Research Grant","award":["SXH2301005"],"award-info":[{"award-number":["SXH2301005"]}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2019,7,25]]},"DOI":"10.1145\/3292500.3330951","type":"proceedings-article","created":{"date-parts":[[2019,7,26]],"date-time":"2019-07-26T13:17:26Z","timestamp":1564147046000},"page":"1162-1172","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":52,"title":["NodeSketch"],"prefix":"10.1145","author":[{"given":"Dingqi","family":"Yang","sequence":"first","affiliation":[{"name":"University of Fribourg, Fribourg, Switzerland"}]},{"given":"Paolo","family":"Rosso","sequence":"additional","affiliation":[{"name":"University of Fribourg, Fribourg, Switzerland"}]},{"given":"Bin","family":"Li","sequence":"additional","affiliation":[{"name":"Fudan University, Shanghai, China"}]},{"given":"Philippe","family":"Cudre-Mauroux","sequence":"additional","affiliation":[{"name":"University of Fribourg, Fribourg, Switzerland"}]}],"member":"320","published-online":{"date-parts":[[2019,7,25]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1088\/1367-2630\/10\/5\/053039"},{"key":"e_1_3_2_1_2_1","volume-title":"Proceedings of Compression and complexity of sequences","author":"Broder Andrei Z","year":"1997","unstructured":"Andrei Z Broder . 1997 . On the resemblance and containment of documents . In Proceedings of Compression and complexity of sequences 1997. IEEE, 21--29. Andrei Z Broder. 1997. On the resemblance and containment of documents. In Proceedings of Compression and complexity of sequences 1997. IEEE, 21--29."},{"key":"e_1_3_2_1_3_1","volume-title":"A comprehensive survey of graph embedding: problems, techniques and applications. TKDE","author":"Cai Hongyun","year":"2018","unstructured":"Hongyun Cai , Vincent W Zheng , and Kevin Chang . 2018. A comprehensive survey of graph embedding: problems, techniques and applications. TKDE ( 2018 ). Hongyun Cai, Vincent W Zheng, and Kevin Chang. 2018. A comprehensive survey of graph embedding: problems, techniques and applications. TKDE (2018)."},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1145\/2806416.2806512"},{"key":"e_1_3_2_1_5_1","volume-title":"SDM'14","author":"Chi Lianhua","unstructured":"Lianhua Chi , Bin Li , and Xingquan Zhu . 2014. Context-preserving hashing for fast text classification . In SDM'14 . SIAM , 100--108. Lianhua Chi, Bin Li, and Xingquan Zhu. 2014. Context-preserving hashing for fast text classification. In SDM'14. SIAM, 100--108."},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1145\/3047307"},{"key":"e_1_3_2_1_7_1","volume-title":"et almbox","author":"Gionis Aristides","year":"1999","unstructured":"Aristides Gionis , Piotr Indyk , Rajeev Motwani , et almbox . 1999 . Similarity search in high dimensions via hashing. In VLDB '99, Vol. 99 . 518--529. Aristides Gionis, Piotr Indyk, Rajeev Motwani, et almbox. 1999. Similarity search in high dimensions via hashing. In VLDB'99, Vol. 99. 518--529."},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1109\/CVPR.2011.5995432"},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1145\/2939672.2939754"},{"key":"e_1_3_2_1_10_1","volume-title":"Consistent weighted sampling made fast, small, and easy. arXiv preprint arXiv:1410.4266","author":"Haeupler Bernhard","year":"2014","unstructured":"Bernhard Haeupler , Mark Manasse , and Kunal Talwar . 2014. Consistent weighted sampling made fast, small, and easy. arXiv preprint arXiv:1410.4266 ( 2014 ). Bernhard Haeupler, Mark Manasse, and Kunal Talwar. 2014. Consistent weighted sampling made fast, small, and easy. arXiv preprint arXiv:1410.4266 (2014)."},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1080\/01621459.1963.10500830"},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1145\/3269206.3271777"},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICDM.2010.80"},{"key":"e_1_3_2_1_14_1","volume-title":"IJCAI'15 . 2248--2254","author":"Jiang Qing-Yuan","year":"2015","unstructured":"Qing-Yuan Jiang and Wu-Jun Li . 2015 . Scalable Graph Hashing with Feature Transformation .. In IJCAI'15 . 2248--2254 . Qing-Yuan Jiang and Wu-Jun Li. 2015. Scalable Graph Hashing with Feature Transformation.. In IJCAI'15 . 2248--2254."},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICDM.2012.101"},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1145\/2783258.2783406"},{"key":"e_1_3_2_1_17_1","volume-title":"Min-max kernels. arXiv preprint arXiv:1503.01737","author":"Ping Li.","year":"2015","unstructured":"Ping Li. 2015b. Min-max kernels. arXiv preprint arXiv:1503.01737 ( 2015 ). Ping Li. 2015b. Min-max kernels. arXiv preprint arXiv:1503.01737 (2015)."},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1145\/3219819.3220034"},{"key":"e_1_3_2_1_19_1","volume-title":"NIPS'14","author":"Liu Wei","year":"2014","unstructured":"Wei Liu , Cun Mu , Sanjiv Kumar , and Shih-Fu Chang . 2014 . Discrete graph hashing . In NIPS'14 . 3419--3427. Wei Liu, Cun Mu, Sanjiv Kumar, and Shih-Fu Chang. 2014. Discrete graph hashing. In NIPS'14. 3419--3427."},{"key":"e_1_3_2_1_21_1","unstructured":"Tomas Mikolov Ilya Sutskever Kai Chen Greg S Corrado and Jeff Dean. 2013. Distributed representations of words and phrases and their compositionality. In NIPS . 3111--3119.   Tomas Mikolov Ilya Sutskever Kai Chen Greg S Corrado and Jeff Dean. 2013. Distributed representations of words and phrases and their compositionality. In NIPS . 3111--3119."},{"key":"e_1_3_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.1145\/2939672.2939751"},{"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","doi-asserted-by":"publisher","DOI":"10.1145\/3159652.3159706"},{"key":"e_1_3_2_1_25_1","doi-asserted-by":"publisher","DOI":"10.1109\/CVPR.2015.7298598"},{"key":"e_1_3_2_1_26_1","doi-asserted-by":"publisher","DOI":"10.1145\/2736277.2741093"},{"key":"e_1_3_2_1_27_1","doi-asserted-by":"publisher","DOI":"10.1145\/1557019.1557109"},{"key":"e_1_3_2_1_28_1","doi-asserted-by":"publisher","DOI":"10.1145\/1645953.1646094"},{"key":"e_1_3_2_1_29_1","doi-asserted-by":"publisher","DOI":"10.1145\/3178876.3186120"},{"key":"e_1_3_2_1_30_1","doi-asserted-by":"publisher","DOI":"10.1145\/2939672.2939753"},{"key":"e_1_3_2_1_31_1","doi-asserted-by":"publisher","DOI":"10.1109\/TPAMI.2017.2699960"},{"key":"e_1_3_2_1_32_1","volume-title":"NIPS'09","author":"Weiss Yair","year":"2009","unstructured":"Yair Weiss , Antonio Torralba , and Rob Fergus . 2009 . Spectral hashing . In NIPS'09 . 1753--1760. Yair Weiss, Antonio Torralba, and Rob Fergus. 2009. Spectral hashing. In NIPS'09. 1753--1760."},{"key":"e_1_3_2_1_33_1","doi-asserted-by":"publisher","DOI":"10.5555\/3304889.3305058"},{"key":"e_1_3_2_1_34_1","volume-title":"IJCAI'16 . 2697--2703","author":"Yang Dingqi","year":"2016","unstructured":"Dingqi Yang , Bin Li , and Philippe Cudr\u00e9-Mauroux . 2016 . POIsketch: Semantic Place Labeling over User Activity Streams . In IJCAI'16 . 2697--2703 . Dingqi Yang, Bin Li, and Philippe Cudr\u00e9-Mauroux. 2016. POIsketch: Semantic Place Labeling over User Activity Streams. In IJCAI'16 . 2697--2703."},{"key":"e_1_3_2_1_35_1","volume-title":"HistoSketch: Fast Similarity-Preserving Sketching of Streaming Histograms with Concept Drift. In ICDM'17","author":"Yang Dingqi","year":"2017","unstructured":"Dingqi Yang , Bin Li , Laura Rettig , and Philippe Cudr\u00e9-Mauroux . 2017 . HistoSketch: Fast Similarity-Preserving Sketching of Streaming Histograms with Concept Drift. In ICDM'17 . IEEE, 545--554. Dingqi Yang, Bin Li, Laura Rettig, and Philippe Cudr\u00e9-Mauroux. 2017. HistoSketch: Fast Similarity-Preserving Sketching of Streaming Histograms with Concept Drift. In ICDM'17. IEEE, 545--554."},{"key":"e_1_3_2_1_36_1","first-page":"1","article-title":"D2HistoSketch","volume":"1","author":"Yang Dingqi","year":"2018","unstructured":"Dingqi Yang , Bin Li , Laura Rettig , and Philippe Cudr\u00e9-Mauroux . 2018 . D2HistoSketch : Discriminative and Dynamic Similarity-Preserving Sketching of Streaming Histograms. TKDE , Vol. 1 (2018), 1 -- 14 . Dingqi Yang, Bin Li, Laura Rettig, and Philippe Cudr\u00e9-Mauroux. 2018. D2HistoSketch: Discriminative and Dynamic Similarity-Preserving Sketching of Streaming Histograms. TKDE , Vol. 1 (2018), 1--14.","journal-title":"Discriminative and Dynamic Similarity-Preserving Sketching of Streaming Histograms. TKDE"},{"key":"e_1_3_2_1_37_1","doi-asserted-by":"publisher","DOI":"10.1145\/3308558.3313635"},{"key":"e_1_3_2_1_38_1","doi-asserted-by":"publisher","DOI":"10.1007\/s10115-013-0693-z"},{"key":"e_1_3_2_1_39_1","doi-asserted-by":"publisher","DOI":"10.1145\/3219819.3220052"}],"event":{"name":"KDD '19: The 25th ACM SIGKDD Conference on Knowledge Discovery and Data Mining","location":"Anchorage AK USA","acronym":"KDD '19","sponsor":["SIGMOD ACM Special Interest Group on Management of Data","SIGKDD ACM Special Interest Group on Knowledge Discovery in Data"]},"container-title":["Proceedings of the 25th ACM SIGKDD International Conference on Knowledge Discovery & Data Mining"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3292500.3330951","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3292500.3330951","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T00:26:04Z","timestamp":1750206364000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3292500.3330951"}},"subtitle":["Highly-Efficient Graph Embeddings via Recursive Sketching"],"short-title":[],"issued":{"date-parts":[[2019,7,25]]},"references-count":38,"alternative-id":["10.1145\/3292500.3330951","10.1145\/3292500"],"URL":"https:\/\/doi.org\/10.1145\/3292500.3330951","relation":{},"subject":[],"published":{"date-parts":[[2019,7,25]]},"assertion":[{"value":"2019-07-25","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}