{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,12,22]],"date-time":"2025-12-22T22:04:03Z","timestamp":1766441043120},"publisher-location":"Cham","reference-count":31,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319457628"},{"type":"electronic","value":"9783319457635"}],"license":[{"start":{"date-parts":[[2016,11,4]],"date-time":"2016-11-04T00:00:00Z","timestamp":1478217600000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2017]]},"DOI":"10.1007\/978-3-319-45763-5_4","type":"book-chapter","created":{"date-parts":[[2016,11,3]],"date-time":"2016-11-03T12:25:45Z","timestamp":1478175945000},"page":"61-81","source":"Crossref","is-referenced-by-count":3,"title":["Exact and Approximate Minimal Pattern Mining"],"prefix":"10.1007","author":[{"given":"Arnaud","family":"Soulet","sequence":"first","affiliation":[]},{"given":"Fran\u00e7ois","family":"Rioult","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2016,11,4]]},"reference":[{"key":"4_CR1","doi-asserted-by":"crossref","unstructured":"Arimura, H., & Uno, T. (2009). Polynomial-delay and polynomial-space algorithms for mining closed sequences, graphs, and pictures in accessible set systems. In SDM (pp. 1087\u20131098). SIAM.","DOI":"10.1137\/1.9781611972795.93"},{"key":"4_CR2","doi-asserted-by":"crossref","unstructured":"Boulicaut, J.-F., Bykowski, A., & Rigotti, C. (2000). Approximation of frequency queries by means of free-sets. In D. A. Zighed, J. Komorowski & J. \u017bytkow (Eds.), PKDD. LNCS (Vol. 1910, pp. 75\u201385). Heidelberg: Springer.","DOI":"10.1007\/3-540-45372-5_8"},{"issue":"1","key":"4_CR3","doi-asserted-by":"crossref","first-page":"5","DOI":"10.1023\/A:1021571501451","volume":"7","author":"J-F Boulicaut","year":"2003","unstructured":"Boulicaut, J.-F., Bykowski, A., & Rigotti, C. (2003). Free-sets: A condensed representation of boolean data for the approximation of frequency queries. Data Mining and Knowledge Discovery, 7(1), 5\u201322.","journal-title":"Data Mining and Knowledge Discovery"},{"key":"4_CR4","doi-asserted-by":"crossref","unstructured":"Calders, T., & Goethals, B. (2003). Minimal k-free representations of frequent sets. In Proceedings of the 7th European Conference on Principles and Practice of Knowledge Discovery in Databases (PKDD 2003) (pp. 71\u201382). Heidelberg: Springer.","DOI":"10.1007\/978-3-540-39804-2_9"},{"key":"4_CR5","doi-asserted-by":"crossref","unstructured":"Calders, T., & Goethals, B. (2005). Depth-first non-derivable itemset mining. In SDM (pp. 250\u2013261).","DOI":"10.1137\/1.9781611972757.23"},{"key":"4_CR6","doi-asserted-by":"crossref","unstructured":"Calders, T., Rigotti, C., & Boulicaut, J. F. (2004). A survey on condensed representations for frequent sets. In J.-F. Boulicaut, L. De Raedt, & H. Mannila (Eds.), Constraint-based mining and inductive databases. Lecture notes in computer science (Vol. 3848, pp. 64\u201380). Heidelberg: Springer.","DOI":"10.1007\/11615576_4"},{"key":"4_CR7","doi-asserted-by":"crossref","unstructured":"Casali, A., Cicchetti, R., & Lakhal, L. (2005). Essential patterns: A perfect cover of frequent patterns. In A. M. Tjoa & J. Trujillo (Eds.), DaWaK. Lecture notes in computer science (Vol. 3589, pp. 428\u2013437). Heidelberg: Springer.","DOI":"10.1007\/11546849_42"},{"key":"4_CR8","doi-asserted-by":"crossref","first-page":"33","DOI":"10.1007\/978-1-4471-0651-7_3","volume-title":"Research and development in intelligent systems XIX","author":"B Cr\u00e9milleux","year":"2003","unstructured":"Cr\u00e9milleux, B., & Boulicaut, J.-F. (2003). Simplest rules characterizing classes generated by $$\\delta $$ \u03b4 -free sets. In M. Bramer, A. Preece, & F. Coenen (Eds.), Research and development in intelligent systems XIX (pp. 33\u201346). London: Springer."},{"key":"4_CR9","doi-asserted-by":"crossref","unstructured":"Eiter, T., & Gottlob, G. (2002). Hypergraph transversal computation and related problems in logic and AI. In S. Flesca, S. Greco, G. Ianni, & N. Leone (Eds.), JELIA. Lecture notes in computer science (Vol. 2424, pp. 549\u2013564). Heidelberg: Springer.","DOI":"10.1007\/3-540-45757-7_53"},{"key":"4_CR10","doi-asserted-by":"crossref","unstructured":"Gao, C., Wang, J., He, Y., & Zhou, L. (2008). Efficient mining of frequent sequence generators. In WWW (pp. 1051\u20131052). ACM.","DOI":"10.1145\/1367497.1367651"},{"key":"4_CR11","doi-asserted-by":"crossref","unstructured":"Gasmi, G., Yahia, S. B., Nguifo, E. M., & Bouker, S. (2007). Extraction of association rules based on literalsets. In Y. Song, J. Eder, & T. M. Nguyen (Eds.), DaWaK. Lecture notes in computer science (Vol. 4654, pp. 293\u2013302). Heidelberg: Springer.","DOI":"10.1007\/978-3-540-74553-2_27"},{"issue":"1","key":"4_CR12","doi-asserted-by":"crossref","first-page":"41","DOI":"10.1145\/2594473.2594480","volume":"15","author":"A Giacometti","year":"2013","unstructured":"Giacometti, A., Li, D. H., Marcel, P., & Soulet, A. (2013). 20 years of pattern mining: a bibliometric survey. SIGKDD Explorations, 15(1), 41\u201350.","journal-title":"SIGKDD Explorations"},{"issue":"4","key":"4_CR13","doi-asserted-by":"crossref","first-page":"581","DOI":"10.3233\/IDA-2012-0540","volume":"16","author":"T Hamrouni","year":"2012","unstructured":"Hamrouni, T. (2012). Key roles of closed sets and minimal generators in concise representations of frequent patterns. Intelligent Data Analysis, 16(4), 581\u2013631.","journal-title":"Intelligent Data Analysis"},{"key":"4_CR14","doi-asserted-by":"crossref","unstructured":"H\u00e9bert, C., & Cr\u00e9milleux, B. (2005). Mining frequent delta-free patterns in large databases. In A. Hoffmann, H. Motoda, & T. Scheffer (Eds.), Discovery science. Lecture notes in computer science (Vol. 3735, pp. 124\u2013136). Heidelberg: Springer.","DOI":"10.1007\/11563983_12"},{"key":"4_CR15","doi-asserted-by":"crossref","first-page":"30","DOI":"10.1016\/j.jss.2013.06.061","volume":"94","author":"MN Jelassi","year":"2014","unstructured":"Jelassi, M. N., Largeron, C., & Yahia, S. B. (2014). Efficient unveiling of multi-members in a social network. Journal of Systems and Software, 94, 30\u201338.","journal-title":"Journal of Systems and Software"},{"issue":"1\u20132","key":"4_CR16","doi-asserted-by":"crossref","first-page":"63","DOI":"10.1080\/09528130512331315882","volume":"17","author":"M Kryszkiewicz","year":"2005","unstructured":"Kryszkiewicz, M. (2005). Generalized disjunction-free representation of frequent patterns with negation. Journal of Experimental and Theoretical Artificial Intelligence, 17(1\u20132), 63\u201382.","journal-title":"Journal of Experimental and Theoretical Artificial Intelligence"},{"key":"4_CR17","unstructured":"Li, J., Li, H., Wong, L., Pei, J. & Dong, G. (2006). Minimum description length principle: Generators are preferable to closed patterns. In AAAI (pp. 409\u2013414)."},{"key":"4_CR18","unstructured":"Liu, B., Hsu, W. & Ma, Y. (1998). Integrating classification and association rule mining. In KDD (pp. 80\u201386)."},{"issue":"1","key":"4_CR19","doi-asserted-by":"crossref","first-page":"35","DOI":"10.1007\/s10115-007-0111-5","volume":"17","author":"G Liu","year":"2008","unstructured":"Liu, G., Li, J., & Wong, L. (2008). A new concise representation of frequent itemsets using generators and a positive border. Knowledge and Information Systems, 17(1), 35\u201356.","journal-title":"Knowledge and Information Systems"},{"key":"4_CR20","doi-asserted-by":"crossref","unstructured":"Lo, D., Khoo, S. -C., & Li, J. (2008). Mining and ranking generators of sequential patterns. In SDM (pp. 553\u2013564). SIAM.","DOI":"10.1137\/1.9781611972788.51"},{"issue":"4\u20135","key":"4_CR21","doi-asserted-by":"crossref","first-page":"438","DOI":"10.1016\/j.is.2009.01.002","volume":"34","author":"D Lo","year":"2009","unstructured":"Lo, D., Khoo, S.-C., & Wong, L. (2009). Non-redundant sequential rules-theory and algorithm. Information Systems, 34(4\u20135), 438\u2013453.","journal-title":"Information Systems"},{"key":"4_CR22","unstructured":"Mannila, H. & Toivonen, H. (1996). Multiple uses of frequent sets and condensed representations (extended abstract). In E. Simoudis, J. Han & U. M. Fayyad (Eds.), Proceedings of the Second International Conference on Knowledge Discovery and Data Mining (KDD-96), Portland, Oregon, USA (pp. 189\u2013194). AAAI Press."},{"key":"4_CR23","doi-asserted-by":"crossref","unstructured":"Murakami, K. & Uno, T. (2013). Efficient algorithms for dualizing large-scale hypergraphs. In ALENEX (pp. 1\u201313).","DOI":"10.1137\/1.9781611972931.1"},{"issue":"1","key":"4_CR24","doi-asserted-by":"crossref","first-page":"25","DOI":"10.1016\/S0306-4379(99)00003-4","volume":"24","author":"N Pasquier","year":"1999","unstructured":"Pasquier, N., Bastide, Y., Taouil, R., & Lakhal, L. (1999). Efficient mining of association rules using closed itemset lattices. Information Systems, 24(1), 25\u201346.","journal-title":"Information Systems"},{"key":"4_CR25","doi-asserted-by":"crossref","unstructured":"Rioult, F., Zanuttini, B., & Cr\u00e9milleux, B. (2010). Nonredundant generalized rules and their impact in classification. In Z. W. Ras & L.-S. Tsay (Eds.), Advances in intelligent information systems. Studies in computational intelligence (Vol. 265, pp. 3\u201325). Heidelberg: Springer.","DOI":"10.1007\/978-3-642-05183-8_1"},{"issue":"1","key":"4_CR26","doi-asserted-by":"crossref","first-page":"94","DOI":"10.1007\/s10618-008-0111-4","volume":"17","author":"A Soulet","year":"2008","unstructured":"Soulet, A., & Cr\u00e9milleux, B. (2008). Adequate condensed representations of patterns. Data Mining and Knowledge Discovery, 17(1), 94\u2013110.","journal-title":"Data Mining and Knowledge Discovery"},{"key":"4_CR27","unstructured":"Soulet, A., Cr\u00e9milleux, B., & Rioult, F. (2004). Condensed representation of EPs and patterns quantified by frequency-based measures. In Post-proceedings of knowledge discovery in inductive databases, pise. Heidelberg: Springer."},{"key":"4_CR28","doi-asserted-by":"crossref","unstructured":"Soulet, A., & Rioult, F. (2014). Efficiently depth-first minimal pattern mining. In V. S. Tseng., T. B. Ho., Z. Zhou., A. L. P. Chen., & H. Kao (Eds.), Proceedings 18th Pacific-Asia Conference on Advances in Knowledge Discovery and Data Mining, PAKDD 2014, Part I, Tainan, Taiwan, May 13\u201316, 2014. Lecture notes in computer science (Vol. 8443, pp. 28\u201339). Heidelberg: Springer.","DOI":"10.1007\/978-3-319-06608-0_3"},{"key":"4_CR29","doi-asserted-by":"crossref","unstructured":"Szathmary, L., Valtchev, P., Napoli, A., & Godin, R. (2009). Efficient vertical mining of frequent closures and generators. In IDA. LNCS (Vol. 5772, pp. 393\u2013404). Heidelberg: Springer.","DOI":"10.1007\/978-3-642-03915-7_34"},{"key":"4_CR30","doi-asserted-by":"crossref","unstructured":"Zaki, M.J. (2000). Generating non-redundant association rules. In KDD (pp. 34\u201343).","DOI":"10.1145\/347090.347101"},{"key":"4_CR31","doi-asserted-by":"crossref","unstructured":"Zeng, Z., Wang, J., Zhang, J., & Zhou, L. (2009). FOGGER: an algorithm for graph generator discovery. In EDBT (pp. 517\u2013528).","DOI":"10.1145\/1516360.1516421"}],"container-title":["Studies in Computational Intelligence","Advances in Knowledge Discovery and Management"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-45763-5_4","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,9,15]],"date-time":"2019-09-15T03:47:16Z","timestamp":1568519236000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-45763-5_4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016,11,4]]},"ISBN":["9783319457628","9783319457635"],"references-count":31,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-45763-5_4","relation":{},"ISSN":["1860-949X","1860-9503"],"issn-type":[{"type":"print","value":"1860-949X"},{"type":"electronic","value":"1860-9503"}],"subject":[],"published":{"date-parts":[[2016,11,4]]}}}