{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,8,21]],"date-time":"2025-08-21T18:51:19Z","timestamp":1755802279275,"version":"3.44.0"},"publisher-location":"New York, NY, USA","reference-count":45,"publisher":"ACM","license":[{"start":{"date-parts":[[2022,6,12]],"date-time":"2022-06-12T00:00:00Z","timestamp":1654992000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"name":"MIUR","award":["2017K7XPAN"],"award-info":[{"award-number":["2017K7XPAN"]}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2022,6,12]]},"DOI":"10.1145\/3517804.3526227","type":"proceedings-article","created":{"date-parts":[[2022,6,13]],"date-time":"2022-06-13T09:29:54Z","timestamp":1655112594000},"page":"151-163","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":0,"title":["The Gibbs-Rand Model"],"prefix":"10.1145","author":[{"given":"Flavio","family":"Chierichetti","sequence":"first","affiliation":[{"name":"Sapienza University of Rome, Rome, Italy"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ravi","family":"Kumar","sequence":"additional","affiliation":[{"name":"Google, Mountain View, CA, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Silvio","family":"Lattanzi","sequence":"additional","affiliation":[{"name":"Google, Barcelona, Spain"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2022,6,13]]},"reference":[{"key":"e_1_3_2_2_1_1","doi-asserted-by":"publisher","DOI":"10.1145\/1411509.1411513"},{"key":"e_1_3_2_2_2_1","unstructured":"Pranjal Awasthi Avrim Blum Or Sheffet and Aravindan Vijayaraghavan. 2014. Learning mixtures of ranking models. In NIPS. 2609--2617."},{"key":"e_1_3_2_2_3_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.jcss.2007.06.024"},{"key":"e_1_3_2_2_4_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.cosrev.2018.01.003"},{"key":"e_1_3_2_2_5_1","unstructured":"Mark Braverman and Elchanan Mossel. 2009. Sorting from noisy information. In ArXiv. 0910.1191."},{"key":"e_1_3_2_2_6_1","unstructured":"Flavio Chierichetti Anirban Dasgupta Shahrzad Haddadan Ravi Kumar and Silvio Lattanzi. 2018. Mallows models for top-k lists. In NeurIPS. 4382--4392."},{"key":"e_1_3_2_2_7_1","doi-asserted-by":"crossref","unstructured":"Uzi Cohen Batya Kenig Haoyue Ping Benny Kimelfeld and Julia Stoyanovich. 2018. A query engine for probabilistic preferences. In SIGMOD. 1509--1524.","DOI":"10.1145\/3183713.3196923"},{"key":"e_1_3_2_2_8_1","doi-asserted-by":"publisher","DOI":"10.1007\/BF02295838"},{"key":"e_1_3_2_2_9_1","first-page":"67","article-title":"On the average rank of an element in a filter of the partition lattice. JCT","volume":"65","author":"Engel Konrad","year":"1994","unstructured":"Konrad Engel. 1994. On the average rank of an element in a filter of the partition lattice. JCT, Series A, Vol. 65, 1 (1994), 67--78.","journal-title":"Series A"},{"key":"e_1_3_2_2_10_1","unstructured":"Xiaoli Z Fern and Carla E Brodley. 2003. Random projection for high dimensional data clustering: A cluster ensemble approach. In ICML. 186--193."},{"key":"e_1_3_2_2_11_1","doi-asserted-by":"publisher","DOI":"10.1142\/S0218213004001867"},{"key":"e_1_3_2_2_12_1","doi-asserted-by":"publisher","DOI":"10.1111\/j.2517-6161.1986.tb01420.x"},{"key":"e_1_3_2_2_13_1","doi-asserted-by":"crossref","unstructured":"Ana LN Fred and Anil K Jain. 2002. Data clustering using evidence accumulation. In ICPR. 276--280.","DOI":"10.1109\/ICPR.2002.1047450"},{"key":"e_1_3_2_2_14_1","first-page":"1","article-title":"The impact of random models on clustering similarity","volume":"18","author":"Gates Alexander J.","year":"2017","unstructured":"Alexander J. Gates and Yong-Yeol Ahn. 2017. The impact of random models on clustering similarity. JMLR, Vol. 18, 87 (2017), 1--28.","journal-title":"JMLR"},{"key":"e_1_3_2_2_15_1","doi-asserted-by":"publisher","DOI":"10.1145\/1217299.1217303"},{"key":"e_1_3_2_2_16_1","unstructured":"Ryan Gomes Peter Welinder Andreas Krause and Pietro Perona. 2011. Crowdclustering. In NIPS. 558--566."},{"key":"e_1_3_2_2_17_1","doi-asserted-by":"crossref","unstructured":"Francesco Gullo Carlotta Domeniconi and Andrea Tagarelli. 2011. Advancing data clustering via projective clustering ensembles. In SIGMOD. 733--744.","DOI":"10.1145\/1989323.1989400"},{"key":"e_1_3_2_2_18_1","doi-asserted-by":"crossref","unstructured":"Shifu Hou Lifei Chen Egemen Tas Igor Demihovskiy and Yanfang Ye. 2015. Cluster-oriented ensemble classifiers for intelligent malware detection. In ICSC. 189--196.","DOI":"10.1109\/ICOSC.2015.7050805"},{"key":"e_1_3_2_2_19_1","doi-asserted-by":"publisher","DOI":"10.1007\/s11009-016-9506-7"},{"key":"e_1_3_2_2_20_1","doi-asserted-by":"publisher","DOI":"10.1093\/biomet\/30.1-2.81"},{"key":"e_1_3_2_2_21_1","doi-asserted-by":"crossref","unstructured":"Batya Kenig Benny Kimelfeld Haoyue Ping and Julia Stoyanovich. 2017. Querying probabilistic preferences in databases. In PODS. 21--36.","DOI":"10.1145\/3034786.3056111"},{"key":"e_1_3_2_2_22_1","doi-asserted-by":"crossref","unstructured":"Hyojin Kim Jayaraman J. Thiagarajan and Peer-Timo Bremer. 2014. Image segmentation using consensus from hierarchical segmentation ensembles. In ICIP. 3272--3276.","DOI":"10.1109\/ICIP.2014.7025662"},{"key":"e_1_3_2_2_23_1","unstructured":"Guy Lebanon and Yi Mao. 2008. Non-parametric modeling of partially ranked data. In NIPS. 857--864."},{"key":"e_1_3_2_2_24_1","volume-title":"Samuel Rota Bul\u00f2, and Ana Fred","author":"Louren\u00e7o Andr\u00e9","year":"2014","unstructured":"Andr\u00e9 Louren\u00e7o, Carlos Carreiras, Samuel Rota Bul\u00f2, and Ana Fred. 2014. ECG analysis using consensus clustering. In EUSIPCO. 511--515."},{"volume-title":"Combinatorial Problems and Exercises","author":"Lov\u00e1sz Laszlo","key":"e_1_3_2_2_25_1","unstructured":"Laszlo Lov\u00e1sz. 1993. Combinatorial Problems and Exercises .North-Holland Publishing Company."},{"key":"e_1_3_2_2_26_1","first-page":"3963","article-title":"Effective sampling and learning for Mallows models with pairwise-preference data","volume":"15","author":"Lu Tyler","year":"2014","unstructured":"Tyler Lu and Craig Boutilier. 2014. Effective sampling and learning for Mallows models with pairwise-preference data. JMLR, Vol. 15, 117 (2014), 3963--4009.","journal-title":"JMLR"},{"key":"e_1_3_2_2_27_1","doi-asserted-by":"publisher","DOI":"10.1093\/biomet\/44.1-2.114"},{"key":"e_1_3_2_2_28_1","volume-title":"Manning and Hinrich Sch\u00fctze","author":"Christopher","year":"1999","unstructured":"Christopher D. Manning and Hinrich Sch\u00fctze. 1999. Foundations of Statistical Natural Language Processing .MIT Press. 99021137"},{"key":"e_1_3_2_2_29_1","doi-asserted-by":"crossref","unstructured":"Marina Meila. 2003. Comparing clusterings by the variation of isnformation. In COLT. 173--187.","DOI":"10.1007\/978-3-540-45167-9_14"},{"key":"e_1_3_2_2_30_1","doi-asserted-by":"crossref","unstructured":"Marina Meila. 2005. Comparing clusterings: An axiomatic view. In ICML. 577--584.","DOI":"10.1145\/1102351.1102424"},{"key":"e_1_3_2_2_31_1","doi-asserted-by":"publisher","DOI":"10.1023\/A:1023949509487"},{"key":"e_1_3_2_2_32_1","doi-asserted-by":"publisher","DOI":"10.1109\/TIM.2015.2450354"},{"key":"e_1_3_2_2_33_1","doi-asserted-by":"publisher","DOI":"10.1080\/01621459.1971.10482356"},{"key":"e_1_3_2_2_34_1","unstructured":"Simone Romano James Bailey Vinh Nguyen and Karin Verspoor. 2014. Standardized mutual information for clustering comparisons: One step further in adjustment for chance. In ICML. 1143--1151."},{"key":"e_1_3_2_2_35_1","doi-asserted-by":"crossref","unstructured":"Armindokht Hashempour Sadeghian and Hossein Nezamabadi-pour. 2015. Document clustering using gravitational ensemble clustering. In AISP. 240--245.","DOI":"10.1109\/AISP.2015.7123481"},{"key":"e_1_3_2_2_36_1","doi-asserted-by":"publisher","DOI":"10.1007\/s10822-014-9750-2"},{"key":"e_1_3_2_2_37_1","doi-asserted-by":"publisher","DOI":"10.1007\/s10994-009-5158-y"},{"key":"e_1_3_2_2_38_1","doi-asserted-by":"publisher","DOI":"10.1007\/s003579900004"},{"key":"e_1_3_2_2_39_1","doi-asserted-by":"crossref","unstructured":"Hwanjun Song and Jae-Gil Lee. 2018. RP-DBSCAN: A superfast parallel DBSCAN algorithm Based on random partitioning. In SIGMOD. 1173--1187.","DOI":"10.1145\/3183713.3196887"},{"key":"e_1_3_2_2_40_1","volume-title":"Proc. VLDB Endow.","volume":"1722","author":"Stefan Neumann Pauli Miettinen","year":"2020","unstructured":"Pauli Miettinen Stefan Neumann. 2020. Biclustering and Boolean matrix factorization in data streams. Proc. VLDB Endow., Vol. 13(10) (2020), 1709--1722."},{"key":"e_1_3_2_2_41_1","first-page":"583","article-title":"Cluster ensembles--a knowledge reuse framework for combining multiple partitions","volume":"3","author":"Strehl Alexander","year":"2002","unstructured":"Alexander Strehl and Joydeep Ghosh. 2002. Cluster ensembles--a knowledge reuse framework for combining multiple partitions. JMLR, Vol. 3 (2002), 583--617.","journal-title":"JMLR"},{"key":"e_1_3_2_2_42_1","doi-asserted-by":"crossref","unstructured":"Alexander Topchy Anil K Jain and William Punch. 2004. A mixture model for clustering ensembles. In SDM. 379--390.","DOI":"10.1137\/1.9781611972740.35"},{"key":"e_1_3_2_2_43_1","doi-asserted-by":"publisher","DOI":"10.5555\/1756006.1953024"},{"key":"e_1_3_2_2_44_1","doi-asserted-by":"crossref","unstructured":"Di Xiao Yi Cui Daren B.H. Cline and Dmitri Loguinov. 2017. On asymptotic cost of triangle listing in random graphs. In PODS. 261--272.","DOI":"10.1145\/3034786.3034790"},{"key":"e_1_3_2_2_45_1","doi-asserted-by":"crossref","unstructured":"Zhiqiang Xu Yiping Ke Yi Wang Hong Cheng and James Cheng. 2012. A model-based approach to attributed graph clustering. In SIGMOD. 505--516.","DOI":"10.1145\/2213836.2213894"}],"event":{"name":"SIGMOD\/PODS '22: International Conference on Management of Data","sponsor":["SIGMOD ACM Special Interest Group on Management of Data"],"location":"Philadelphia PA USA","acronym":"SIGMOD\/PODS '22"},"container-title":["Proceedings of the 41st ACM SIGMOD-SIGACT-SIGAI Symposium on Principles of Database Systems"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3517804.3526227","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3517804.3526227","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,8,21]],"date-time":"2025-08-21T18:21:35Z","timestamp":1755800495000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3517804.3526227"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,6,12]]},"references-count":45,"alternative-id":["10.1145\/3517804.3526227","10.1145\/3517804"],"URL":"https:\/\/doi.org\/10.1145\/3517804.3526227","relation":{},"subject":[],"published":{"date-parts":[[2022,6,12]]},"assertion":[{"value":"2022-06-13","order":3,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}