{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,19]],"date-time":"2025-06-19T04:56:23Z","timestamp":1750308983880,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":15,"publisher":"ACM","license":[{"start":{"date-parts":[[2004,6,13]],"date-time":"2004-06-13T00:00:00Z","timestamp":1087084800000},"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,6,13]]},"DOI":"10.1145\/1008694.1008706","type":"proceedings-article","created":{"date-parts":[[2004,7,20]],"date-time":"2004-07-20T15:55:38Z","timestamp":1090338938000},"page":"70-75","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":12,"title":["COFI approach for mining frequent itemsets revisited"],"prefix":"10.1145","author":[{"given":"Mohammad","family":"El-Hajj","sequence":"first","affiliation":[{"name":"University of Alberta, Edmonton, AB, Canada"}]},{"given":"Osmar R.","family":"Za\u00efane","sequence":"additional","affiliation":[{"name":"University of Alberta, Edmonton, AB, Canada"}]}],"member":"320","published-online":{"date-parts":[[2004,6,13]]},"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","first-page":"487","volume-title":"Proc. 1994 Int. Conf. Very Large Data Bases","author":"Agrawal R.","year":"1994","unstructured":"R. Agrawal and R. Srikant . Fast algorithms for mining association rules . In Proc. 1994 Int. Conf. Very Large Data Bases , pages 487 -- 499 , Santiago, Chile , September 1994 . R. Agrawal and R. Srikant. Fast algorithms for mining association rules. In Proc. 1994 Int. Conf. Very Large Data Bases, pages 487--499, Santiago, Chile, September 1994."},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1145\/276304.276313"},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1145\/775047.775110"},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.5555\/645484.656386"},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1145\/956750.956766"},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-45228-7_37"},{"key":"e_1_3_2_1_8_1","unstructured":"B. Goethals. Frequent pattern mining implementations. http:\/\/www.cs.helsinki.fi\/u\/goethals\/software\/index.html.  B. Goethals. Frequent pattern mining implementations. http:\/\/www.cs.helsinki.fi\/u\/goethals\/software\/index.html."},{"key":"e_1_3_2_1_9_1","volume-title":"Workshop on Frequent Itemset Mining Implementations (FIMI'03)","author":"Goethals B.","year":"2003","unstructured":"B. Goethals and M. Zaki . Advances in frequent itemset mining implementations: Introduction to fimi03 . In Workshop on Frequent Itemset Mining Implementations (FIMI'03) in conjunction with IEEE-ICDM, 2003 . B. Goethals and M. Zaki. Advances in frequent itemset mining implementations: Introduction to fimi03. In Workshop on Frequent Itemset Mining Implementations (FIMI'03) in conjunction with IEEE-ICDM, 2003."},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.5555\/645496.658047"},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1145\/342009.335372"},{"key":"e_1_3_2_1_12_1","unstructured":"IBM_Almaden. Quest synthetic data generation code. http:\/\/www.almaden.ibm.com\/cs\/quest\/syndata.html.  IBM_Almaden. Quest synthetic data generation code. http:\/\/www.almaden.ibm.com\/cs\/quest\/syndata.html."},{"key":"e_1_3_2_1_13_1","volume-title":"International Logic Programming Symposium","author":"Mannila H.","year":"1997","unstructured":"H. Mannila . Inductive databases and condensed representations for data mining . In International Logic Programming Symposium , 1997 . H. Mannila. Inductive databases and condensed representations for data mining. In International Logic Programming Symposium, 1997."},{"key":"e_1_3_2_1_14_1","volume-title":"TREC","author":"Rungsawang A.","year":"1999","unstructured":"A. Rungsawang , A. Tangpong , P. Laohawee , and T. Khampachua . Novel query expansion technique using apriori algorithm . In TREC , Gaithersburg, Maryland , 1999 . A. Rungsawang, A. Tangpong, P. Laohawee, and T. Khampachua. Novel query expansion technique using apriori algorithm. In TREC, Gaithersburg, Maryland, 1999."},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1109\/69.846291"}],"event":{"name":"DMKD04: 9th ACM SIGMOD Workshop on Research Issues in Data Mining and Knowledge Discovery 2004","sponsor":["SIGMOD ACM Special Interest Group on Management of Data"],"location":"Paris France","acronym":"DMKD04"},"container-title":["Proceedings of the 9th ACM SIGMOD workshop on Research issues in data mining and knowledge discovery"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1008694.1008706","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/1008694.1008706","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T21:41:07Z","timestamp":1750282867000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1008694.1008706"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2004,6,13]]},"references-count":15,"alternative-id":["10.1145\/1008694.1008706","10.1145\/1008694"],"URL":"https:\/\/doi.org\/10.1145\/1008694.1008706","relation":{},"subject":[],"published":{"date-parts":[[2004,6,13]]},"assertion":[{"value":"2004-06-13","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}