{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,24]],"date-time":"2026-03-24T16:26:35Z","timestamp":1774369595754,"version":"3.50.1"},"publisher-location":"New York, NY, USA","reference-count":17,"publisher":"ACM","content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2005,3,13]]},"DOI":"10.1145\/1066677.1066791","type":"proceedings-article","created":{"date-parts":[[2005,8,3]],"date-time":"2005-08-03T04:31:47Z","timestamp":1123043507000},"page":"498-502","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":1,"title":["A \"Go With the Winners\" approach to finding frequent patterns"],"prefix":"10.1145","author":[{"given":"Todd","family":"Ebert","sequence":"first","affiliation":[{"name":"California State University, Long Beach"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Darin","family":"Goldstein","sequence":"additional","affiliation":[{"name":"California State University, Long Beach"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2005,3,13]]},"reference":[{"key":"e_1_3_2_1_1_1","first-page":"307","volume-title":"Advances in Knowledge Discovery and Data Mining","author":"Agrawal R.","year":"1996","unstructured":"R. Agrawal , H. Mannila , R. Srikant , H. Toivonen , and A. Inkeri Verkamo . Fast discovery of association rules. In U. Fayyad etal, editor , Advances in Knowledge Discovery and Data Mining , pages 307 -- 328 , Menlo Park, CA , 1996 . R. Agrawal, H. Mannila, R. Srikant, H. Toivonen, and A. Inkeri Verkamo. Fast discovery of association rules. In U. Fayyad etal, editor, Advances in Knowledge Discovery and Data Mining, pages 307--328, Menlo Park, CA, 1996."},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1145\/170035.170072"},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1109\/SFCS.1994.365742"},{"key":"e_1_3_2_1_4_1","volume-title":"UCI repository of machine learning databases","author":"Blake C. L.","year":"1998","unstructured":"C. L. Blake and C. J. Merz . UCI repository of machine learning databases , 1998 . C. L. Blake and C. J. Merz. UCI repository of machine learning databases, 1998."},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1016\/0167-6377(94)90065-5"},{"key":"e_1_3_2_1_6_1","volume-title":"An inequality limiting the number of maximal frequent sets, dimacs technical report 2000-37, rutgers university. Technical report","author":"Boros Endre","year":"2000","unstructured":"Endre Boros , Vladimir Gurvich , Leonid Khachiyan , and Kazuhisa Makino . An inequality limiting the number of maximal frequent sets, dimacs technical report 2000-37, rutgers university. Technical report , 2000 . Endre Boros, Vladimir Gurvich, Leonid Khachiyan, and Kazuhisa Makino. An inequality limiting the number of maximal frequent sets, dimacs technical report 2000-37, rutgers university. Technical report, 2000."},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.5555\/646516.696307"},{"key":"e_1_3_2_1_8_1","volume-title":"Sixth International Workshop on Artificial Intelligence and Statistics","author":"Boyan J.","year":"1997","unstructured":"J. Boyan and A. Moore . Using prediction to improve combinatorial optimization search . In Sixth International Workshop on Artificial Intelligence and Statistics , 1997 . J. Boyan and A. Moore. Using prediction to improve combinatorial optimization search. In Sixth International Workshop on Artificial Intelligence and Statistics, 1997."},{"key":"e_1_3_2_1_9_1","volume-title":"Universit Libre de Bruxelles","author":"Blum C.","year":"2001","unstructured":"C. Blum and A. Roli . Metaheuristics in Combinatorial Optimization: Overview and Conceptual Comparison Technical report TR\/IRIDIA\/2001-13, IRIDIA , Universit Libre de Bruxelles , Belgium , 2001 . C. Blum and A. Roli. Metaheuristics in Combinatorial Optimization: Overview and Conceptual Comparison Technical report TR\/IRIDIA\/2001-13, IRIDIA, Universit Libre de Bruxelles, Belgium, 2001."},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1007\/BF01096763"},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1145\/777943.777945"},{"key":"e_1_3_2_1_12_1","first-page":"215","volume-title":"ICDT","author":"Gunopulos Dimitrios","year":"1997","unstructured":"Dimitrios Gunopulos , Heikki Mannila , and Sanjeev Saluja . Discovering all most specific sentences by randomized algorithms . In ICDT , pages 215 -- 229 , 1997 . Dimitrios Gunopulos, Heikki Mannila, and Sanjeev Saluja. Discovering all most specific sentences by randomized algorithms. In ICDT, pages 215--229, 1997."},{"key":"e_1_3_2_1_13_1","first-page":"181","volume-title":"AAAI Workshop on Knowledge Discovery in Databases (KDD-94)","author":"Mannila Heikki","year":"1994","unstructured":"Heikki Mannila , Hannu Toivonen , and A. Inkeri Verkamo . Efficient algorithms for discovering association rules. In Usama M. Fayyad and Ramasamy Uthurusamy, editors , AAAI Workshop on Knowledge Discovery in Databases (KDD-94) , pages 181 -- 192 , Seattle, Washington , 1994 . AAAI Press. Heikki Mannila, Hannu Toivonen, and A. Inkeri Verkamo. Efficient algorithms for discovering association rules. In Usama M. Fayyad and Ramasamy Uthurusamy, editors, AAAI Workshop on Knowledge Discovery in Databases (KDD-94), pages 181--192, Seattle, Washington, 1994. AAAI Press."},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1145\/272991.272995"},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1145\/276304.276313"},{"key":"e_1_3_2_1_16_1","volume-title":"Modern Heuristic Search Methods","author":"Rayward-Smith V. J.","year":"1996","unstructured":"V. J. Rayward-Smith , I. H. Osman , C. R. Reeves , and G. D. Smith . Modern Heuristic Search Methods . John Wiley and Sons , New York , 1996 . V. J. Rayward-Smith, I. H. Osman, C. R. Reeves, and G. D. Smith. Modern Heuristic Search Methods. John Wiley and Sons, New York, 1996."},{"key":"e_1_3_2_1_17_1","unstructured":"M. Yagiura and T. Ibaraki. On metaheuristic algorithms for combinatorial optimization problems. Transactions of the Institute of Electronics Information and Communication Engineers J83-D-1(1):3--25.  M. Yagiura and T. Ibaraki. On metaheuristic algorithms for combinatorial optimization problems. Transactions of the Institute of Electronics Information and Communication Engineers J83-D-1(1):3--25."}],"event":{"name":"SAC05: The 2005 ACM Symposium on Applied Computing","location":"Santa Fe New Mexico","acronym":"SAC05","sponsor":["SIGAPP ACM Special Interest Group on Applied Computing"]},"container-title":["Proceedings of the 2005 ACM symposium on Applied computing"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/1066677.1066791","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,1,7]],"date-time":"2023-01-07T14:23:11Z","timestamp":1673101391000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1066677.1066791"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2005,3,13]]},"references-count":17,"alternative-id":["10.1145\/1066677.1066791","10.1145\/1066677"],"URL":"https:\/\/doi.org\/10.1145\/1066677.1066791","relation":{},"subject":[],"published":{"date-parts":[[2005,3,13]]},"assertion":[{"value":"2005-03-13","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}