{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T21:00:58Z","timestamp":1725570058126},"publisher-location":"New York, NY","reference-count":30,"publisher":"Springer New York","isbn-type":[{"type":"print","value":"9781441977373"},{"type":"electronic","value":"9781441977380"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2010]]},"DOI":"10.1007\/978-1-4419-7738-0_5","type":"book-chapter","created":{"date-parts":[[2010,11,17]],"date-time":"2010-11-17T20:09:01Z","timestamp":1290024541000},"page":"107-126","source":"Crossref","is-referenced-by-count":4,"title":["Generalizing Itemset Mining in a Constraint Programming Setting"],"prefix":"10.1007","author":[{"given":"J\u00e9r\u00e9my","family":"Besson","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jean-Fran\u00e7ois","family":"Boulicaut","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Tias","family":"Guns","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Siegfried","family":"Nijssen","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2010,11,18]]},"reference":[{"key":"5_CR1","unstructured":"R. Agrawal, H. Mannila, R. Srikant, H. Toivonen, and A. Verkamo. Fast discovery of association rules. In Advances in Knowledge Discovery and Data Mining, pages 307\u2013328. AAAI Press, 1996."},{"key":"5_CR2","unstructured":"S. Basu, I. Davidson, and K.Wagstaff. Constrained Clustering: Advances in Algorithms, Theory and Applications. Chapman & Hall\/CRC Press, Data Mining and Knowledge Discovery Series, 2008."},{"key":"5_CR3","doi-asserted-by":"crossref","unstructured":"J Besson, C. Robardet, and J-F. Boulicaut. Mining a new fault-tolerant pattern type as an alternative to formal concept discovery. In ICCS\u201906: Proc. Int. Conf. on Conceptual Structures, volume 4068 of LNCS. Springer, 2006.","DOI":"10.1007\/11787181_11"},{"key":"5_CR4","doi-asserted-by":"crossref","unstructured":"S. Bistarelli and F. Bonchi. Interestingness is not a dichotomy: Introducing softness in constrained pattern mining. In PKDD\u201905: Proc. 9th European Conf. on Principles and Practice of Knowledge Discovery in Databases, volume 3721 of LNCS, pages 22\u201333. Springer, 2005.","DOI":"10.1007\/11564126_8"},{"issue":"1","key":"5_CR5","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1016\/j.is.2008.02.007","volume":"34","author":"Francesco Bonchi","year":"2009","unstructured":"Francesco Bonchi, Fosca Giannotti, Claudio Lucchese, Salvatore Orlando, Raffaele Perego, and Roberto Trasarti. A constraint-based querying system for exploratory pattern discovery. Information Systems, 34(1):3\u201327, 2009.","journal-title":"Information Systems"},{"key":"5_CR6","doi-asserted-by":"crossref","unstructured":"Francesco Bonchi, Fosca Giannotti, Alessio Mazzanti, and Dino Pedreschi. Adaptive constraint pushing in frequent pattern mining. In PKDD\u201903: Proc. 7th European Conf. on Principles and Practice of Knowledge Discovery in Databases, volume 2838 of LNCS, pages 47\u201358. Springer, 2003.","DOI":"10.1007\/978-3-540-39804-2_7"},{"key":"5_CR7","doi-asserted-by":"crossref","unstructured":"Francesco Bonchi, Fosca Giannotti, Alessio Mazzanti, and Dino Pedreschi. Examiner: Optimized level-wise frequent pattern mining with monotone constraint. In ICDM 2003: Proc. 3rd International Conf. on Data Mining, pages 11\u201318. IEEE Computer Society, 2003.","DOI":"10.1109\/ICDM.2003.1250892"},{"key":"5_CR8","doi-asserted-by":"crossref","unstructured":"Jean-Fran\u00e7ois Boulicaut, Luc De Raedt, and Heikki Mannila, editors. Constraint-Based Mining and Inductive Databases, volume 3848 of LNCS. Springer, 2005.","DOI":"10.1007\/11615576"},{"issue":"4","key":"5_CR9","doi-asserted-by":"publisher","first-page":"241","DOI":"10.1023\/A:1024076020895","volume":"7","author":"C. Bucila","year":"2003","unstructured":"C. Bucila, J. E. Gehrke, D. Kifer, and W. White. Dualminer: A dual-pruning algorithm for itemsets with constraints. Data Mining and Knowledge Discovery Journal, 7(4):241\u2013272, Oct. 2003.","journal-title":"Data Mining and Knowledge Discovery Journal,"},{"key":"5_CR10","doi-asserted-by":"crossref","unstructured":"Toon Calders, Christophe Rigotti, and Jean-Fran\u00e7ois Boulicaut. A survey on condensed representations for frequent sets. In Constraint-based Mining and Inductive Databases, volume 3848 of LNCS, pages 64\u201380. Springer, 2005.","DOI":"10.1007\/11615576_4"},{"key":"5_CR11","doi-asserted-by":"crossref","unstructured":"L. Cerf, J. Besson, C. Robardet, and J.-F. Boulicaut. Closed patterns meet n-ary relations. ACM Trans. on Knowledge Discovery from Data, 3(1), March 2009.","DOI":"10.1145\/1497577.1497580"},{"key":"5_CR12","doi-asserted-by":"crossref","unstructured":"Hong Cheng, Philip S. Yu, and Jiawei Han. Ac-close: Efficiently mining approximate closed itemsets by core pattern recovery. In ICDM, pages 839\u2013844, 2006.","DOI":"10.1109\/ICDM.2006.10"},{"key":"5_CR13","doi-asserted-by":"crossref","unstructured":"Luc De Raedt, Tias Guns, and Siegfried Nijssen. Constraint programming for itemset mining. In KDD\u201908: Proc. 14th ACM SIGKDD Int. Conf. on Knowledge Discovery and Data Mining, pages 204\u2013212, 2008.","DOI":"10.1145\/1401890.1401919"},{"key":"5_CR14","unstructured":"B. Ganter. Two basic algorithms in concept analysis. Technical report, Germany Darmstadt : Technisch Hochschule Darmstadt, Preprint 831, 1984."},{"key":"5_CR15","doi-asserted-by":"crossref","unstructured":"Bernhard Ganter, Gerd Stumme, and Rudolph Wille. Formal Concept Analysis, Foundations and Applications, volume 3626 of LNCS. Springer, 2005.","DOI":"10.1007\/978-3-540-31881-1"},{"key":"5_CR16","unstructured":"B. Goethals and M. J. Zaki, editors. Frequent Itemset Mining Implementations, volume 90. CEUR-WS.org, Melbourne, Florida, USA, December 2003."},{"issue":"1","key":"5_CR17","doi-asserted-by":"publisher","first-page":"53","DOI":"10.1023\/B:DAMI.0000005258.31418.83","volume":"8","author":"Jiawei Han","year":"2004","unstructured":"Jiawei Han, Jian Pei, Yiwen Yin, and Runying Mao. Mining frequent patterns without candidate generation: A frequent-pattern tree approach. Data Mining and Knowledge Discovery, 8(1):53\u201387, 2004.","journal-title":"Data Mining and Knowledge Discovery,"},{"key":"5_CR18","doi-asserted-by":"crossref","unstructured":"David J. Hand, Niall M. Adams, and Richard J. Bolton, editors. Pattern Detection and Discovery, ESF Exploratory Workshop Proceedings, volume 2447 of LNCS. Springer, 2002.","DOI":"10.1007\/3-540-45728-3"},{"key":"5_CR19","doi-asserted-by":"crossref","unstructured":"Daniel Kifer, Johannes E. Gehrke, Cristian Bucila, andWalker M. White. How to quickly find a witness. In Constraint-Based Mining and Inductive Databases, pages 216\u2013242, 2004.","DOI":"10.1007\/11615576_11"},{"key":"5_CR20","doi-asserted-by":"crossref","unstructured":"Jinze Liu, Susan Paulsen, Xing Sun, Wei Wang, Andrew B. Nobel, and Jan Prins. Mining approximate frequent itemsets in the presence of noise: Algorithm and analysis. In SDM, 2006.","DOI":"10.1137\/1.9781611972764.36"},{"key":"5_CR21","doi-asserted-by":"crossref","unstructured":"H. Mannila and H. Toivonen. Levelwise search and borders of theories in knowledge discovery. In Data Mining and Knowledge Discovery journal, volume 1(3), pages 241\u2013258. Kluwer Academic Publishers, 1997.","DOI":"10.1023\/A:1009796218281"},{"key":"5_CR22","doi-asserted-by":"crossref","unstructured":"Katharina Morik, Jean-Fran\u00e7ois Boulicaut, and Arno Siebes, editors. Local Pattern Detection, International Dagstuhl Seminar Revised Selected Papers, volume 3539 of LNCS. Springer, 2005.","DOI":"10.1007\/b137601"},{"issue":"1","key":"5_CR23","doi-asserted-by":"publisher","first-page":"25","DOI":"10.1016\/S0306-4379(99)00003-4","volume":"24","author":"Nicolas Pasquier","year":"1999","unstructured":"Nicolas Pasquier, Yves Bastide, Rafik Taouil, and Lotfi Lakhal. Efficient mining of association rules using closed itemset lattices. Information Systems, 24(1):25\u201346, 1999.","journal-title":"Information Systems,"},{"key":"5_CR24","unstructured":"Jian Pei, Anthony K. H. Tung, and Jiawei Han. Fault-tolerant frequent pattern mining: Problems and challenges. In DMKD. Workshop, 2001."},{"key":"5_CR25","doi-asserted-by":"crossref","unstructured":"A. Soulet and B. Cr\u00e9milleux. An efficient framework for mining flexible constraints. In PaKDD\u201905: Pacific-Asia Conf. on Knowledge Discovery and Data Mining, volume 3518 of LNCS, pages 661\u2013671. Springer, 2005.","DOI":"10.1007\/11430919_76"},{"key":"5_CR26","doi-asserted-by":"crossref","unstructured":"T. Uno, M. Kiyomi, and H. Arimura. Lcm ver. 2: Efficient mining algorithms for frequent\/closed\/maximal itemsets. In FIMI\u201904, Proceedings of the IEEE ICDM Workshop on Frequent Itemset Mining Implementations, volume 126 of CEUR Workshop Proceedings. CEURWS. org, 2004.","DOI":"10.1145\/1133905.1133916"},{"key":"5_CR27","doi-asserted-by":"crossref","unstructured":"T. Uno, M. Kiyomi, and H. Arimura. LCM ver.3: collaboration of array, bitmap and prefix tree for frequent itemset mining. In OSDM\u201905: Proc. 1st Int. Workshop on Open Source Data Mining, pages 77\u201386. ACM Press, 2005.","DOI":"10.1145\/1133905.1133916"},{"key":"5_CR28","doi-asserted-by":"crossref","unstructured":"C. Yang, U. Fayyad, and P. S. Bradley. Efficient discovery of error-tolerant frequent itemsets in high dimensions. In SIGKDD, pages 194\u2013203, San Francisco, California, USA, August 2001. ACM Press.","DOI":"10.1145\/502512.502539"},{"issue":"3","key":"5_CR29","doi-asserted-by":"publisher","first-page":"372","DOI":"10.1109\/69.846291","volume":"12","author":"Mohammed J. Zaki","year":"2000","unstructured":"Mohammed J. Zaki. Scalable algorithms for association mining. IEEE Trans. Knowl. Data Eng., 12(3):372\u2013390, 2000.","journal-title":"IEEE Trans. Knowl. Data Eng."},{"key":"5_CR30","doi-asserted-by":"crossref","unstructured":"Mengsheng Zhang, Wei Wang, and Jinze Liu. Mining approximate order preserving clusters in the presence of noise. In ICDE, pages 160\u2013168, 2008.","DOI":"10.1109\/ICDE.2008.4497424"}],"container-title":["Inductive Databases and Constraint-Based Data Mining"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-1-4419-7738-0_5.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,6,4]],"date-time":"2023-06-04T06:52:38Z","timestamp":1685861558000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-1-4419-7738-0_5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010]]},"ISBN":["9781441977373","9781441977380"],"references-count":30,"URL":"https:\/\/doi.org\/10.1007\/978-1-4419-7738-0_5","relation":{},"subject":[],"published":{"date-parts":[[2010]]}}}