{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T15:36:25Z","timestamp":1725550585052},"publisher-location":"Berlin, Heidelberg","reference-count":19,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540292302"},{"type":"electronic","value":"9783540316985"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2005]]},"DOI":"10.1007\/11563983_12","type":"book-chapter","created":{"date-parts":[[2005,10,22]],"date-time":"2005-10-22T04:50:07Z","timestamp":1129956607000},"page":"124-136","source":"Crossref","is-referenced-by-count":3,"title":["Mining Frequent \u03b4-Free Patterns in Large Databases"],"prefix":"10.1007","author":[{"given":"C\u00e9line","family":"H\u00e9bert","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Bruno","family":"Cr\u00e9milleux","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"12_CR1","unstructured":"Agrawal, R., Mannila, H., Srikant, R., Toivonen, H.: Fast discovery of associations rules. In: Advances in Knowledge Discovery and Data Mining (1996)"},{"key":"12_CR2","first-page":"487","volume-title":"Proc. 20th Int. Conf. Very Large Data Bases, VLDB","author":"R. Agrawal","year":"1994","unstructured":"Agrawal, R., Srikant, R.: Fast algorithms for mining association rules. In: Bocca, J.B., Jarke, M., Zaniolo, C. (eds.) Proc. 20th Int. Conf. Very Large Data Bases, VLDB, pp. 487\u2013499. Morgan Kaufmann, San Francisco (1994)"},{"key":"12_CR3","doi-asserted-by":"crossref","unstructured":"Bayardo, R.J.: The hows, whys, and whens of constraints in itemset and rule discovery. In: Proceedings of the workshop on Inductive Databases and Constraint Based Mining (2005)","DOI":"10.1007\/11615576_1"},{"key":"12_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"62","DOI":"10.1007\/3-540-45571-X_9","volume-title":"Knowledge Discovery and Data Mining. Current Issues and New Applications","author":"J.-F. Boulicaut","year":"2000","unstructured":"Boulicaut, J.-F., Bykowski, A.: Frequent closures as a concise representation for binary data mining. In: Terano, T., Chen, A.L.P. (eds.) PAKDD 2000. LNCS, vol.\u00a01805, pp. 62\u201373. Springer, Heidelberg (2000)"},{"key":"12_CR5","doi-asserted-by":"crossref","unstructured":"Boulicaut, J.-F., Bykowski, A., Rigotti, C.: Approximation of frequency queries by means of free-sets. In: The Fourth European Conference on Principles and Practice of Knowledge Discovery in Databases, Lyon (2000)","DOI":"10.1007\/3-540-45372-5_8"},{"issue":"1","key":"12_CR6","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":"12_CR7","doi-asserted-by":"crossref","unstructured":"Cr\u00e9milleux, B., Boulicaut, J.-F.: Simplest rules characterizing classes generated by delta-free sets. In: 22nd Int. Conf. on Knowledge Based Systems and Applied Artificial Intelligence (ES 2002), Cambridge, UK, December 2002, pp. 33\u201346 (2002)","DOI":"10.1007\/978-1-4471-0651-7_3"},{"issue":"6","key":"12_CR8","doi-asserted-by":"publisher","first-page":"1278","DOI":"10.1137\/S0097539793250299","volume":"24","author":"T. Eiter","year":"1995","unstructured":"Eiter, T., Gottlob, G.: Identifying the minimal transversals of a hypergraph and related problems. SIAM Journal on Computing archive\u00a024(6), 1278\u20131304 (1995)","journal-title":"SIAM Journal on Computing archive"},{"key":"12_CR9","unstructured":"Jamison, R.E., Pfaltz, J.L.: Closure spaces that are not uniquely generated. In: Ordinal and Symbolic Data Analysis, Brussels (2000)"},{"key":"12_CR10","doi-asserted-by":"crossref","unstructured":"Jeudy, B., Rioult, F.: Database transposition for constrained closed pattern mining. In: Third International Workshop on Knowledge Discovery in Inductive Databases (2004)","DOI":"10.1007\/978-3-540-31841-5_6"},{"key":"12_CR11","unstructured":"Mannila, H., Toivonen, H.: Multiple uses of frequent sets and condensed representations. In: Proceedings of the Second International Conference on Knowledge Discovery and Data Mining (KDD 1996), Portland, Oregon, pp. 189\u2013194 (1996)"},{"issue":"3","key":"12_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":"12_CR13","doi-asserted-by":"crossref","unstructured":"Pasquier, N., Bastide, Y., Taouil, R., Lakhal, L.: Discovering frequent closed itemsets for association rules. Lecture Notes in Computer Science (1999)","DOI":"10.1007\/3-540-49257-7_25"},{"issue":"1","key":"12_CR14","first-page":"25","volume":"24","author":"N. Pasquier","year":"1999","unstructured":"Pasquier, N., Bastide, Y., Taouil, R., Lakhal, L.: Efficient mining of association rules using closed itemset lattices. Data Mining and Knowledge Discovery journal\u00a024(1), 25\u201346 (1999)","journal-title":"Data Mining and Knowledge Discovery journal"},{"key":"12_CR15","unstructured":"Pei, J., Han, J., Mao, R.: CLOSET: An efficient algorithm for mining frequent closed itemsets. In: ACM SIGMOD Workshop on Research Issues in Data Mining and Knowledge Discovery, pp. 21\u201330 (2000)"},{"key":"12_CR16","unstructured":"Pfaltz, J.L., Taylor, C.: Closed set mining of biological data. In: Workshop on Data Mining and Bioinformatics (2002)"},{"key":"12_CR17","doi-asserted-by":"crossref","unstructured":"Rioult, F., Boulicaut, J.-F., Cr\u00e9milleux, B., Besson, J.: Using transposition for pattern discovery from microarray data. In: Zaki, M.J., Aggarwal, C.C. (eds.) Proceedings of the 8th ACM SIGMOD Workshop on Research Issues in Data Mining and Knowledge Discovery (DMKD 2003), San Diego, CA, pp. 73\u201379 (2003)","DOI":"10.1145\/882082.882099"},{"key":"12_CR18","doi-asserted-by":"crossref","unstructured":"Zaki, M.J.: Generating non-redundant association rules. In: Proceedings of the 6th International Conference on Knowledge Discovery and Data Mining (ACM SIGKDD 2000), Boston, MA, pp. 34\u201343 (2000)","DOI":"10.1145\/347090.347101"},{"key":"12_CR19","doi-asserted-by":"crossref","unstructured":"Zaki, M.J., Hsiao, C.J.: CHARM: an efficient algorithm for closed itemset mining. In: Proceedings of the 2th SIAM international conference on Data Mining, Arlington, pp. 33\u201343 (2002)","DOI":"10.1137\/1.9781611972726.27"}],"container-title":["Lecture Notes in Computer Science","Discovery Science"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11563983_12.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,17]],"date-time":"2020-11-17T14:52:38Z","timestamp":1605624758000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11563983_12"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2005]]},"ISBN":["9783540292302","9783540316985"],"references-count":19,"URL":"https:\/\/doi.org\/10.1007\/11563983_12","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2005]]}}}