{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,24]],"date-time":"2026-02-24T17:14:43Z","timestamp":1771953283524,"version":"3.50.1"},"publisher-location":"New York, NY, USA","reference-count":14,"publisher":"ACM","license":[{"start":{"date-parts":[[2010,10,26]],"date-time":"2010-10-26T00:00:00Z","timestamp":1288051200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2010,10,26]]},"DOI":"10.1145\/1871437.1871501","type":"proceedings-article","created":{"date-parts":[[2010,10,26]],"date-time":"2010-10-26T12:36:11Z","timestamp":1288096571000},"page":"479-488","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":51,"title":["Set cover algorithms for very large datasets"],"prefix":"10.1145","author":[{"given":"Graham","family":"Cormode","sequence":"first","affiliation":[{"name":"AT&T Labs - Research, Florham Park, NJ, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Howard","family":"Karloff","sequence":"additional","affiliation":[{"name":"AT&T Labs - Research, Florham Park, NJ, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Anthony","family":"Wirth","sequence":"additional","affiliation":[{"name":"The University of Melbourne, Parkville, Australia"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2010,10,26]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1016\/S0022-0000(05)80068-6"},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1145\/312129.312241"},{"key":"e_1_3_2_1_3_1","volume-title":"Survey: Network applications of bloom filters: A survey. Internet Mathematics, 1(4)","author":"Broder A.","year":"2003","unstructured":"A. Broder and M. Mitzenmacher . Survey: Network applications of bloom filters: A survey. Internet Mathematics, 1(4) , 2003 . A. Broder and M. Mitzenmacher. Survey: Network applications of bloom filters: A survey. Internet Mathematics, 1(4), 2003."},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1145\/1772690.1772715"},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1145\/285055.285059"},{"key":"e_1_3_2_1_6_1","first-page":"2003","volume-title":"Proceedings of the 82nd Annual Transportation Research Board","author":"Geurts K.","unstructured":"K. Geurts , G. Wets , T. Brijs , and K. Vanhoof . Profiling high frequency accident locations using association rules . In Proceedings of the 82nd Annual Transportation Research Board , page 18pp, January 2003 . K. Geurts, G. Wets, T. Brijs, and K. Vanhoof. Profiling high frequency accident locations using association rules. In Proceedings of the 82nd Annual Transportation Research Board, page 18pp, January 2003."},{"key":"e_1_3_2_1_7_1","unstructured":"B. Goethals. Frequent itemset mining dataset repository. http:\/\/fimi.cs.helsinki.fi\/dat.  B. Goethals. Frequent itemset mining dataset repository. http:\/\/fimi.cs.helsinki.fi\/dat."},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.14778\/1453856.1453900"},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.cor.2005.03.030"},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1016\/S0377-2217(96)00161-0"},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1016\/S0022-0000(74)80044-9"},{"key":"e_1_3_2_1_12_1","volume-title":"Proceedings of the ICDM Workshop in Frequent Itemset Mining Implementations","author":"Lucchese C.","year":"2004","unstructured":"C. Lucchese , S. Orlando , R. Perego , and F. Silvestri . Webdocs: a real-life huge transactional dataset . In Proceedings of the ICDM Workshop in Frequent Itemset Mining Implementations , 2004 . C. Lucchese, S. Orlando, R. Perego, and F. Silvestri. Webdocs: a real-life huge transactional dataset. In Proceedings of the ICDM Workshop in Frequent Itemset Mining Implementations, 2004."},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.5555\/646976.711537"},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611972795.60"}],"event":{"name":"CIKM '10: International Conference on Information and Knowledge Management","location":"Toronto ON Canada","acronym":"CIKM '10","sponsor":["SIGWEB ACM Special Interest Group on Hypertext, Hypermedia, and Web","SIGKDD ACM Special Interest Group on Knowledge Discovery in Data","SIGIR ACM Special Interest Group on Information Retrieval"]},"container-title":["Proceedings of the 19th ACM international conference on Information and knowledge management"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1871437.1871501","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/1871437.1871501","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T10:59:48Z","timestamp":1750244388000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1871437.1871501"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010,10,26]]},"references-count":14,"alternative-id":["10.1145\/1871437.1871501","10.1145\/1871437"],"URL":"https:\/\/doi.org\/10.1145\/1871437.1871501","relation":{},"subject":[],"published":{"date-parts":[[2010,10,26]]},"assertion":[{"value":"2010-10-26","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}