{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,8,24]],"date-time":"2025-08-24T01:15:26Z","timestamp":1755998126342,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":63,"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:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"DOI":"10.13039\/100000001","name":"National Science Foundation","doi-asserted-by":"publisher","award":["2015242"],"award-info":[{"award-number":["2015242"]}],"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":[[2022,10,17]]},"DOI":"10.1145\/3511808.3557413","type":"proceedings-article","created":{"date-parts":[[2022,10,16]],"date-time":"2022-10-16T01:22:22Z","timestamp":1665883342000},"page":"1177-1187","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":3,"title":["\u2118-MinHash Algorithm for Continuous Probability Measures"],"prefix":"10.1145","author":[{"given":"Ping","family":"Li","sequence":"first","affiliation":[{"name":"LinkedIn Corporation, Bellevue, WA, USA"}]},{"given":"Xiaoyun","family":"Li","sequence":"additional","affiliation":[{"name":"Rutgers University, Piscattway, NJ, USA"}]},{"given":"Gennady","family":"Samorodnitsky","sequence":"additional","affiliation":[{"name":"Cornell University, Ithaca, NY, USA"}]}],"member":"320","published-online":{"date-parts":[[2022,10,17]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.ins.2019.01.023"},{"volume-title":"Proceedings of the Second International Conference on Web Search and Web Data Mining (WSDM)","author":"Bendersky Michael","key":"e_1_3_2_1_2_1","unstructured":"Michael Bendersky and W. Bruce Croft . 2009. Finding text reuse on the web . In Proceedings of the Second International Conference on Web Search and Web Data Mining (WSDM) . Barcelona, Spain, 262--271. Michael Bendersky and W. Bruce Croft. 2009. Finding text reuse on the web. In Proceedings of the Second International Conference on Web Search and Web Data Mining (WSDM). Barcelona, Spain, 262--271."},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1109\/TKDE.2010.172"},{"volume-title":"A guide to simulation","author":"Bratley Paul","key":"e_1_3_2_1_4_1","unstructured":"Paul Bratley , Bennet L Fox , and Linus E Schrage . 2011. A guide to simulation . Springer Science & Business Media . Paul Bratley, Bennet L Fox, and Linus E Schrage. 2011. A guide to simulation. Springer Science & Business Media."},{"key":"e_1_3_2_1_5_1","volume-title":"Proceedings of the Thirtieth Annual ACM Symposium on the Theory of Computing (STOC)","author":"Broder Andrei Z.","year":"1998","unstructured":"Andrei Z. Broder , Moses Charikar , Alan M. Frieze , and Michael Mitzenmacher . 1998 . Min-Wise Independent Permutations . In Proceedings of the Thirtieth Annual ACM Symposium on the Theory of Computing (STOC) . Dallas, TX, 327--336. Andrei Z. Broder, Moses Charikar, Alan M. Frieze, and Michael Mitzenmacher. 1998. Min-Wise Independent Permutations. In Proceedings of the Thirtieth Annual ACM Symposium on the Theory of Computing (STOC). Dallas, TX, 327--336."},{"key":"e_1_3_2_1_6_1","first-page":"8","article-title":"Syntactic Clustering of the","volume":"29","author":"Broder Andrei Z.","year":"1997","unstructured":"Andrei Z. Broder , Steven C. Glassman , Mark S. Manasse , and Geoffrey Zweig . 1997 . Syntactic Clustering of the Web. Comput. Networks , Vol. 29 , 8 -- 13 (1997), 1157--1166. Andrei Z. Broder, Steven C. Glassman, Mark S. Manasse, and Geoffrey Zweig. 1997. Syntactic Clustering of the Web. Comput. Networks, Vol. 29, 8--13 (1997), 1157--1166.","journal-title":"Web. Comput. Networks"},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1145\/1341531.1341547"},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1145\/1961189.1961199"},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1145\/509907.509965"},{"volume-title":"Proceedings of the 15th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining (KDD)","author":"Cherkasova Ludmila","key":"e_1_3_2_1_10_1","unstructured":"Ludmila Cherkasova , Kave Eshghi , Charles B. Morrey III, Joseph Tucek , and Alistair C. Veitch . 2009. Applying syntactic similarity algorithms for enterprise information management . In Proceedings of the 15th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining (KDD) . Paris, France, 1087--1096. Ludmila Cherkasova, Kave Eshghi, Charles B. Morrey III, Joseph Tucek, and Alistair C. Veitch. 2009. Applying syntactic similarity algorithms for enterprise information management. In Proceedings of the 15th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining (KDD). Paris, France, 1087--1096."},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1145\/1557019.1557049"},{"key":"e_1_3_2_1_12_1","volume-title":"Proceedings of the 25th International Conference on Computational Linguistics (COLING)","author":"Delgado Agust\u00edn D.","year":"2014","unstructured":"Agust\u00edn D. Delgado , Raquel Mart\u00ednez-Unanue , V\u00edctor Fresno-Fern\u00e1ndez , and Soto Montalvo . 2014 A Data Driven Approach for Person Name Disambiguation in Web Search Results . In Proceedings of the 25th International Conference on Computational Linguistics (COLING) . Dublin, Ireland, 301--310. Agust\u00edn D. Delgado, Raquel Mart\u00ednez-Unanue, V\u00edctor Fresno-Fern\u00e1ndez, and Soto Montalvo. 2014A Data Driven Approach for Person Name Disambiguation in Web Search Results. In Proceedings of the 25th International Conference on Computational Linguistics (COLING). Dublin, Ireland, 301--310."},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1145\/1513876.1513879"},{"key":"e_1_3_2_1_14_1","unstructured":"Dheeru Dua and Casey Graff. 2017. UCI Machine Learning Repository. http:\/\/archive.ics.uci.edu\/ml  Dheeru Dua and Casey Graff. 2017. UCI Machine Learning Repository. http:\/\/archive.ics.uci.edu\/ml"},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1145\/3219819.3220089"},{"key":"e_1_3_2_1_16_1","first-page":"3491","article-title":"ProbMinHash - A Class of Locality-Sensitive Hash Algorithms for the (Probability) Jaccard Similarity","volume":"34","author":"Ertl Otmar","year":"2022","unstructured":"Otmar Ertl . 2022 . ProbMinHash - A Class of Locality-Sensitive Hash Algorithms for the (Probability) Jaccard Similarity . IEEE Trans. Knowl. Data Eng. , Vol. 34 , 7 (2022), 3491 -- 3506 . Otmar Ertl. 2022. ProbMinHash - A Class of Locality-Sensitive Hash Algorithms for the (Probability) Jaccard Similarity. IEEE Trans. Knowl. Data Eng., Vol. 34, 7 (2022), 3491--3506.","journal-title":"IEEE Trans. Knowl. Data Eng."},{"volume-title":"Proceedings of the Twelfth International World Wide Web Conference (WWW)","author":"Fetterly Dennis","key":"e_1_3_2_1_17_1","unstructured":"Dennis Fetterly , Mark Manasse , Marc Najork , and Janet L. Wiener . 2003. A large-scale study of the evolution of web pages . In Proceedings of the Twelfth International World Wide Web Conference (WWW) . Budapest, Hungary, 669--678. Dennis Fetterly, Mark Manasse, Marc Najork, and Janet L. Wiener. 2003. A large-scale study of the evolution of web pages. In Proceedings of the Twelfth International World Wide Web Conference (WWW). Budapest, Hungary, 669--678."},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1145\/1496909.1496926"},{"key":"e_1_3_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.5555\/2750482.2750507"},{"key":"e_1_3_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1145\/3340531.3412715"},{"key":"e_1_3_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1145\/1526709.1526761"},{"key":"e_1_3_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICDM.2010.80"},{"key":"e_1_3_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.1145\/1341531.1341560"},{"key":"e_1_3_2_1_24_1","doi-asserted-by":"publisher","DOI":"10.1109\/SFFCS.1999.814572"},{"volume-title":"Proceedings of the 2020 International Conference on Management of Data (SIGMOD). Online conference [Portland, OR, USA], 2589--2599","author":"Lei Yifan","key":"e_1_3_2_1_25_1","unstructured":"Yifan Lei , Qiang Huang , Mohan S. Kankanhalli , and Anthony K. H. Tung . 2020. Locality-Sensitive Hashing Scheme based on Longest Circular Co-Substring . In Proceedings of the 2020 International Conference on Management of Data (SIGMOD). Online conference [Portland, OR, USA], 2589--2599 . Yifan Lei, Qiang Huang, Mohan S. Kankanhalli, and Anthony K. H. Tung. 2020. Locality-Sensitive Hashing Scheme based on Longest Circular Co-Substring. In Proceedings of the 2020 International Conference on Management of Data (SIGMOD). Online conference [Portland, OR, USA], 2589--2599."},{"key":"e_1_3_2_1_26_1","doi-asserted-by":"publisher","DOI":"10.1145\/2783258.2783406"},{"key":"e_1_3_2_1_27_1","doi-asserted-by":"publisher","DOI":"10.1145\/3097983.3098081"},{"key":"e_1_3_2_1_28_1","volume-title":"Tunable GMM Kernels. arXiv preprint arXiv:1701.02046","author":"Ping Li.","year":"2017","unstructured":"Ping Li. 2017b. Tunable GMM Kernels. arXiv preprint arXiv:1701.02046 ( 2017 ). Ping Li. 2017b. Tunable GMM Kernels. arXiv preprint arXiv:1701.02046 (2017)."},{"key":"e_1_3_2_1_29_1","doi-asserted-by":"publisher","DOI":"10.3115\/1220575.1220664"},{"volume-title":"Advances in Neural Information Processing Systems (NIPS).","author":"Li Ping","key":"e_1_3_2_1_30_1","unstructured":"Ping Li , Kenneth Church , and Trevor Hastie . 2006. Conditional Random Sampling: A Sketch-based Sampling Technique for Sparse Data . In Advances in Neural Information Processing Systems (NIPS). Vancouver, Canada , 873--880. Ping Li, Kenneth Church, and Trevor Hastie. 2006. Conditional Random Sampling: A Sketch-based Sampling Technique for Sparse Data. In Advances in Neural Information Processing Systems (NIPS). Vancouver, Canada, 873--880."},{"volume-title":"Advances in Neural Information Processing Systems (NIPS).","author":"Li Ping","key":"e_1_3_2_1_31_1","unstructured":"Ping Li , Kenneth Church , and Trevor Hastie . 2008. One sketch for all: Theory and Application of Conditional Random Sampling . In Advances in Neural Information Processing Systems (NIPS). Vancouver, Canada , 953--960. Ping Li, Kenneth Church, and Trevor Hastie. 2008. One sketch for all: Theory and Application of Conditional Random Sampling. In Advances in Neural Information Processing Systems (NIPS). Vancouver, Canada, 953--960."},{"key":"e_1_3_2_1_32_1","doi-asserted-by":"publisher","DOI":"10.1145\/1772690.1772759"},{"key":"e_1_3_2_1_33_1","doi-asserted-by":"publisher","DOI":"10.1145\/3442381.3449955"},{"volume-title":"Advances in Neural Information Processing Systems (NeurIPS).","author":"Li Ping","key":"e_1_3_2_1_34_1","unstructured":"Ping Li , Xiaoyun Li , and Cun-Hui Zhang . 2019. Re-randomized Densification for One Permutation Hashing and Bin-wise Consistent Weighted Sampling . In Advances in Neural Information Processing Systems (NeurIPS). Vancouver, Canada , 15900--15910. Ping Li, Xiaoyun Li, and Cun-Hui Zhang. 2019. Re-randomized Densification for One Permutation Hashing and Bin-wise Consistent Weighted Sampling. In Advances in Neural Information Processing Systems (NeurIPS). Vancouver, Canada, 15900--15910."},{"key":"e_1_3_2_1_35_1","volume-title":"Art B Owen, and Cun-Hui Zhang","author":"Li Ping","year":"2012","unstructured":"Ping Li , Art B Owen, and Cun-Hui Zhang . 2012 . One Permutation Hashing. In Advances in Neural Information Processing Systems (NIPS). Lake Tahoe, NV , 3122--3130. Ping Li, Art B Owen, and Cun-Hui Zhang. 2012. One Permutation Hashing. In Advances in Neural Information Processing Systems (NIPS). Lake Tahoe, NV, 3122--3130."},{"key":"e_1_3_2_1_36_1","unstructured":"Ping Li Anshumali Shrivastava Joshua L. Moore and Arnd Christian K\u00f6nig. 2011b. Hashing Algorithms for Large-Scale Learning. In Advances in Neural Information Processing Systems (NIPS). Granada Spain 2672--2680.  Ping Li Anshumali Shrivastava Joshua L. Moore and Arnd Christian K\u00f6nig. 2011b. Hashing Algorithms for Large-Scale Learning. In Advances in Neural Information Processing Systems (NIPS). Granada Spain 2672--2680."},{"key":"e_1_3_2_1_37_1","doi-asserted-by":"publisher","DOI":"10.1145\/3511808.3557332"},{"key":"e_1_3_2_1_38_1","volume-title":"C-OPH: Improving the Accuracy of One Permutation Hashing (OPH) with Circulant Permutations. arXiv preprint arXiv:2111.09544","author":"Li Xiaoyun","year":"2021","unstructured":"Xiaoyun Li and Ping Li. 2021a. C-OPH: Improving the Accuracy of One Permutation Hashing (OPH) with Circulant Permutations. arXiv preprint arXiv:2111.09544 ( 2021 ). Xiaoyun Li and Ping Li. 2021a. C-OPH: Improving the Accuracy of One Permutation Hashing (OPH) with Circulant Permutations. arXiv preprint arXiv:2111.09544 (2021)."},{"key":"e_1_3_2_1_39_1","doi-asserted-by":"publisher","DOI":"10.1609\/aaai.v35i5.16543"},{"key":"e_1_3_2_1_40_1","volume-title":"Proceedings of the International Conference on Machine Learning (ICML)","author":"Li Xiaoyun","year":"2022","unstructured":"Xiaoyun Li and Ping Li . 2022 . C-MinHash: Improving Minwise Hashing with Circulant Permutation . In Proceedings of the International Conference on Machine Learning (ICML) . Baltimore, MD, 12857--12887. Xiaoyun Li and Ping Li. 2022. C-MinHash: Improving Minwise Hashing with Circulant Permutation. In Proceedings of the International Conference on Machine Learning (ICML). Baltimore, MD, 12857--12887."},{"key":"e_1_3_2_1_41_1","volume-title":"Huang","author":"Li Zhen","year":"2011","unstructured":"Zhen Li , Huazhong Ning , Liangliang Cao , Tong Zhang , Yihong Gong , and Thomas S . Huang . 2011 a. Learning to Search Efficiently in High Dimensions. In Advances in Neural Information Processing Systems (NIPS). Granada, Spain . Zhen Li, Huazhong Ning, Liangliang Cao, Tong Zhang, Yihong Gong, and Thomas S. Huang. 2011a. Learning to Search Efficiently in High Dimensions. In Advances in Neural Information Processing Systems (NIPS). Granada, Spain."},{"key":"e_1_3_2_1_42_1","unstructured":"Chris J. Maddison Daniel Tarlow and Tom Minka. 2014. A* Sampling. In Advances in Neural Information Processing Systems (NIPS). Montreal Canada 3086--3094.  Chris J. Maddison Daniel Tarlow and Tom Minka. 2014. A* Sampling. In Advances in Neural Information Processing Systems (NIPS). Montreal Canada 3086--3094."},{"key":"e_1_3_2_1_44_1","doi-asserted-by":"publisher","DOI":"10.1145\/2939672.2939783"},{"key":"e_1_3_2_1_45_1","volume-title":"Proceedings of the IEEE International Conference on Data Mining (ICDM)","author":"Moulton Ryan","year":"2018","unstructured":"Ryan Moulton and Yunjiang Jiang . 2018 . Maximally Consistent Sampling and the Jaccard Index of Probability Distributions . In Proceedings of the IEEE International Conference on Data Mining (ICDM) . Singapore, 347--356. Ryan Moulton and Yunjiang Jiang. 2018. Maximally Consistent Sampling and the Jaccard Index of Probability Distributions. In Proceedings of the IEEE International Conference on Data Mining (ICDM). Singapore, 347--356."},{"key":"e_1_3_2_1_46_1","doi-asserted-by":"publisher","DOI":"10.1145\/1498759.1498832"},{"key":"e_1_3_2_1_47_1","doi-asserted-by":"publisher","DOI":"10.1145\/1526709.1526769"},{"key":"e_1_3_2_1_48_1","doi-asserted-by":"publisher","DOI":"10.1109\/SP.2015.49"},{"key":"e_1_3_2_1_49_1","volume-title":"Mirrokni","author":"Pouget-Abadie Jean","year":"2019","unstructured":"Jean Pouget-Abadie , Kevin Aydin , Warren Schudy , Kay Brodersen , and Vahab S . Mirrokni . 2019 . Variance Reduction in Bipartite Experiments through Correlation Clustering. In Advances in Neural Information Processing Systems (NeurIPS). Vancouver, Canada , 13288--13298. Jean Pouget-Abadie, Kevin Aydin, Warren Schudy, Kay Brodersen, and Vahab S. Mirrokni. 2019. Variance Reduction in Bipartite Experiments through Correlation Clustering. In Advances in Neural Information Processing Systems (NeurIPS). Vancouver, Canada, 13288--13298."},{"volume-title":"Proceedings of the 23rd ACM SIGKDD International Conference on Knowledge Discovery and Data Mining (KDD)","author":"Raff Edward","key":"e_1_3_2_1_50_1","unstructured":"Edward Raff and Charles K. Nicholas . 2017. An Alternative to NCD for Large Sequences, Lempel-Ziv Jaccard Distance . In Proceedings of the 23rd ACM SIGKDD International Conference on Knowledge Discovery and Data Mining (KDD) . Halifax, Canada, 1007--1015. Edward Raff and Charles K. Nicholas. 2017. An Alternative to NCD for Large Sequences, Lempel-Ziv Jaccard Distance. In Proceedings of the 23rd ACM SIGKDD International Conference on Knowledge Discovery and Data Mining (KDD). Halifax, Canada, 1007--1015."},{"volume-title":"Advances in Neural Information Processing Systems (NIPS).","author":"Rahimi Ali","key":"e_1_3_2_1_51_1","unstructured":"Ali Rahimi and Benjamin Recht . 2007. Random Features for Large-Scale Kernel Machines . In Advances in Neural Information Processing Systems (NIPS). Vancouver, Canada , 1177--1184. Ali Rahimi and Benjamin Recht. 2007. Random Features for Large-Scale Kernel Machines. In Advances in Neural Information Processing Systems (NIPS). Vancouver, Canada, 1177--1184."},{"key":"e_1_3_2_1_52_1","doi-asserted-by":"publisher","DOI":"10.1186\/s40168-019-0653-2"},{"key":"e_1_3_2_1_53_1","doi-asserted-by":"publisher","DOI":"10.1145\/2623330.2623740"},{"key":"e_1_3_2_1_54_1","unstructured":"Anshumali Shrivastava. 2016. Simple and Efficient Weighted Minwise Hashing. In Neural Information Processing Systems (NIPS). Barcelona Spain 1498--1506.  Anshumali Shrivastava. 2016. Simple and Efficient Weighted Minwise Hashing. In Neural Information Processing Systems (NIPS). Barcelona Spain 1498--1506."},{"key":"e_1_3_2_1_55_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-33460-3_36"},{"key":"e_1_3_2_1_56_1","volume-title":"Proceedings of the 31th International Conference on Machine Learning (ICML)","author":"Shrivastava Anshumali","year":"2014","unstructured":"Anshumali Shrivastava and Ping Li . 2014 . Densifying One Permutation Hashing via Rotation for Fast Near Neighbor Search . In Proceedings of the 31th International Conference on Machine Learning (ICML) . Beijing, China. Anshumali Shrivastava and Ping Li. 2014. Densifying One Permutation Hashing via Rotation for Fast Near Neighbor Search. In Proceedings of the 31th International Conference on Machine Learning (ICML). Beijing, China."},{"key":"e_1_3_2_1_57_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-030-58523-5_19"},{"key":"e_1_3_2_1_58_1","doi-asserted-by":"publisher","DOI":"10.18653\/v1\/D18-1240"},{"key":"e_1_3_2_1_59_1","doi-asserted-by":"publisher","DOI":"10.1145\/1326561.1326564"},{"key":"e_1_3_2_1_60_1","doi-asserted-by":"publisher","DOI":"10.1109\/CVPR.2014.180"},{"key":"e_1_3_2_1_61_1","doi-asserted-by":"publisher","DOI":"10.1109\/IROS45743.2020.9340798"},{"key":"e_1_3_2_1_62_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICDM.2017.64"},{"key":"e_1_3_2_1_63_1","doi-asserted-by":"publisher","DOI":"10.1145\/3292500.3330951"},{"volume-title":"Proceedings of the 2019 International Conference on Management of Data (SIGMOD)","author":"Zhu Erkang","key":"e_1_3_2_1_64_1","unstructured":"Erkang Zhu , Dong Deng , Fatemeh Nargesian , and Ren\u00e9e J. Miller . 2019. JOSIE: Overlap Set Similarity Search for Finding Joinable Tables in Data Lakes . In Proceedings of the 2019 International Conference on Management of Data (SIGMOD) . Amsterdam, The Netherlands, 847--864. Erkang Zhu, Dong Deng, Fatemeh Nargesian, and Ren\u00e9e J. Miller. 2019. JOSIE: Overlap Set Similarity Search for Finding Joinable Tables in Data Lakes. In Proceedings of the 2019 International Conference on Management of Data (SIGMOD). Amsterdam, The Netherlands, 847--864."}],"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 &amp; Knowledge Management"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3511808.3557413","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3511808.3557413","content-type":"application\/pdf","content-version":"vor","intended-application":"syndication"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3511808.3557413","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,17]],"date-time":"2025-06-17T17:48:55Z","timestamp":1750182535000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3511808.3557413"}},"subtitle":["Theory and Application to Machine Learning"],"short-title":[],"issued":{"date-parts":[[2022,10,17]]},"references-count":63,"alternative-id":["10.1145\/3511808.3557413","10.1145\/3511808"],"URL":"https:\/\/doi.org\/10.1145\/3511808.3557413","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"}}]}}