{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,10,4]],"date-time":"2026-10-04T09:55:49Z","timestamp":1791107749803,"version":"4.1.0"},"publisher-location":"Berlin, Heidelberg","reference-count":18,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783540260769","type":"print"},{"value":"9783540319351","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2005]]},"DOI":"10.1007\/11430919_76","type":"book-chapter","created":{"date-parts":[[2010,9,7]],"date-time":"2010-09-07T06:06:46Z","timestamp":1283839606000},"page":"661-671","source":"Crossref","is-referenced-by-count":20,"title":["An Efficient Framework for Mining Flexible Constraints"],"prefix":"10.1007","author":[{"given":"Arnaud","family":"Soulet","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Bruno","family":"Cr\u00e9milleux","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","reference":[{"key":"76_CR1","unstructured":"Agrawal, R., Srikant, R.: Fast algorithms for mining association rules. In: Proc. 20th Int. Conf. Very Large Data Bases, VLDB, pp. 432\u2013444 (1994)"},{"key":"76_CR2","doi-asserted-by":"crossref","unstructured":"Bonchi, F., Lucchese, C.: On closed constrained frequent pattern mining. In: Proceedings of ICDM 2004, pp. 35\u201342 (2004)","DOI":"10.1109\/ICDM.2004.10093"},{"issue":"1","key":"76_CR3","doi-asserted-by":"publisher","first-page":"5","DOI":"10.1023\/A:1021571501451","volume":"7","author":"J.F. Boulicaut","year":"2003","unstructured":"Boulicaut, J.F., Bykowski, A., Rigotti, C.: Free-sets: a condensed representation of boolean data for the approximation of frequency queries. Data Mining and Knowledge Discovery journal\u00a07(1), 5\u201322 (2003)","journal-title":"Data Mining and Knowledge Discovery journal"},{"key":"76_CR4","series-title":"Lecture Notes in Artificial Intelligence","doi-asserted-by":"publisher","first-page":"71","DOI":"10.1007\/978-3-540-39804-2_9","volume-title":"Knowledge Discovery in Databases: PKDD 2003","author":"T. Calders","year":"2003","unstructured":"Calders, T., Goethals, B.: Minimal k-free representations of frequent sets. In: Lavra\u010d, N., Gamberger, D., Todorovski, L., Blockeel, H. (eds.) PKDD 2003. LNCS (LNAI), vol.\u00a02838, pp. 71\u201382. Springer, Heidelberg (2003)"},{"key":"76_CR5","doi-asserted-by":"crossref","unstructured":"De Raedt, L., J\u00e4ger, M., Lee, S.D., Mannila, H.: A theory of inductive query answering. In: Proceedings of ICDM 2002, Maebashi, Japan, pp. 123\u2013130 (2002)","DOI":"10.1109\/ICDM.2002.1183894"},{"key":"76_CR6","doi-asserted-by":"crossref","unstructured":"Dong, G., Li, J.: Efficient mining of emerging patterns: Discovering trends and differences. In: Knowledge Discovery and Data Mining, pp. 43\u201352 (1999)","DOI":"10.1145\/312129.312191"},{"key":"76_CR7","doi-asserted-by":"crossref","unstructured":"Gade, K., Wang, J., Karypis, G.: Efficient closed pattern mining in the presence of tough block constraints. In: Proceedings of ACM SIGKDD, pp. 138\u2013147 (2004)","DOI":"10.1145\/1014052.1014070"},{"key":"76_CR8","doi-asserted-by":"crossref","unstructured":"Imielinski, T., Mannila, H.: A database perspective on knowledge discovery. In: Communication of the ACM, pp. 58\u201364 (1996)","DOI":"10.1145\/240455.240472"},{"key":"76_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"89","DOI":"10.1007\/978-3-540-31841-5_6","volume-title":"Knowledge Discovery in Inductive Databases","author":"B. Jeudy","year":"2005","unstructured":"Jeudy, B., Rioult, F.: Database transposition for constrained (closed) pattern mining. In: Goethals, B., Siebes, A. (eds.) KDID 2004. LNCS, vol.\u00a03377, pp. 89\u2013107. Springer, Heidelberg (2005)"},{"key":"76_CR10","doi-asserted-by":"crossref","unstructured":"Kiefer, D., Gehrke, J., Bucila, C., White, W.: How to quickly find a witness. In: Proceedings of ACM SIGMOD\/PODS 2003 Conference, pp. 272\u2013283 (2003)","DOI":"10.1145\/773153.773180"},{"key":"76_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"247","DOI":"10.1007\/3-540-46019-5_19","volume-title":"Soft-Ware 2002: Computing in an Imperfect World","author":"M. Kryszkiewicz","year":"2002","unstructured":"Kryszkiewicz, M.: Inferring knowledge from frequent patterns. In: Bustard, D.W., Liu, W., Sterritt, R. (eds.) Soft-Ware 2002. LNCS, vol.\u00a02311, pp. 247\u2013262. Springer, Heidelberg (2002)"},{"issue":"3","key":"76_CR12","doi-asserted-by":"publisher","first-page":"241","DOI":"10.1023\/A:1009796218281","volume":"1","author":"H. Mannila","year":"1997","unstructured":"Mannila, H., Toivonen, H.: Levelwise search and borders of theories in knowledge discovery. Data Mining and Knowledge Discovery\u00a01(3), 241\u2013258 (1997)","journal-title":"Data Mining and Knowledge Discovery"},{"key":"76_CR13","doi-asserted-by":"crossref","unstructured":"Ng, R.T., Lakshmanan, L.V.S., Han, J.: Exploratory mining and pruning optimizations of constrained associations rules. In: Proceedings of SIGMOD (1998)","DOI":"10.1145\/276304.276307"},{"key":"76_CR14","doi-asserted-by":"crossref","unstructured":"Pasquier, N., Bastide, Y., Taouil, R., Lakhal, L.: Discovering frequent closed itemsets for association rules. LNCS. Springer, Heidelberg (1999)","DOI":"10.1007\/3-540-49257-7_25"},{"key":"76_CR15","unstructured":"Pei, J., Han, J., Lakshmanan, L.V.S.: Mining frequent item sets with convertible constraints. In: Proceedings of ICDE, pp. 433\u2013442 (2001)"},{"key":"76_CR16","series-title":"Lecture Notes in Artificial Intelligence","doi-asserted-by":"publisher","first-page":"127","DOI":"10.1007\/978-3-540-24775-3_16","volume-title":"Advances in Knowledge Discovery and Data Mining","author":"A. Soulet","year":"2004","unstructured":"Soulet, A., Cr\u00e9milleux, B., Rioult, F.: Condensed representation of emerging patterns. In: Dai, H., Srikant, R., Zhang, C. (eds.) PAKDD 2004. LNCS (LNAI), vol.\u00a03056, pp. 127\u2013132. Springer, Heidelberg (2004)"},{"key":"76_CR17","unstructured":"Soulet, A., Cr\u00e9milleux, B.: A general framework designed for constraint-based mining. Technical report, Universit\u00e9 de Caen, Caen, France (2004)"},{"key":"76_CR18","doi-asserted-by":"crossref","unstructured":"Wang, K., Jiang, Y., Yu, J.X., Dong, G., Han, J.: Pushing aggregate constraints by divide-and-approximate. In: Proceedings of ICDE, pp. 291\u2013302 (2003)","DOI":"10.1109\/ICDE.2003.1260800"}],"container-title":["Lecture Notes in Computer Science","Advances in Knowledge Discovery and Data Mining"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11430919_76.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,2,25]],"date-time":"2025-02-25T16:17:24Z","timestamp":1740500244000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11430919_76"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2005]]},"ISBN":["9783540260769","9783540319351"],"references-count":18,"URL":"https:\/\/doi.org\/10.1007\/11430919_76","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2005]]}}}