{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,17]],"date-time":"2026-04-17T02:55:41Z","timestamp":1776394541583,"version":"3.51.2"},"publisher-location":"New York, NY, USA","reference-count":14,"publisher":"ACM","license":[{"start":{"date-parts":[[2004,8,22]],"date-time":"2004-08-22T00:00:00Z","timestamp":1093132800000},"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":[[2004,8,22]]},"DOI":"10.1145\/1014052.1014057","type":"proceedings-article","created":{"date-parts":[[2004,10,7]],"date-time":"2004-10-07T17:39:48Z","timestamp":1097170788000},"page":"12-19","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":81,"title":["Approximating a collection of frequent sets"],"prefix":"10.1145","author":[{"given":"Foto","family":"Afrati","sequence":"first","affiliation":[{"name":"University of Athens, Greece"}]},{"given":"Aristides","family":"Gionis","sequence":"additional","affiliation":[{"name":"University of Helsinki, Finland"}]},{"given":"Heikki","family":"Mannila","sequence":"additional","affiliation":[{"name":"University of Helsinki, Finland"}]}],"member":"320","published-online":{"date-parts":[[2004,8,22]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1145\/170035.170072"},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.5555\/645480.655281"},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.5555\/645806.670313"},{"key":"e_1_3_2_1_4_1","first-page":"299","volume-title":"Proceedings of the 24th International Conference on Very Large Data Bases","author":"Fang Min","year":"1998","unstructured":"Min Fang , Narayanan Shivakumar , Hector Garcia-Molina , Rajeev Motwani , and Jeffrey D. Ullman . Computing iceberg queries efficiently . In Proceedings of the 24th International Conference on Very Large Data Bases , pages 299 -- 310 , New York City, USA , 1998 .]] Min Fang, Narayanan Shivakumar, Hector Garcia-Molina, Rajeev Motwani, and Jeffrey D. Ullman. Computing iceberg queries efficiently. In Proceedings of the 24th International Conference on Very Large Data Bases, pages 299--310, New York City, USA, 1998.]]"},{"key":"e_1_3_2_1_5_1","volume-title":"An introduction to probability theory and its applications","author":"Feller William","year":"1968","unstructured":"William Feller . An introduction to probability theory and its applications . John Wiley & Sons , 1968 .]] William Feller. An introduction to probability theory and its applications. John Wiley & Sons, 1968.]]"},{"key":"e_1_3_2_1_6_1","volume-title":"Computers and Intractability: A Guide to the Theory of NP-Completeness","author":"Garey M.R.","year":"1979","unstructured":"M.R. Garey and David S. Johnson . Computers and Intractability: A Guide to the Theory of NP-Completeness . W.H. Freeman , 1979 .]] M.R. Garey and David S. Johnson. Computers and Intractability: A Guide to the Theory of NP-Completeness. W.H. Freeman, 1979.]]"},{"key":"e_1_3_2_1_7_1","unstructured":"Bart Goethals. Frequent itemset mining implementations. http:\/\/www.cs.helsinki.fi\/u\/goethals\/software\/.]]  Bart Goethals. Frequent itemset mining implementations. http:\/\/www.cs.helsinki.fi\/u\/goethals\/software\/.]]"},{"key":"e_1_3_2_1_8_1","first-page":"211","volume-title":"Proceedings of the IEEE International Conference on Data Mining","author":"Han Jiawei","year":"2002","unstructured":"Jiawei Han , Jianyong Wang , Ying Lu , and Petre Tzvetkov . Mining top-k frequent closed patterns without minimum support . In Proceedings of the IEEE International Conference on Data Mining , pages 211 -- 218 , 2002 .]] Jiawei Han, Jianyong Wang, Ying Lu, and Petre Tzvetkov. Mining top-k frequent closed patterns without minimum support. In Proceedings of the IEEE International Conference on Data Mining, pages 211--218, 2002.]]"},{"key":"e_1_3_2_1_9_1","volume-title":"Approximation algorithms for NP-hard problems","author":"Hochbaum Dorit","year":"1997","unstructured":"Dorit Hochbaum , editor. Approximation algorithms for NP-hard problems . PWS Publishing Company , 1997 .]] Dorit Hochbaum, editor. Approximation algorithms for NP-hard problems. PWS Publishing Company, 1997.]]"},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1145\/380995.381033"},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1023\/A:1009748302351"},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"crossref","DOI":"10.1017\/CBO9780511814075","volume-title":"Randomized Algorithms","author":"Motwani Rajeev","year":"1995","unstructured":"Rajeev Motwani and Prabhakar Raghavan . Randomized Algorithms . Cambridge University Press , 1995 .]] Rajeev Motwani and Prabhakar Raghavan. Randomized Algorithms. Cambridge University Press, 1995.]]"},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.5555\/645503.656256"},{"key":"e_1_3_2_1_14_1","volume-title":"Proceedings of the IEEE International Conference on Data Mining","author":"Pei Jian","year":"2002","unstructured":"Jian Pei , Guozhu Dong , Wei Zou , and Jiawei Han . On computing condensed frequent pattern bases . In Proceedings of the IEEE International Conference on Data Mining , 2002 .]] Jian Pei, Guozhu Dong, Wei Zou, and Jiawei Han. On computing condensed frequent pattern bases. In Proceedings of the IEEE International Conference on Data Mining, 2002.]]"}],"event":{"name":"KDD04: ACM SIGKDD International Conference on Knowledge Discovery and Data Mining","location":"Seattle WA USA","acronym":"KDD04","sponsor":["SIGMOD ACM Special Interest Group on Management of Data","SIGKDD ACM Special Interest Group on Knowledge Discovery in Data","ACM Association for Computing Machinery"]},"container-title":["Proceedings of the tenth ACM SIGKDD international conference on Knowledge discovery and data mining"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1014052.1014057","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/1014052.1014057","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T16:31:29Z","timestamp":1750264289000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1014052.1014057"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2004,8,22]]},"references-count":14,"alternative-id":["10.1145\/1014052.1014057","10.1145\/1014052"],"URL":"https:\/\/doi.org\/10.1145\/1014052.1014057","relation":{},"subject":[],"published":{"date-parts":[[2004,8,22]]},"assertion":[{"value":"2004-08-22","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}