{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,1]],"date-time":"2026-05-01T05:27:47Z","timestamp":1777613267021,"version":"3.51.4"},"publisher-location":"New York, NY, USA","reference-count":53,"publisher":"ACM","license":[{"start":{"date-parts":[[2021,6,9]],"date-time":"2021-06-09T00:00:00Z","timestamp":1623196800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"name":"Natural Science Basic Research Plan in Zhejiang Province of China","award":["LGG18F020016"],"award-info":[{"award-number":["LGG18F020016"]}]},{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["61922067, U1736205, 61902305"],"award-info":[{"award-number":["61922067, U1736205, 61902305"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"name":"Shenzhen Basic Research Grant","award":["JCYJ20170816100819428"],"award-info":[{"award-number":["JCYJ20170816100819428"]}]},{"name":"MoE-CMCC Artifical Intelligence Project","award":["MCM20190701"],"award-info":[{"award-number":["MCM20190701"]}]},{"name":"Natural Science Basic Research Plan in Shaanxi Province of China","award":["2019JM-159"],"award-info":[{"award-number":["2019JM-159"]}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2021,6,9]]},"DOI":"10.1145\/3448016.3452833","type":"proceedings-article","created":{"date-parts":[[2021,6,18]],"date-time":"2021-06-18T17:22:39Z","timestamp":1624036959000},"page":"830-842","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":15,"title":["Bidirectionally Densifying LSH Sketches with Empty Bins"],"prefix":"10.1145","author":[{"given":"Peng","family":"Jia","sequence":"first","affiliation":[{"name":"Xi'an Jiaotong University, Xi'an, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Pinghui","family":"Wang","sequence":"additional","affiliation":[{"name":"Xi'an Jiaotong University, Xi'an, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Junzhou","family":"Zhao","sequence":"additional","affiliation":[{"name":"Xi'an Jiaotong University, Xi'an, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Shuo","family":"Zhang","sequence":"additional","affiliation":[{"name":"Xi'an Jiaotong University, Xi'an, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yiyan","family":"Qi","sequence":"additional","affiliation":[{"name":"Xi'an Jiaotong University, Xi'an, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Min","family":"Hu","sequence":"additional","affiliation":[{"name":"China Mobile Research Institute, Beijing, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Chao","family":"Deng","sequence":"additional","affiliation":[{"name":"China Mobile Research Institute, Beijing, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Xiaohong","family":"Guan","sequence":"additional","affiliation":[{"name":"Xi'an Jiaotong University & Tsinghua University, Xi'an, China"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2021,6,18]]},"reference":[{"key":"e_1_3_2_2_1_1","unstructured":"L\u00e9on Bottou and Olivier Bousquet. 2008. The tradeoffs of large scale learning. In NIPS. 161--168.  L\u00e9on Bottou and Olivier Bousquet. 2008. The tradeoffs of large scale learning. In NIPS. 161--168."},{"key":"e_1_3_2_2_2_1","unstructured":"Andrei~Z Broder. 1997. On the resemblance and containment of documents. In SEQUENCES. 21--29.  Andrei~Z Broder. 1997. On the resemblance and containment of documents. In SEQUENCES. 21--29."},{"key":"e_1_3_2_2_3_1","doi-asserted-by":"publisher","DOI":"10.1006\/jcss.1999.1690"},{"key":"e_1_3_2_2_4_1","doi-asserted-by":"crossref","unstructured":"Moses Charikar. 2002. Similarity estimation techniques from rounding algorithms. In STOC. 380--388.  Moses Charikar. 2002. Similarity estimation techniques from rounding algorithms. In STOC. 380--388.","DOI":"10.1145\/509907.509965"},{"key":"e_1_3_2_2_5_1","unstructured":"Beidi Chen Tharun Medini James Farwell Sameh Gobriel Charlie Tai and Anshumali Shrivastava. 2020 b. Slide: In defense of smart algorithms over hardware acceleration for large-scale deep learning systems. In MLSys. 1--16.  Beidi Chen Tharun Medini James Farwell Sameh Gobriel Charlie Tai and Anshumali Shrivastava. 2020 b. Slide: In defense of smart algorithms over hardware acceleration for large-scale deep learning systems. In MLSys. 1--16."},{"key":"e_1_3_2_2_6_1","unstructured":"Beidi Chen and Anshumali Shrivastava. 2018. Densified Winner Take All (WTA) Hashing for Sparse Datasets. In UAI . 906--916.  Beidi Chen and Anshumali Shrivastava. 2018. Densified Winner Take All (WTA) Hashing for Sparse Datasets. In UAI . 906--916."},{"key":"e_1_3_2_2_7_1","unstructured":"Beidi Chen Yingchen Xu and Anshumali Shrivastava. 2019. Fast and Accurate Stochastic Gradient Estimation. In NIPS. 12339--12349.  Beidi Chen Yingchen Xu and Anshumali Shrivastava. 2019. Fast and Accurate Stochastic Gradient Estimation. In NIPS. 12339--12349."},{"key":"e_1_3_2_2_8_1","first-page":"280","article-title":"a","volume":"5","author":"Chen Jihong","year":"2020","unstructured":"Jihong Chen , Wei Chen , Jinjing Huang , Jinhua Fang , Zhixu Li , An Liu , and Lei Zhao . 2020 a . Co-purchaser Recommendation for Online Group Buying. DSE , Vol. 5 , 3 (2020), 280 -- 292 . Jihong Chen, Wei Chen, Jinjing Huang, Jinhua Fang, Zhixu Li, An Liu, and Lei Zhao. 2020 a. Co-purchaser Recommendation for Online Group Buying. DSE , Vol. 5, 3 (2020), 280--292.","journal-title":"Co-purchaser Recommendation for Online Group Buying. DSE"},{"key":"e_1_3_2_2_9_1","volume-title":"Support-vector networks. Machine learning","author":"Cortes Corinna","year":"1995","unstructured":"Corinna Cortes and Vladimir Vapnik . 1995. Support-vector networks. Machine learning , Vol. 20 , 3 ( 1995 ), 273--297. Corinna Cortes and Vladimir Vapnik. 1995. Support-vector networks. Machine learning , Vol. 20, 3 (1995), 273--297."},{"key":"e_1_3_2_2_10_1","volume-title":"Mathias B\u00e6k~Tejs Knudsen, and Mikkel Thorup","author":"Dahlgaard S\u00f8ren","year":"2017","unstructured":"S\u00f8ren Dahlgaard , Mathias B\u00e6k~Tejs Knudsen, and Mikkel Thorup . 2017 . Fast Similarity Sketching. In FOCS. 663--671. S\u00f8ren Dahlgaard, Mathias B\u00e6k~Tejs Knudsen, and Mikkel Thorup. 2017. Fast Similarity Sketching. In FOCS. 663--671."},{"key":"e_1_3_2_2_11_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 SOCG . 253--262.  Mayur Datar Nicole Immorlica Piotr Indyk and Vahab~S. Mirrokni. 2004. Locality-sensitive hashing scheme based on p-stable distributions. In SOCG . 253--262.","DOI":"10.1145\/997817.997857"},{"key":"e_1_3_2_2_12_1","unstructured":"Thomas~L. Dean Mark~A. Ruzon Mark Segal Jonathon Shlens Sudheendra Vijayanarasimhan and Jay Yagnik. 2013. Fast Accurate Detection of 100 000 Object Classes on a Single Machine. In CVPR . 1814--1821.  Thomas~L. Dean Mark~A. Ruzon Mark Segal Jonathon Shlens Sudheendra Vijayanarasimhan and Jay Yagnik. 2013. Fast Accurate Detection of 100 000 Object Classes on a Single Machine. In CVPR . 1814--1821."},{"key":"e_1_3_2_2_13_1","doi-asserted-by":"crossref","unstructured":"Otmar Ertl. 2019. BagMinHash - Minwise Hashing Algorithm for Weighted Sets. In SIGKDD. 1368--1377.  Otmar Ertl. 2019. BagMinHash - Minwise Hashing Algorithm for Weighted Sets. In SIGKDD. 1368--1377.","DOI":"10.1145\/3219819.3220089"},{"key":"e_1_3_2_2_14_1","doi-asserted-by":"publisher","DOI":"10.1007\/s11263-009-0275-4"},{"key":"e_1_3_2_2_15_1","doi-asserted-by":"publisher","DOI":"10.5555\/1390681.1442794"},{"key":"e_1_3_2_2_16_1","volume-title":"Lazo: A Cardinality-Based Method for Coupled Estimation of Jaccard Similarity and Containment. In ICDE. 1190--1201.","author":"Fernandez Raul~Castro","year":"2019","unstructured":"Raul~Castro Fernandez , Jisoo Min , Demitri Nava , and Samuel Madden . 2019 . Lazo: A Cardinality-Based Method for Coupled Estimation of Jaccard Similarity and Containment. In ICDE. 1190--1201. Raul~Castro Fernandez, Jisoo Min, Demitri Nava, and Samuel Madden. 2019. Lazo: A Cardinality-Based Method for Coupled Estimation of Jaccard Similarity and Containment. In ICDE. 1190--1201."},{"key":"e_1_3_2_2_17_1","unstructured":"Tiezheng Ge Kaiming He Qifa Ke and Jian Sun. 2013. Optimized product quantization for approximate nearest neighbor search. In CVPR . 2946--2953.  Tiezheng Ge Kaiming He Qifa Ke and Jian Sun. 2013. Optimized product quantization for approximate nearest neighbor search. In CVPR . 2946--2953."},{"key":"e_1_3_2_2_18_1","unstructured":"Aristides Gionis Piotr Indyk and Rajeev Motwani. 1999. Similarity Search in High Dimensions via Hashing. In PVLDB. 518--529.  Aristides Gionis Piotr Indyk and Rajeev Motwani. 1999. Similarity Search in High Dimensions via Hashing. In PVLDB. 518--529."},{"key":"e_1_3_2_2_19_1","doi-asserted-by":"crossref","unstructured":"Sreenivas Gollapudi and Rina Panigrahy. 2006. Exploiting asymmetry in hierarchical topic extraction. In CIKM. 475--482.  Sreenivas Gollapudi and Rina Panigrahy. 2006. Exploiting asymmetry in hierarchical topic extraction. In CIKM. 475--482.","DOI":"10.1145\/1183614.1183683"},{"key":"e_1_3_2_2_20_1","doi-asserted-by":"publisher","DOI":"10.14778\/3397230.3397243"},{"key":"e_1_3_2_2_21_1","volume-title":"Consistent Weighted Sampling Made Fast, Small, and Easy. CoRR","author":"Haeupler Bernhard","year":"2014","unstructured":"Bernhard Haeupler , Mark~ S. Manasse , and Kunal Talwar . 2014. Consistent Weighted Sampling Made Fast, Small, and Easy. CoRR , Vol. abs\/ 1410 .4266 ( 2014 ). Bernhard Haeupler, Mark~S. Manasse, and Kunal Talwar. 2014. Consistent Weighted Sampling Made Fast, Small, and Easy. CoRR , Vol. abs\/1410.4266 (2014)."},{"key":"e_1_3_2_2_22_1","doi-asserted-by":"crossref","unstructured":"Piotr Indyk and Rajeev Motwani. 1998. Approximate Nearest Neighbors: Towards Removing the Curse of Dimensionality. In STOC . 604--613.  Piotr Indyk and Rajeev Motwani. 1998. Approximate Nearest Neighbors: Towards Removing the Curse of Dimensionality. In STOC . 604--613.","DOI":"10.1145\/276698.276876"},{"key":"e_1_3_2_2_23_1","doi-asserted-by":"crossref","unstructured":"Sergey Ioffe. 2010. Improved Consistent Sampling Weighted Minhash and L1 Sketching. In ICDM . 246--255.  Sergey Ioffe. 2010. Improved Consistent Sampling Weighted Minhash and L1 Sketching. In ICDM . 246--255.","DOI":"10.1109\/ICDM.2010.80"},{"key":"e_1_3_2_2_24_1","doi-asserted-by":"crossref","unstructured":"Peng Jia Pinghui Wang Jing Tao and Xiaohong Guan. 2019. A Fast Sketch Method for Mining User Similarities over Fully Dynamic Graph Streams. In ICDE . 1682--1685.  Peng Jia Pinghui Wang Jing Tao and Xiaohong Guan. 2019. A Fast Sketch Method for Mining User Similarities over Fully Dynamic Graph Streams. In ICDE . 1682--1685.","DOI":"10.1109\/ICDE.2019.00172"},{"key":"e_1_3_2_2_25_1","unstructured":"Jon Kleinberg and Eva Tardos. 1999. Approximation Algorithms for Classification Problems with Pairwise Relationships: Metric Labeling and Markov Random Fields. In FOCS. 14--14.  Jon Kleinberg and Eva Tardos. 1999. Approximation Algorithms for Classification Problems with Pairwise Relationships: Metric Labeling and Markov Random Fields. In FOCS. 14--14."},{"key":"e_1_3_2_2_27_1","doi-asserted-by":"publisher","DOI":"10.5555\/1005332.1005345"},{"key":"e_1_3_2_2_28_1","unstructured":"Ping Li. 2015. 0-Bit Consistent Weighted Sampling. In SIGKDD. 665--674.  Ping Li. 2015. 0-Bit Consistent Weighted Sampling. In SIGKDD. 665--674."},{"key":"e_1_3_2_2_29_1","unstructured":"Ping Li. 2017. Linearized gmm kernels and normalized random fourier features. In SIGKDD . 315--324.  Ping Li. 2017. Linearized gmm kernels and normalized random fourier features. In SIGKDD . 315--324."},{"key":"e_1_3_2_2_30_1","volume-title":"Several tunable GMM kernels. arXiv preprint arXiv:1805.02830","author":"Ping Li.","year":"2018","unstructured":"Ping Li. 2018. Several tunable GMM kernels. arXiv preprint arXiv:1805.02830 ( 2018 ). Ping Li. 2018. Several tunable GMM kernels. arXiv preprint arXiv:1805.02830 (2018)."},{"key":"e_1_3_2_2_31_1","unstructured":"Ping Li and Arnd~Christian K\u00f6 nig. 2010. b-Bit minwise hashing. In WWW. 671--680.  Ping Li and Arnd~Christian K\u00f6 nig. 2010. b-Bit minwise hashing. In WWW. 671--680."},{"key":"e_1_3_2_2_32_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 NIPS. 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 NIPS. 15900--15910."},{"key":"e_1_3_2_2_33_1","unstructured":"Ping Li Art~B. Owen and Cun-Hui Zhang. 2012. One Permutation Hashing. In NIPS. 3122--3130.  Ping Li Art~B. Owen and Cun-Hui Zhang. 2012. One Permutation Hashing. In NIPS. 3122--3130."},{"key":"e_1_3_2_2_34_1","unstructured":"Ping Li Anshumali Shrivastava Joshua~L Moore and Arnd~C K\u00f6nig. 2011a. Hashing algorithms for large-scale learning. In NIPS. 2672--2680.  Ping Li Anshumali Shrivastava Joshua~L Moore and Arnd~C K\u00f6nig. 2011a. Hashing algorithms for large-scale learning. In NIPS. 2672--2680."},{"key":"e_1_3_2_2_35_1","unstructured":"Ping Li Anshumali Shrivastava Joshua~L. Moore and Arnd~Christian K\u00f6 nig. 2011b. Hashing Algorithms for Large-Scale Learning. In NIPS. 2672--2680.  Ping Li Anshumali Shrivastava Joshua~L. Moore and Arnd~Christian K\u00f6 nig. 2011b. Hashing Algorithms for Large-Scale Learning. In NIPS. 2672--2680."},{"key":"e_1_3_2_2_36_1","unstructured":"Ping Li and Cun-Hui Zhang. 2017. Theory of the GMM Kernel. In WWW. 1053--1062.  Ping Li and Cun-Hui Zhang. 2017. Theory of the GMM Kernel. In WWW. 1053--1062."},{"key":"e_1_3_2_2_37_1","doi-asserted-by":"crossref","unstructured":"Wanqi Liu Hanchen Wang Ying Zhang Wei Wang and Lu Qin. 2019. I-LSH: I\/O efficient c-approximate nearest neighbor search in high-dimensional space. In ICDE. 1670--1673.  Wanqi Liu Hanchen Wang Ying Zhang Wei Wang and Lu Qin. 2019. I-LSH: I\/O efficient c-approximate nearest neighbor search in high-dimensional space. In ICDE. 1670--1673.","DOI":"10.1109\/ICDE.2019.00169"},{"key":"e_1_3_2_2_38_1","unstructured":"Tung Mai Anup Rao Matt Kapilevich Ryan Rossi Yasin Abbasi-Yadkori and Ritwik Sinha. 2019. On Densification for Minwise Hashing. In UAI. 302--311.  Tung Mai Anup Rao Matt Kapilevich Ryan Rossi Yasin Abbasi-Yadkori and Ritwik Sinha. 2019. On Densification for Minwise Hashing. In UAI. 302--311."},{"key":"e_1_3_2_2_39_1","volume-title":"Efficient and robust approximate nearest neighbor search using hierarchical navigable small world graphs. TPAMI","author":"Malkov A","year":"2018","unstructured":"Yury~ A Malkov and Dmitry~ A Yashunin . 2018. Efficient and robust approximate nearest neighbor search using hierarchical navigable small world graphs. TPAMI ( 2018 ). Yury~A Malkov and Dmitry~A Yashunin. 2018. Efficient and robust approximate nearest neighbor search using hierarchical navigable small world graphs. TPAMI (2018)."},{"key":"e_1_3_2_2_41_1","doi-asserted-by":"crossref","unstructured":"Julian McAuley Rahul Pandey and Jure Leskovec. 2015. Inferring networks of substitutable and complementary products. In KDD . 785--794.  Julian McAuley Rahul Pandey and Jure Leskovec. 2015. Inferring networks of substitutable and complementary products. In KDD . 785--794.","DOI":"10.1145\/2783258.2783381"},{"key":"e_1_3_2_2_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--118.  Michael Mitzenmacher Rasmus Pagh and Ninh Pham. 2014. Efficient estimation for high similarities using odd sketches. In WWW. 109--118.","DOI":"10.1145\/2566486.2568017"},{"key":"e_1_3_2_2_43_1","doi-asserted-by":"crossref","unstructured":"Devi Parikh and Kristen Grauman. 2011. Relative attributes. In ICCV. 503--510.  Devi Parikh and Kristen Grauman. 2011. Relative attributes. In ICCV. 503--510.","DOI":"10.1109\/ICCV.2011.6126281"},{"key":"e_1_3_2_2_44_1","unstructured":"Ali Rahimi and Benjamin Recht. 2008. Random features for large-scale kernel machines. In NIPS. 1177--1184.  Ali Rahimi and Benjamin Recht. 2008. Random features for large-scale kernel machines. In NIPS. 1177--1184."},{"key":"e_1_3_2_2_45_1","unstructured":"Anshumali Shrivastava. 2016. Simple and Efficient Weighted Minwise Hashing. In NIPS. 1498--1506.  Anshumali Shrivastava. 2016. Simple and Efficient Weighted Minwise Hashing. In NIPS. 1498--1506."},{"key":"e_1_3_2_2_46_1","unstructured":"Anshumali Shrivastava. 2017. Optimal Densification for Fast and Accurate Minwise Hashing. In ICML. 3154--3163.  Anshumali Shrivastava. 2017. Optimal Densification for Fast and Accurate Minwise Hashing. In ICML. 3154--3163."},{"key":"e_1_3_2_2_47_1","unstructured":"Anshumali Shrivastava and Ping Li. 2014a. Densifying One Permutation Hashing via Rotation for Fast Near Neighbor Search. In ICML . 557--565.  Anshumali Shrivastava and Ping Li. 2014a. Densifying One Permutation Hashing via Rotation for Fast Near Neighbor Search. In ICML . 557--565."},{"key":"e_1_3_2_2_48_1","unstructured":"Anshumali Shrivastava and Ping Li. 2014b. Improved Densification of One Permutation Hashing. In UAI. 732--741.  Anshumali Shrivastava and Ping Li. 2014b. Improved Densification of One Permutation Hashing. In UAI. 732--741."},{"key":"e_1_3_2_2_49_1","doi-asserted-by":"crossref","unstructured":"Ryan Spring and Anshumali Shrivastava. 2017. Scalable and sustainable deep learning via randomized hashing. In SIGKDD . 445--454.  Ryan Spring and Anshumali Shrivastava. 2017. Scalable and sustainable deep learning via randomized hashing. In SIGKDD . 445--454.","DOI":"10.1145\/3097983.3098035"},{"key":"e_1_3_2_2_50_1","doi-asserted-by":"crossref","unstructured":"Ryan Spring and Anshumali Shrivastava. 2020. Mutual information estimation using LSH sampling. In AAAI. 1--9.  Ryan Spring and Anshumali Shrivastava. 2020. Mutual information estimation using LSH sampling. In AAAI. 1--9.","DOI":"10.24963\/ijcai.2020\/389"},{"key":"e_1_3_2_2_51_1","doi-asserted-by":"crossref","unstructured":"Pinghui Wang Yiyan Qi Yuanming Zhang Qiaozhu Zhai Chenxu Wang John C. S. Lui and Xiaohong Guan. 2019. A Memory-Efficient Sketch Method for Estimating High Similarities in Streaming Sets. In SIGKDD . 25--33.  Pinghui Wang Yiyan Qi Yuanming Zhang Qiaozhu Zhai Chenxu Wang John C. S. Lui and Xiaohong Guan. 2019. A Memory-Efficient Sketch Method for Estimating High Similarities in Streaming Sets. In SIGKDD . 25--33.","DOI":"10.1145\/3292500.3330825"},{"key":"e_1_3_2_2_52_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--1292.  Wei Wu Bin Li Ling Chen and Chengqi Zhang. 2016. Canonical Consistent Weighted Sampling for Real-Value Weighted Min-Hash. In ICDM . 1287--1292.","DOI":"10.1109\/ICDM.2016.0174"},{"key":"e_1_3_2_2_53_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--1043.  Wei Wu Bin Li Ling Chen and Chengqi Zhang. 2017. Consistent Weighted Sampling Made More Practical. In WWW. 1035--1043.","DOI":"10.1145\/3038912.3052598"},{"key":"e_1_3_2_2_54_1","volume-title":"RGMIA","volume":"2","author":"Xia Da-Feng","year":"1999","unstructured":"Da-Feng Xia , Sen-Lin Xu , and Feng Qi . 1999 . A proof of the arithmetic mean-geometric mean-harmonic mean inequalities . RGMIA , Vol. 2 , 1 (1999). Da-Feng Xia, Sen-Lin Xu, and Feng Qi. 1999. A proof of the arithmetic mean-geometric mean-harmonic mean inequalities. RGMIA , Vol. 2, 1 (1999)."},{"key":"e_1_3_2_2_55_1","unstructured":"Jay Yagnik Dennis Strelow David~A. Ross and Ruei-Sung Lin. 2019. The power of comparative reasoning. In ICCV. 2431--2438.  Jay Yagnik Dennis Strelow David~A. Ross and Ruei-Sung Lin. 2019. The power of comparative reasoning. In ICCV. 2431--2438."}],"event":{"name":"SIGMOD\/PODS '21: International Conference on Management of Data","location":"Virtual Event China","acronym":"SIGMOD\/PODS '21","sponsor":["SIGMOD ACM Special Interest Group on Management of Data"]},"container-title":["Proceedings of the 2021 International Conference on Management of Data"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3448016.3452833","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3448016.3452833","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,17]],"date-time":"2025-06-17T21:28:05Z","timestamp":1750195685000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3448016.3452833"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,6,9]]},"references-count":53,"alternative-id":["10.1145\/3448016.3452833","10.1145\/3448016"],"URL":"https:\/\/doi.org\/10.1145\/3448016.3452833","relation":{},"subject":[],"published":{"date-parts":[[2021,6,9]]},"assertion":[{"value":"2021-06-18","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}