{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,19]],"date-time":"2025-06-19T04:27:30Z","timestamp":1750307250521,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":22,"publisher":"ACM","license":[{"start":{"date-parts":[[2011,3,21]],"date-time":"2011-03-21T00:00:00Z","timestamp":1300665600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"DOI":"10.13039\/501100004963","name":"Seventh Framework Programme","doi-asserted-by":"publisher","award":["BISON-211898"],"award-info":[{"award-number":["BISON-211898"]}],"id":[{"id":"10.13039\/501100004963","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2011,3,21]]},"DOI":"10.1145\/1951365.1951410","type":"proceedings-article","created":{"date-parts":[[2011,3,22]],"date-time":"2011-03-22T12:25:29Z","timestamp":1300796729000},"page":"367-376","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":20,"title":["Finding closed frequent item sets by intersecting transactions"],"prefix":"10.1145","author":[{"given":"Christian","family":"Borgelt","sequence":"first","affiliation":[{"name":"European Centre for Soft Computing, Mieres (Asturias), Spain"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Xiaoyuan","family":"Yang","sequence":"additional","affiliation":[{"name":"Telefonica Research, Via Augusta, Barcelona"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ruben","family":"Nogales-Cadenas","sequence":"additional","affiliation":[{"name":"Universidad Complutense, Madrid, Spain"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Pedro","family":"Carmona-Saez","sequence":"additional","affiliation":[{"name":"Universidad Complutense, Madrid, Spain"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Alberto","family":"Pascual-Montano","sequence":"additional","affiliation":[{"name":"National Center for Biotechnology-CSIC, Madrid, Spain"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2011,3,21]]},"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. Verkamo . Fast discovery of association rules . In U. Fayyad, G. Piatetsky-Shapiro, P. Smyth, and R. Uthurusamy, editors, Advances in Knowledge Discovery and Data Mining , pages 307 -- 328 . AAAI Press \/ MIT Press , Cambridge, CA, USA , 1996 . R. Agrawal, H. Mannila, R. Srikant, H. Toivonen, and A. Verkamo. Fast discovery of association rules. In U. Fayyad, G. Piatetsky-Shapiro, P. Smyth, and R. Uthurusamy, editors, Advances in Knowledge Discovery and Data Mining, pages 307--328. AAAI Press \/ MIT Press, Cambridge, CA, USA, 1996."},{"key":"e_1_3_2_1_2_1","volume-title":"Proc. 20th Int. Conf. on Very Large Databases (VLDB 1994","author":"Agrawal R.","year":"1994","unstructured":"R. Agrawal and R. Srikant . Fast algorithms for mining association rules . In Proc. 20th Int. Conf. on Very Large Databases (VLDB 1994 , Santiago de Chile), pages 487--499, San Mateo, CA, USA , 1994 . Morgan Kaufmann. R. Agrawal and R. Srikant. Fast algorithms for mining association rules. In Proc. 20th Int. Conf. on Very Large Databases (VLDB 1994, Santiago de Chile), pages 487--499, San Mateo, CA, USA, 1994. Morgan Kaufmann."},{"key":"e_1_3_2_1_3_1","volume-title":"Proc. 13th Int. Fuzzy Systems Association World Congress and 6th Conf. of the European Society for Fuzzy Logic and Technology (IFSA\/EUSFLAT'09","author":"Borgelt C.","year":"2009","unstructured":"C. Borgelt and X. Wang . SaM: A split and merge algorithm for fuzzy frequent item set mining . In Proc. 13th Int. Fuzzy Systems Association World Congress and 6th Conf. of the European Society for Fuzzy Logic and Technology (IFSA\/EUSFLAT'09 , Lisbon, Portugal), Lisbon, Portugal , 2009 . IFSA\/EUSFLAT Organization Committee. C. Borgelt and X. Wang. SaM: A split and merge algorithm for fuzzy frequent item set mining. In Proc. 13th Int. Fuzzy Systems Association World Congress and 6th Conf. of the European Society for Fuzzy Logic and Technology (IFSA\/EUSFLAT'09, Lisbon, Portugal), Lisbon, Portugal, 2009. IFSA\/EUSFLAT Organization Committee."},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1186\/1471-2105-7-54"},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1093\/bioinformatics\/19.1.79"},{"key":"e_1_3_2_1_6_1","volume-title":"Proc. 4th IEEE International Conference on Data Mining (ICDM 2004","author":"Cong G.","year":"2004","unstructured":"G. Cong , K.-I. Tan , A. Tung , and F. Pan . Mining frequent closed patterns in microarray data . In Proc. 4th IEEE International Conference on Data Mining (ICDM 2004 , Brighton, UK), pages 363--366, Piscataway, NJ, USA , 2004 . IEEE Press. G. Cong, K.-I. Tan, A. Tung, and F. Pan. Mining frequent closed patterns in microarray data. In Proc. 4th IEEE International Conference on Data Mining (ICDM 2004, Brighton, UK), pages 363--366, Piscataway, NJ, USA, 2004. IEEE Press."},{"volume-title":"Proc. Workshop Frequent Item Set Mining Implementations (FIMI 2003, Melbourne, FL), Aachen, Germany, 2003. CEUR Workshop Proceedings 90","author":"Goethals B.","key":"e_1_3_2_1_7_1","unstructured":"B. Goethals and M. Zaki . Advances in frequent itemset mining implementations: Introduction to FIMI'03 . In Proc. Workshop Frequent Item Set Mining Implementations (FIMI 2003, Melbourne, FL), Aachen, Germany, 2003. CEUR Workshop Proceedings 90 . B. Goethals and M. Zaki. Advances in frequent itemset mining implementations: Introduction to FIMI'03. In Proc. Workshop Frequent Item Set Mining Implementations (FIMI 2003, Melbourne, FL), Aachen, Germany, 2003. CEUR Workshop Proceedings 90."},{"volume-title":"Proc. Workshop Frequent Item Set Mining Implementations (FIMI 2004, Brighton, UK), Aachen, Germany, 2004. CEUR Workshop Proceedings 126","author":"Goethals B.","key":"e_1_3_2_1_8_1","unstructured":"B. Goethals and M. Zaki , editors . Proc. Workshop Frequent Item Set Mining Implementations (FIMI 2004, Brighton, UK), Aachen, Germany, 2004. CEUR Workshop Proceedings 126 . B. Goethals and M. Zaki, editors. Proc. Workshop Frequent Item Set Mining Implementations (FIMI 2004, Brighton, UK), Aachen, Germany, 2004. CEUR Workshop Proceedings 126."},{"volume-title":"Proc. Workshop Frequent Item Set Mining Implementations (FIMI 2003, Melbourne, FL), Aachen, Germany, 2003. CEUR Workshop Proceedings 90","author":"Grahne G.","key":"e_1_3_2_1_9_1","unstructured":"G. Grahne and J. Zhu . Efficiently using prefix-trees in mining frequent itemsets . In Proc. Workshop Frequent Item Set Mining Implementations (FIMI 2003, Melbourne, FL), Aachen, Germany, 2003. CEUR Workshop Proceedings 90 . G. Grahne and J. Zhu. Efficiently using prefix-trees in mining frequent itemsets. In Proc. Workshop Frequent Item Set Mining Implementations (FIMI 2003, Melbourne, FL), Aachen, Germany, 2003. CEUR Workshop Proceedings 90."},{"volume-title":"Proc. Workshop Frequent Item Set Mining Implementations (FIMI 2004, Brighton, UK), Aachen, Germany, 2004. CEUR Workshop Proceedings 126","author":"Grahne G.","key":"e_1_3_2_1_10_1","unstructured":"G. Grahne and J. Zhu . Reducing the main memory consumptions of FPmax* and FPclose . In Proc. Workshop Frequent Item Set Mining Implementations (FIMI 2004, Brighton, UK), Aachen, Germany, 2004. CEUR Workshop Proceedings 126 . G. Grahne and J. Zhu. Reducing the main memory consumptions of FPmax* and FPclose. In Proc. Workshop Frequent Item Set Mining Implementations (FIMI 2004, Brighton, UK), Aachen, Germany, 2004. CEUR Workshop Proceedings 126."},{"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","doi-asserted-by":"publisher","DOI":"10.1016\/S0092-8674(00)00015-5"},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1145\/380995.381033"},{"volume-title":"Proc. Workshop Frequent Item Set Mining Implementations (FIMI 2003, Melbourne, FL), Aachen, Germany, 2003. CEUR Workshop Proceedings 90","author":"Mielik\u00e4inen T.","key":"e_1_3_2_1_14_1","unstructured":"T. Mielik\u00e4inen . Intersecting data to closed sets with constraints . In Proc. Workshop Frequent Item Set Mining Implementations (FIMI 2003, Melbourne, FL), Aachen, Germany, 2003. CEUR Workshop Proceedings 90 . T. Mielik\u00e4inen. Intersecting data to closed sets with constraints. In Proc. Workshop Frequent Item Set Mining Implementations (FIMI 2003, Melbourne, FL), Aachen, Germany, 2003. CEUR Workshop Proceedings 90."},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1145\/956750.956832"},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.5555\/998688.1007101"},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1145\/882082.882099"},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1038\/73439"},{"key":"e_1_3_2_1_19_1","volume-title":"Annual Review of Biochemistry","author":"Stoughton R.","year":"2004","unstructured":"R. Stoughton . Applications of DNA microarrays in biology . Annual Review of Biochemistry , 2004 . R. Stoughton. Applications of DNA microarrays in biology. Annual Review of Biochemistry, 2004."},{"volume-title":"Proc. Workshop Frequent Item Set Mining Implementations (FIMI 2003, Melbourne, FL), Aachen, Germany, 2003. CEUR Workshop Proceedings 90","author":"Uno T.","key":"e_1_3_2_1_20_1","unstructured":"T. Uno , T. Asai , Y. Uchida , and H. Arimura . Lcm: An efficient algorithm for enumerating frequent closed item sets . In Proc. Workshop Frequent Item Set Mining Implementations (FIMI 2003, Melbourne, FL), Aachen, Germany, 2003. CEUR Workshop Proceedings 90 . T. Uno, T. Asai, Y. Uchida, and H. Arimura. Lcm: An efficient algorithm for enumerating frequent closed item sets. In Proc. Workshop Frequent Item Set Mining Implementations (FIMI 2003, Melbourne, FL), Aachen, Germany, 2003. CEUR Workshop Proceedings 90."},{"volume-title":"Proc. Workshop Frequent Item Set Mining Implementations (FIMI 2004, Brighton, UK), Aachen, Germany, 2004. CEUR Workshop Proceedings 126","author":"Uno T.","key":"e_1_3_2_1_21_1","unstructured":"T. Uno , M. Kiyomi , and H. Arimura . Lcm ver. 2: Efficient mining algorithms for frequent\/closed\/maximal itemsets . In Proc. Workshop Frequent Item Set Mining Implementations (FIMI 2004, Brighton, UK), Aachen, Germany, 2004. CEUR Workshop Proceedings 126 . T. Uno, M. Kiyomi, and H. Arimura. Lcm ver. 2: Efficient mining algorithms for frequent\/closed\/maximal itemsets. In Proc. Workshop Frequent Item Set Mining Implementations (FIMI 2004, Brighton, UK), Aachen, Germany, 2004. CEUR Workshop Proceedings 126."},{"key":"e_1_3_2_1_22_1","volume-title":"Proc. 3rd Int. Conf. on Knowledge Discovery and Data Mining (KDD'97","author":"Zaki M.","year":"1997","unstructured":"M. Zaki , S. Parthasarathy , M. Ogihara , and W. Li . New algorithms for fast discovery of association rules . In Proc. 3rd Int. Conf. on Knowledge Discovery and Data Mining (KDD'97 , Newport Beach, CA), pages 283--296, Menlo Park, CA, USA , 1997 . AAAI Press. M. Zaki, S. Parthasarathy, M. Ogihara, and W. Li. New algorithms for fast discovery of association rules. In Proc. 3rd Int. Conf. on Knowledge Discovery and Data Mining (KDD'97, Newport Beach, CA), pages 283--296, Menlo Park, CA, USA, 1997. AAAI Press."}],"event":{"name":"EDBT\/ICDT '11: EDBT\/ICDT '11 joint conference","sponsor":["Microsoft Research Microsoft Research"],"location":"Uppsala Sweden","acronym":"EDBT\/ICDT '11"},"container-title":["Proceedings of the 14th International Conference on Extending Database Technology"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1951365.1951410","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/1951365.1951410","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T10:52:14Z","timestamp":1750243934000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1951365.1951410"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011,3,21]]},"references-count":22,"alternative-id":["10.1145\/1951365.1951410","10.1145\/1951365"],"URL":"https:\/\/doi.org\/10.1145\/1951365.1951410","relation":{},"subject":[],"published":{"date-parts":[[2011,3,21]]},"assertion":[{"value":"2011-03-21","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}