{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T04:25:04Z","timestamp":1750220704751,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":68,"publisher":"ACM","license":[{"start":{"date-parts":[[2020,4,20]],"date-time":"2020-04-20T00:00:00Z","timestamp":1587340800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0\/"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2020,4,20]]},"DOI":"10.1145\/3366423.3380160","type":"proceedings-article","created":{"date-parts":[[2020,5,4]],"date-time":"2020-05-04T08:11:44Z","timestamp":1588579904000},"page":"796-807","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":4,"title":["Fast Generating A Large Number of Gumbel-Max Variables"],"prefix":"10.1145","author":[{"given":"Yiyan","family":"Qi","sequence":"first","affiliation":[{"name":"MOE Key Laboratory for Intelligent Networks and Network Security, Xi'an Jiaotong University, Xi'an, China"}]},{"given":"Pinghui","family":"Wang","sequence":"additional","affiliation":[{"name":"Shenzhen Research Institute of Xi'an Jiaotong University, Shenzhen, China and MOE Key Laboratory for Intelligent Networks and Network Security, Xi'an Jiaotong University, Xi'an, China"}]},{"given":"Yuanming","family":"Zhang","sequence":"additional","affiliation":[{"name":"MOE Key Laboratory for Intelligent Networks and Network Security, Xi'an Jiaotong University, Xi'an, China"}]},{"given":"Junzhou","family":"Zhao","sequence":"additional","affiliation":[{"name":"MOE Key Laboratory for Intelligent Networks and Network Security, Xi'an Jiaotong University, Xi'an, China"}]},{"given":"Guangjian","family":"Tian","sequence":"additional","affiliation":[{"name":"Huawei Noah's Ark Lab, Hong Kong"}]},{"given":"Xiaohong","family":"Guan","sequence":"additional","affiliation":[{"name":"Shenzhen Research Institute of Xi'an Jiaotong University, Shenzhen, China and MOE Key Laboratory for Intelligent Networks and Network Security, Xi'an Jiaotong University, Xi'an, China and Department of Automation and NLIST Lab, Tsinghua University, Beijing, China"}]}],"member":"320","published-online":{"date-parts":[[2020,4,20]]},"reference":[{"key":"e_1_3_2_1_1_1","unstructured":"[n.d.]. Variance of the maximum of n independent exponentials. https:\/\/math.stackexchange.com\/questions\/3175307\/variance-of-the-maximum-of-n-independent-exponentials.  [n.d.]. Variance of the maximum of n independent exponentials. https:\/\/math.stackexchange.com\/questions\/3175307\/variance-of-the-maximum-of-n-independent-exponentials."},{"key":"e_1_3_2_1_2_1","unstructured":"2017. Last.fm song network dataset \u2013 KONECT. http:\/\/konect.uni-koblenz.de\/networks\/lastfm_song  2017. Last.fm song network dataset \u2013 KONECT. http:\/\/konect.uni-koblenz.de\/networks\/lastfm_song"},{"key":"e_1_3_2_1_3_1","unstructured":"2017. Libimseti.cz network dataset \u2013 KONECT. http:\/\/konect.uni-koblenz.de\/networks\/libimseti  2017. Libimseti.cz network dataset \u2013 KONECT. http:\/\/konect.uni-koblenz.de\/networks\/libimseti"},{"key":"e_1_3_2_1_4_1","unstructured":"2017. MovieLens 10M network dataset \u2013 KONECT. http:\/\/konect.uni-koblenz.de\/networks\/movielens-10m_rating  2017. MovieLens 10M network dataset \u2013 KONECT. http:\/\/konect.uni-koblenz.de\/networks\/movielens-10m_rating"},{"key":"e_1_3_2_1_5_1","unstructured":"Yoram Bachrach Ely Porat and Jeffrey\u00a0S Rosenschein. 2009. Sketching techniques for collaborative filtering. In IJCAI.  Yoram Bachrach Ely Porat and Jeffrey\u00a0S Rosenschein. 2009. Sketching techniques for collaborative filtering. In IJCAI."},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1007\/s41019-019-0097-5"},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1006\/jcss.1999.1690"},{"key":"e_1_3_2_1_8_1","volume-title":"Self-similar Epochs: Value in arrangement. In ICML. 841\u2013850.","author":"Buchnik Eliav","year":"2019","unstructured":"Eliav Buchnik , Edith Cohen , Avinatan Hasidim , and Yossi Matias . 2019 . Self-similar Epochs: Value in arrangement. In ICML. 841\u2013850. Eliav Buchnik, Edith Cohen, Avinatan Hasidim, and Yossi Matias. 2019. Self-similar Epochs: Value in arrangement. In ICML. 841\u2013850."},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1145\/2806416.2806512"},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"crossref","unstructured":"Moses\u00a0S Charikar. 2002. Similarity estimation techniques from rounding algorithms. In STOC. 380\u2013388.  Moses\u00a0S Charikar. 2002. Similarity estimation techniques from rounding algorithms. In STOC. 380\u2013388.","DOI":"10.1145\/509907.509965"},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"crossref","unstructured":"Munmun\u00a0De Choudhury Yu-Ru Lin Hari Sundaram K.\u00a0Selcuk Candan Lexing Xie and Aisling Kelliher. 2010. How Does the Data Sampling Strategy Impact the Discovery of Information Diffusion in Social Media?. In ICWSM. 34\u201341.  Munmun\u00a0De Choudhury Yu-Ru Lin Hari Sundaram K.\u00a0Selcuk Candan Lexing Xie and Aisling Kelliher. 2010. How Does the Data Sampling Strategy Impact the Discovery of Information Diffusion in Social Media?. In ICWSM. 34\u201341.","DOI":"10.1609\/icwsm.v4i1.14024"},{"key":"e_1_3_2_1_12_1","volume-title":"Introduction to algorithms","author":"Cormen H.","unstructured":"Thomas\u00a0 H. Cormen , Charles\u00a0 E. Leiserson , Ronald\u00a0 L. Rivest , and Clifford Stein . 2001. Introduction to algorithms ( 2 nd ed.). Vol.\u00a06. MIT Press , Cambridge, MA. Thomas\u00a0H. Cormen, Charles\u00a0E. Leiserson, Ronald\u00a0L. Rivest, and Clifford Stein. 2001. Introduction to algorithms(2nd ed.). Vol.\u00a06. MIT Press, Cambridge, MA.","edition":"2"},{"key":"e_1_3_2_1_13_1","volume-title":"Mathias B\u00e6k\u00a0Tejs Knudsen, and Mikkel Thorup","author":"Dahlgaard S\u00f8ren","year":"2017","unstructured":"S\u00f8ren Dahlgaard , Mathias B\u00e6k\u00a0Tejs Knudsen, and Mikkel Thorup . 2017 . Fast similarity sketching. In FOCS. IEEE , 663\u2013671. S\u00f8ren Dahlgaard, Mathias B\u00e6k\u00a0Tejs Knudsen, and Mikkel Thorup. 2017. Fast similarity sketching. In FOCS. IEEE, 663\u2013671."},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1007\/s41019-019-0092-x"},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"crossref","unstructured":"Lun Du Yun Wang Guojie Song Zhicong Lu and Junshan Wang. 2018. Dynamic Network Embedding: An Extended Approach for Skip-gram based Network Embedding.. In IJCAI. 2086\u20132092.  Lun Du Yun Wang Guojie Song Zhicong Lu and Junshan Wang. 2018. Dynamic Network Embedding: An Extended Approach for Skip-gram based Network Embedding.. In IJCAI. 2086\u20132092.","DOI":"10.24963\/ijcai.2018\/288"},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"crossref","unstructured":"Otmar Ertl. 2018. Bagminhash-minwise hashing algorithm for weighted sets. In SIGKDD. ACM 1368\u20131377.  Otmar Ertl. 2018. Bagminhash-minwise hashing algorithm for weighted sets. In SIGKDD. ACM 1368\u20131377.","DOI":"10.1145\/3219819.3220089"},{"key":"e_1_3_2_1_17_1","volume-title":"Statistical tables for biological, agricultural and medical research","author":"Fisher Frank","unstructured":"Frank Fisher , Ronald A.and\u00a0 Yates . 1948. Statistical tables for biological, agricultural and medical research ( 3 rd ed.). Oliver & Boyd , London, UK . Frank Fisher, Ronald A.and\u00a0Yates. 1948. Statistical tables for biological, agricultural and medical research (3rd ed.). Oliver & Boyd, London, UK.","edition":"3"},{"key":"e_1_3_2_1_18_1","unstructured":"Aristides Gionis Piotr Indyk and Rajeev Motwani. 1999. Similarity Search in High Dimensions via Hashing. In PVLDB. 518\u2013529.  Aristides Gionis Piotr Indyk and Rajeev Motwani. 1999. Similarity Search in High Dimensions via Hashing. In PVLDB. 518\u2013529."},{"key":"e_1_3_2_1_19_1","doi-asserted-by":"crossref","unstructured":"Sreenivas Gollapudi and Rina Panigrahy. 2006. Exploiting asymmetry in hierarchical topic extraction. In CIKM. ACM 475\u2013482.  Sreenivas Gollapudi and Rina Panigrahy. 2006. Exploiting asymmetry in hierarchical topic extraction. In CIKM. ACM 475\u2013482.","DOI":"10.1145\/1183614.1183683"},{"key":"e_1_3_2_1_20_1","doi-asserted-by":"crossref","unstructured":"Aditya Grover and Jure Leskovec. 2016. node2vec: Scalable feature learning for networks. In SIGKDD. 855\u2013864.  Aditya Grover and Jure Leskovec. 2016. node2vec: Scalable feature learning for networks. In SIGKDD. 855\u2013864.","DOI":"10.1145\/2939672.2939754"},{"key":"e_1_3_2_1_21_1","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_22_1","unstructured":"Taher Haveliwala Aristides Gionis and Piotr Indyk. 2000. Scalable techniques for clustering the web. (2000).  Taher Haveliwala Aristides Gionis and Piotr Indyk. 2000. Scalable techniques for clustering the web. (2000)."},{"key":"e_1_3_2_1_23_1","doi-asserted-by":"crossref","unstructured":"Monika Henzinger. 2006. Finding near-duplicate web pages: a large-scale evaluation of algorithms. In SIGIR. ACM 284\u2013291.  Monika Henzinger. 2006. Finding near-duplicate web pages: a large-scale evaluation of algorithms. In SIGIR. ACM 284\u2013291.","DOI":"10.1145\/1148170.1148222"},{"key":"e_1_3_2_1_24_1","doi-asserted-by":"crossref","unstructured":"Sergey Ioffe. 2010. Improved Consistent Sampling Weighted Minhash and L1 Sketching. In ICDM. 246\u2013255.  Sergey Ioffe. 2010. Improved Consistent Sampling Weighted Minhash and L1 Sketching. In ICDM. 246\u2013255.","DOI":"10.1109\/ICDM.2010.80"},{"key":"e_1_3_2_1_25_1","unstructured":"Eric Jang Shixiang Gu and Ben Poole. 2016. Categorical reparameterization with gumbel-softmax. arXiv preprint arXiv:1611.01144(2016).  Eric Jang Shixiang Gu and Ben Poole. 2016. Categorical reparameterization with gumbel-softmax. arXiv preprint arXiv:1611.01144(2016)."},{"key":"e_1_3_2_1_26_1","unstructured":"Carolyn Kim Ashish Sabharwal and Stefano Ermon. 2016. Exact sampling with integer linear programs and random perturbations. In AAAI.  Carolyn Kim Ashish Sabharwal and Stefano Ermon. 2016. Exact sampling with integer linear programs and random perturbations. In AAAI."},{"key":"e_1_3_2_1_27_1","volume-title":"Semi-supervised classification with graph convolutional networks. arXiv.org","author":"Kipf N","year":"2016","unstructured":"Thomas\u00a0 N Kipf and Max Welling . 2016. Semi-supervised classification with graph convolutional networks. arXiv.org ( 2016 ). Thomas\u00a0N Kipf and Max Welling. 2016. Semi-supervised classification with graph convolutional networks. arXiv.org (2016)."},{"key":"e_1_3_2_1_28_1","unstructured":"Matt\u00a0J Kusner and Jos\u00e9\u00a0Miguel Hern\u00e1ndez-Lobato. 2016. Gans for sequences of discrete elements with the gumbel-softmax distribution. arXiv preprint arXiv:1611.04051(2016).  Matt\u00a0J Kusner and Jos\u00e9\u00a0Miguel Hern\u00e1ndez-Lobato. 2016. Gans for sequences of discrete elements with the gumbel-softmax distribution. arXiv preprint arXiv:1611.04051(2016)."},{"key":"e_1_3_2_1_29_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.ins.2019.09.083"},{"key":"e_1_3_2_1_30_1","doi-asserted-by":"publisher","DOI":"10.1145\/1217299.1217301"},{"key":"e_1_3_2_1_31_1","doi-asserted-by":"publisher","DOI":"10.5555\/1005332.1005345"},{"key":"e_1_3_2_1_32_1","unstructured":"Jundong Li Harsh Dani Xia Hu Jiliang Tang Yi Chang and Huan Liu. 2017. Attributed network embedding for learning in a dynamic environment. In CIKM. 387\u2013396.  Jundong Li Harsh Dani Xia Hu Jiliang Tang Yi Chang and Huan Liu. 2017. Attributed network embedding for learning in a dynamic environment. In CIKM. 387\u2013396."},{"key":"e_1_3_2_1_33_1","unstructured":"Juzheng Li Jun Zhu and Bo Zhang. 2016. Discriminative deep random walk for network classification. In ACL. 1004\u20131013.  Juzheng Li Jun Zhu and Bo Zhang. 2016. Discriminative deep random walk for network classification. In ACL. 1004\u20131013."},{"key":"e_1_3_2_1_34_1","unstructured":"Ping Li. 2015. 0-Bit Consistent Weighted Sampling. In SIGKDD. 665\u2013674.  Ping Li. 2015. 0-Bit Consistent Weighted Sampling. In SIGKDD. 665\u2013674."},{"key":"e_1_3_2_1_35_1","unstructured":"Ping Li and Arnd\u00a0Christian K\u00f6nig. 2010. b-Bit minwise hashing. In WWW. 671\u2013680.  Ping Li and Arnd\u00a0Christian K\u00f6nig. 2010. b-Bit minwise hashing. In WWW. 671\u2013680."},{"key":"e_1_3_2_1_36_1","unstructured":"Ping Li Art\u00a0B. Owen and Cun-Hui Zhang. 2012. One Permutation Hashing. In NIPS. 3122\u20133130.  Ping Li Art\u00a0B. Owen and Cun-Hui Zhang. 2012. One Permutation Hashing. In NIPS. 3122\u20133130."},{"key":"e_1_3_2_1_37_1","unstructured":"Guy Lorberbom Andreea Gane Tommi Jaakkola and Tamir Hazan. 2018. Direct Optimization through argmax for Discrete Variational Auto-Encoder. arXiv preprint arXiv:1806.02867(2018).  Guy Lorberbom Andreea Gane Tommi Jaakkola and Tamir Hazan. 2018. Direct Optimization through argmax for Discrete Variational Auto-Encoder. arXiv preprint arXiv:1806.02867(2018)."},{"volume-title":"Individual choice behavior: A theoretical analysis","author":"Luce R\u00a0Duncan","key":"e_1_3_2_1_38_1","unstructured":"R\u00a0Duncan Luce . 1959. Individual choice behavior: A theoretical analysis . Courier Corporation . R\u00a0Duncan Luce. 1959. Individual choice behavior: A theoretical analysis. Courier Corporation."},{"key":"e_1_3_2_1_40_1","unstructured":"Gurmeet\u00a0Singh Manku Arvind Jain and Anish Das\u00a0Sarma. 2007. Detecting near-duplicates for web crawling. In WWW. ACM 141\u2013150.  Gurmeet\u00a0Singh Manku Arvind Jain and Anish Das\u00a0Sarma. 2007. Detecting near-duplicates for web crawling. In WWW. ACM 141\u2013150."},{"key":"e_1_3_2_1_41_1","unstructured":"Tomas Mikolov Ilya Sutskever Kai Chen Greg\u00a0S Corrado and Jeff Dean. 2013. Distributed representations of words and phrases and their compositionality. In NIPS. 3111\u20133119.  Tomas Mikolov Ilya Sutskever Kai Chen Greg\u00a0S Corrado and Jeff Dean. 2013. Distributed representations of words and phrases and their compositionality. In NIPS. 3111\u20133119."},{"key":"e_1_3_2_1_42_1","doi-asserted-by":"crossref","unstructured":"Michael Mitzenmacher Rasmus Pagh and Ninh Pham. 2014. Efficient estimation for high similarities using odd sketches. In WWW. 109\u2013118.  Michael Mitzenmacher Rasmus Pagh and Ninh Pham. 2014. Efficient estimation for high similarities using odd sketches. In WWW. 109\u2013118.","DOI":"10.1145\/2566486.2568017"},{"volume-title":"Probability and Computing: Randomized Algorithms and Probabilistic Analysis. Vol.\u00a0160","author":"Mitzenmacher Michael","key":"e_1_3_2_1_43_1","unstructured":"Michael Mitzenmacher and Eli Upfal . 2005. Probability and Computing: Randomized Algorithms and Probabilistic Analysis. Vol.\u00a0160 . Cambridge University Press , New York, NY, USA . Michael Mitzenmacher and Eli Upfal. 2005. Probability and Computing: Randomized Algorithms and Probabilistic Analysis. Vol.\u00a0160. Cambridge University Press, New York, NY, USA."},{"key":"e_1_3_2_1_44_1","doi-asserted-by":"crossref","unstructured":"Ryan Moulton and Yunjiang Jiang. 2018. Maximally Consistent Sampling and the Jaccard Index of Probability Distributions. arXiv preprint arXiv:1809.04052(2018).  Ryan Moulton and Yunjiang Jiang. 2018. Maximally Consistent Sampling and the Jaccard Index of Probability Distributions. arXiv preprint arXiv:1809.04052(2018).","DOI":"10.1109\/ICDM.2018.00050"},{"key":"e_1_3_2_1_45_1","volume-title":"Continuous-Time Dynamic Network Embeddings. In Companion of the the Web Conference. 969\u2013976","author":"Nguyen Giang\u00a0Hoang","year":"2018","unstructured":"Giang\u00a0Hoang Nguyen , John\u00a0Boaz Lee , Ryan\u00a0 A Rossi , Nesreen\u00a0 K Ahmed , Eunyee Koh , and Sungchul Kim . 2018 . Continuous-Time Dynamic Network Embeddings. In Companion of the the Web Conference. 969\u2013976 . Giang\u00a0Hoang Nguyen, John\u00a0Boaz Lee, Ryan\u00a0A Rossi, Nesreen\u00a0K Ahmed, Eunyee Koh, and Sungchul Kim. 2018. Continuous-Time Dynamic Network Embeddings. In Companion of the the Web Conference. 969\u2013976."},{"key":"e_1_3_2_1_46_1","unstructured":"Michael Oberst and David Sontag. 2019. Counterfactual Off-Policy Evaluation with Gumbel-Max Structural Causal Models. arXiv preprint arXiv:1905.05824(2019).  Michael Oberst and David Sontag. 2019. Counterfactual Off-Policy Evaluation with Gumbel-Max Structural Causal Models. arXiv preprint arXiv:1905.05824(2019)."},{"key":"e_1_3_2_1_47_1","doi-asserted-by":"publisher","DOI":"10.1145\/2623330.2623732"},{"key":"e_1_3_2_1_48_1","volume-title":"Discriminative Streaming Network Embedding. KBS","author":"Qi Yiyan","year":"2019","unstructured":"Yiyan Qi , Jiefeng Cheng , Xiaojun Chen , Reynold Cheng , Albert Bifet , and Pinghui Wang . 2019. Discriminative Streaming Network Embedding. KBS ( 2019 ). Yiyan Qi, Jiefeng Cheng, Xiaojun Chen, Reynold Cheng, Albert Bifet, and Pinghui Wang. 2019. Discriminative Streaming Network Embedding. KBS (2019)."},{"key":"e_1_3_2_1_49_1","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\u2013467.  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\u2013467."},{"key":"e_1_3_2_1_50_1","unstructured":"Anshumali Shrivastava. 2017. Optimal Densification for Fast and Accurate Minwise Hashing. In ICML. 3154\u20133163.  Anshumali Shrivastava. 2017. Optimal Densification for Fast and Accurate Minwise Hashing. In ICML. 3154\u20133163."},{"key":"e_1_3_2_1_51_1","unstructured":"Anshumali Shrivastava and Ping Li. 2014. Densifying One Permutation Hashing via Rotation for Fast Near Neighbor Search. In ICML. 557\u2013565.  Anshumali Shrivastava and Ping Li. 2014. Densifying One Permutation Hashing via Rotation for Fast Near Neighbor Search. In ICML. 557\u2013565."},{"key":"e_1_3_2_1_52_1","unstructured":"Anshumali Shrivastava and Ping Li. 2014. Improved Densification of One Permutation Hashing. In UAI. 732\u2013741.  Anshumali Shrivastava and Ping Li. 2014. Improved Densification of One Permutation Hashing. In UAI. 732\u2013741."},{"volume-title":"Predicting User Roles in Social Networks using Transfer Learning with Feature Transformation","author":"Sun Jun","key":"e_1_3_2_1_53_1","unstructured":"Jun Sun , Jerome Kunegis , and Steffen Staab . 2016. Predicting User Roles in Social Networks using Transfer Learning with Feature Transformation . In ICDMW. IEEE , 128\u2013135. Jun Sun, Jerome Kunegis, and Steffen Staab. 2016. Predicting User Roles in Social Networks using Transfer Learning with Feature Transformation. In ICDMW. IEEE, 128\u2013135."},{"key":"e_1_3_2_1_54_1","doi-asserted-by":"publisher","DOI":"10.1145\/2736277.2741093"},{"key":"e_1_3_2_1_55_1","unstructured":"Lei Tang and Huan Liu. 2009. Scalable learning of collective behavior based on sparse social dimensions. (2009) 1107\u20131116.  Lei Tang and Huan Liu. 2009. Scalable learning of collective behavior based on sparse social dimensions. (2009) 1107\u20131116."},{"key":"e_1_3_2_1_56_1","doi-asserted-by":"crossref","unstructured":"Yi Tay Anh\u00a0Tuan Luu and Siu\u00a0Cheung Hui. 2018. Multi-pointer co-attention networks for recommendation. In SIGKDD. ACM 2309\u20132318.  Yi Tay Anh\u00a0Tuan Luu and Siu\u00a0Cheung Hui. 2018. Multi-pointer co-attention networks for recommendation. In SIGKDD. ACM 2309\u20132318.","DOI":"10.1145\/3219819.3220086"},{"key":"e_1_3_2_1_57_1","unstructured":"Cunchao Tu Weicheng Zhang Zhiyuan Liu and Maosong Sun. 2016. Max-margin deepwalk: discriminative learning of network representation. In IJCAI. 3889\u20133895.  Cunchao Tu Weicheng Zhang Zhiyuan Liu and Maosong Sun. 2016. Max-margin deepwalk: discriminative learning of network representation. In IJCAI. 3889\u20133895."},{"key":"e_1_3_2_1_58_1","volume-title":"Evolutionary Study of Web Spam: Webb Spam Corpus 2011 versus Webb Spam Corpus","author":"Wang De","year":"2006","unstructured":"De Wang , Danesh Irani , and Calton Pu. 2012. Evolutionary Study of Web Spam: Webb Spam Corpus 2011 versus Webb Spam Corpus 2006 . In COLLABORATECOM. De Wang, Danesh Irani, and Calton Pu. 2012. Evolutionary Study of Web Spam: Webb Spam Corpus 2011 versus Webb Spam Corpus 2006. In COLLABORATECOM."},{"key":"e_1_3_2_1_59_1","doi-asserted-by":"crossref","unstructured":"Pinghui Wang Yiyan Qi Yuanming Zhang Qiaozhu Zhai Chenxu Wang John C.\u00a0S. Lui and Xiaohong Guan. 2019. A Memory-Efficient Sketch Method for Estimating High Similarities in Streaming Sets. In SIGKDD. 25\u201333.  Pinghui Wang Yiyan Qi Yuanming Zhang Qiaozhu Zhai Chenxu Wang John C.\u00a0S. Lui and Xiaohong Guan. 2019. A Memory-Efficient Sketch Method for Estimating High Similarities in Streaming Sets. In SIGKDD. 25\u201333.","DOI":"10.1145\/3292500.3330825"},{"key":"e_1_3_2_1_60_1","doi-asserted-by":"crossref","unstructured":"Wu Wei Bin Li Chen Ling and Chengqi Zhang. 2017. Consistent Weighted Sampling Made More Practical. In WWW. 1035\u20131043.  Wu Wei Bin Li Chen Ling and Chengqi Zhang. 2017. Consistent Weighted Sampling Made More Practical. In WWW. 1035\u20131043.","DOI":"10.1145\/3038912.3052598"},{"key":"e_1_3_2_1_61_1","doi-asserted-by":"crossref","unstructured":"Wei Wu Bin Li Ling Chen and Chengqi Zhang. 2016. Canonical Consistent Weighted Sampling for Real-Value Weighted Min-Hash. In ICDM. 1287\u20131292.  Wei Wu Bin Li Ling Chen and Chengqi Zhang. 2016. Canonical Consistent Weighted Sampling for Real-Value Weighted Min-Hash. In ICDM. 1287\u20131292.","DOI":"10.1109\/ICDM.2016.0174"},{"key":"e_1_3_2_1_62_1","doi-asserted-by":"crossref","unstructured":"Wei Wu Bin Li Ling Chen and Chengqi Zhang. 2017. Consistent Weighted Sampling Made More Practical. In WWW. 1035\u20131043.  Wei Wu Bin Li Ling Chen and Chengqi Zhang. 2017. Consistent Weighted Sampling Made More Practical. In WWW. 1035\u20131043.","DOI":"10.1145\/3038912.3052598"},{"key":"e_1_3_2_1_63_1","volume-title":"Improved consistent weighted sampling revisited","author":"Wu Wei","year":"2018","unstructured":"Wei Wu , Bin Li , Ling Chen , Chengqi Zhang , and Philip Yu. 2018. Improved consistent weighted sampling revisited . IEEE TKDE ( 2018 ). Wei Wu, Bin Li, Ling Chen, Chengqi Zhang, and Philip Yu. 2018. Improved consistent weighted sampling revisited. IEEE TKDE (2018)."},{"key":"e_1_3_2_1_64_1","volume-title":"Poisketch: Semantic place labeling over user activity streams. Technical Report. Universit\u00e9 de Fribourg.","author":"Yang Dingqi","year":"2016","unstructured":"Dingqi Yang , Bin Li , and Philippe Cudr\u00e9-Mauroux . 2016 . Poisketch: Semantic place labeling over user activity streams. Technical Report. Universit\u00e9 de Fribourg. Dingqi Yang, Bin Li, and Philippe Cudr\u00e9-Mauroux. 2016. Poisketch: Semantic place labeling over user activity streams. Technical Report. Universit\u00e9 de Fribourg."},{"key":"e_1_3_2_1_65_1","volume-title":"Histosketch: Fast similarity-preserving sketching of streaming histograms with concept drift","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 IEEE ICDM. IEEE , 545\u2013554. Dingqi Yang, Bin Li, Laura Rettig, and Philippe Cudr\u00e9-Mauroux. 2017. Histosketch: Fast similarity-preserving sketching of streaming histograms with concept drift. In IEEE ICDM. IEEE, 545\u2013554."},{"key":"e_1_3_2_1_66_1","volume-title":"D2 histosketch: discriminative and dynamic similarity-preserving sketching of streaming histograms","author":"Yang Dingqi","year":"2018","unstructured":"Dingqi Yang , Bin Li , Laura Rettig , and Philippe Cudr\u00e9-Mauroux . 2018. D2 histosketch: discriminative and dynamic similarity-preserving sketching of streaming histograms . IEEE TKDE ( 2018 ), 1\u20131. Dingqi Yang, Bin Li, Laura Rettig, and Philippe Cudr\u00e9-Mauroux. 2018. D2 histosketch: discriminative and dynamic similarity-preserving sketching of streaming histograms. IEEE TKDE (2018), 1\u20131."},{"key":"e_1_3_2_1_67_1","doi-asserted-by":"crossref","unstructured":"Dingqi Yang Paolo Rosso Bin Li and Philippe Cudre-Mauroux. 2019. NodeSketch: Highly-Efficient Graph Embeddings via Recursive Sketching. In SIGKDD.  Dingqi Yang Paolo Rosso Bin Li and Philippe Cudre-Mauroux. 2019. NodeSketch: Highly-Efficient Graph Embeddings via Recursive Sketching. In SIGKDD.","DOI":"10.1145\/3292500.3330951"},{"key":"e_1_3_2_1_68_1","unstructured":"Zhilin Yang William\u00a0W Cohen and Ruslan Salakhutdinov. 2016. Revisiting semi-supervised learning with graph embeddings. In ICML. 40\u201348.  Zhilin Yang William\u00a0W Cohen and Ruslan Salakhutdinov. 2016. Revisiting semi-supervised learning with graph embeddings. In ICML. 40\u201348."},{"key":"e_1_3_2_1_69_1","unstructured":"Wenchao Yu Wei Cheng Charu\u00a0C. Aggarwal Kai Zhang Haifeng Chen and Wei Wang. 2018. NetWalk: A Flexible Deep Embedding Approach for Anomaly Detection in Dynamic Networks. In SIGKDD. 2672\u20132681.  Wenchao Yu Wei Cheng Charu\u00a0C. Aggarwal Kai Zhang Haifeng Chen and Wei Wang. 2018. NetWalk: A Flexible Deep Embedding Approach for Anomaly Detection in Dynamic Networks. In SIGKDD. 2672\u20132681."}],"event":{"name":"WWW '20: The Web Conference 2020","sponsor":["SIGWEB ACM Special Interest Group on Hypertext, Hypermedia, and Web"],"location":"Taipei Taiwan","acronym":"WWW '20"},"container-title":["Proceedings of The Web Conference 2020"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3366423.3380160","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3366423.3380160","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,17]],"date-time":"2025-06-17T22:33:00Z","timestamp":1750199580000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3366423.3380160"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020,4,20]]},"references-count":68,"alternative-id":["10.1145\/3366423.3380160","10.1145\/3366423"],"URL":"https:\/\/doi.org\/10.1145\/3366423.3380160","relation":{},"subject":[],"published":{"date-parts":[[2020,4,20]]},"assertion":[{"value":"2020-04-20","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}