{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,18]],"date-time":"2025-02-18T23:10:26Z","timestamp":1739920226232,"version":"3.37.3"},"publisher-location":"Berlin, Heidelberg","reference-count":28,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540250821"},{"type":"electronic","value":"9783540318415"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2005]]},"DOI":"10.1007\/978-3-540-31841-5_6","type":"book-chapter","created":{"date-parts":[[2010,3,1]],"date-time":"2010-03-01T16:01:31Z","timestamp":1267459291000},"page":"89-107","source":"Crossref","is-referenced-by-count":5,"title":["Database Transposition for Constrained (Closed) Pattern Mining"],"prefix":"10.1007","author":[{"given":"Baptiste","family":"Jeudy","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Fran\u00e7ois","family":"Rioult","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"6_CR1","unstructured":"Agrawal, R., Mannila, H., Srikant, R., Toivonen, H., Verkamo, A.I.: Fast discovery of association rules. In: Advances in Knowledge Discovery and Data Mining (1996)"},{"key":"6_CR2","series-title":"Lecture Notes in Artificial Intelligence","doi-asserted-by":"publisher","first-page":"972","DOI":"10.1007\/3-540-44957-4_65","volume-title":"Computational Logic - CL 2000","author":"Y. Bastide","year":"2000","unstructured":"Bastide, Y., Pasquier, N., Taouil, R., Stumme, G., Lakhal, L.: Mining minimal non-redundant association rules using frequent closed itemsets. In: Palamidessi, C., Moniz Pereira, L., Lloyd, J.W., Dahl, V., Furbach, U., Kerber, M., Lau, K.-K., Sagiv, Y., Stuckey, P.J. (eds.) CL 2000. LNCS (LNAI), vol.\u00a01861, pp. 972\u2013986. Springer, Heidelberg (2000)"},{"key":"6_CR3","series-title":"Lecture Notes in Artificial Intelligence","doi-asserted-by":"publisher","first-page":"615","DOI":"10.1007\/978-3-540-24775-3_73","volume-title":"Advances in Knowledge Discovery and Data Mining","author":"J. Besson","year":"2004","unstructured":"Besson, J., Robardet, C., Boulicaut, J.-F.: Constraint-based mining of formal concepts in transactional data. In: Dai, H., Srikant, R., Zhang, C. (eds.) PAKDD 2004. LNCS (LNAI), vol.\u00a03056, pp. 615\u2013624. Springer, Heidelberg (2004)"},{"key":"6_CR4","series-title":"Lecture Notes in Artificial Intelligence","doi-asserted-by":"publisher","first-page":"59","DOI":"10.1007\/978-3-540-39804-2_8","volume-title":"Knowledge Discovery in Databases: PKDD 2003","author":"F. Bonchi","year":"2003","unstructured":"Bonchi, F., Giannotti, F., Mazzanti, A., Pedreschi, D.: ExAnte: Anticipated data reduction in constrained pattern mining. In: Lavra\u010d, N., Gamberger, D., Todorovski, L., Blockeel, H. (eds.) PKDD 2003. LNCS (LNAI), vol.\u00a02838, pp. 59\u201370. Springer, Heidelberg (2003)"},{"key":"6_CR5","doi-asserted-by":"crossref","unstructured":"Boros, E., Gurvich, V., Khachiyan, L., Makino, K.: On the complexity of generating maximal frequent and minimal infrequent sets. In: Symposium on Theoretical Aspects of Computer Science, pp. 133\u2013141 (2002)","DOI":"10.1007\/3-540-45841-7_10"},{"key":"6_CR6","unstructured":"Boulicaut, J.-F., Bykowski, A., Rigotti, C.: Free-sets: a condensed representation of boolean data for the approximation of frequency queries. DMKD\u00a07(1) (2003)"},{"key":"6_CR7","doi-asserted-by":"crossref","unstructured":"Boulicaut, J.-F., Jeudy, B.: Mining free-sets under constraints. In: Proc. IDEAS, pp. 322\u2013329 (2001)","DOI":"10.1109\/IDEAS.2001.938100"},{"key":"6_CR8","doi-asserted-by":"crossref","unstructured":"Bucila, C., Gehrke, J., Kifer, D., White, W.: Dualminer: a dual-pruning algorithm for itemsets with constraints. In: Proc. SIGKDD, pp. 42\u201351 (2002)","DOI":"10.1145\/775047.775054"},{"key":"6_CR9","series-title":"Lecture Notes in Artificial Intelligence","doi-asserted-by":"publisher","first-page":"74","DOI":"10.1007\/3-540-45681-3_7","volume-title":"Principles of Data Mining and Knowledge Discovery","author":"T. Calders","year":"2002","unstructured":"Calders, T., Goethals, B.: Mining all non-derivable frequent itemsets. In: Elomaa, T., Mannila, H., Toivonen, H. (eds.) PKDD 2002. LNCS (LNAI), vol.\u00a02431, pp. 74\u201385. Springer, Heidelberg (2002)"},{"key":"6_CR10","unstructured":"de Raedt, L., Kramer, S.: The levelwise version space algorithm and its application to molecular fragment finding. In: Proc. IJCAI, pp. 853\u2013862 (2001)"},{"key":"6_CR11","doi-asserted-by":"crossref","unstructured":"Dong, G., Li, J.: Efficient mining of emerging patterns: discovering trends and differences. In: Proc. SIGKDD, pp. 43\u201352 (1999)","DOI":"10.1145\/312129.312191"},{"key":"6_CR12","unstructured":"Fu, H., Nguifo, E.M.: How well go lattice algorithms on currently used machine learning testbeds? In: 1st Intl. Conf. on Formal Concept Analysis (2003)"},{"key":"6_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"307","DOI":"10.1007\/3-540-44466-1_31","volume-title":"Data Warehousing and Knowledge Discovery","author":"B. Goethals","year":"2000","unstructured":"Goethals, B., Van den Bussche, J.: On supporting interactive association rule mining. In: Kambayashi, Y., Mohania, M., Tjoa, A.M. (eds.) DaWaK 2000. LNCS, vol.\u00a01874, p. 307. Springer, Heidelberg (2000)"},{"issue":"4","key":"6_CR14","doi-asserted-by":"crossref","first-page":"341","DOI":"10.3233\/IDA-2002-6404","volume":"6","author":"B. Jeudy","year":"2002","unstructured":"Jeudy, B., Boulicaut, J.-F.: Optimization of association rule mining queries. Intelligent Data Analysis\u00a06(4), 341\u2013357 (2002)","journal-title":"Intelligent Data Analysis"},{"key":"6_CR15","series-title":"Lecture Notes in Artificial Intelligence","doi-asserted-by":"publisher","first-page":"225","DOI":"10.1007\/3-540-45681-3_19","volume-title":"Principles of Data Mining and Knowledge Discovery","author":"B. Jeudy","year":"2002","unstructured":"Jeudy, B., Boulicaut, J.-F.: Using condensed representations for interactive association rule mining. In: Elomaa, T., Mannila, H., Toivonen, H. (eds.) PKDD 2002. LNCS (LNAI), vol.\u00a02431, p. 225. Springer, Heidelberg (2002)"},{"key":"6_CR16","doi-asserted-by":"crossref","unstructured":"Ng, R., Lakshmanan, L.V., Han, J., Pang, A.: Exploratory mining and pruning optimizations of constrained associations rules. In: SIGMOD (1998)","DOI":"10.1145\/276304.276307"},{"issue":"4","key":"6_CR17","first-page":"1","volume":"4","author":"E.M. Nguifo","year":"2000","unstructured":"Nguifo, E.M., Njiwoua, P.: GLUE: a lattice-based constructive induction system. Intelligent Data Analysis\u00a04(4), 1\u201349 (2000)","journal-title":"Intelligent Data Analysis"},{"key":"6_CR18","doi-asserted-by":"crossref","unstructured":"Pan, F., Cong, G., Tung, A.K.H., Yang, J., Zaki, M.J.: CARPENTER: Finding closed patterns in long biological datasets. In: Proc. SIGKDD (2003)","DOI":"10.1145\/956750.956832"},{"issue":"1","key":"6_CR19","doi-asserted-by":"publisher","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.: Efficient mining of association rules using closed itemset lattices. Information Systems\u00a024(1), 25\u201346 (1999)","journal-title":"Information Systems"},{"key":"6_CR20","unstructured":"Pei, J., Han, J., Lakshmanan, L.V.S.: Mining frequent itemsets with convertible constraints. In: Proc. ICDE, pp. 433\u2013442 (2001)"},{"key":"6_CR21","unstructured":"Pei, J., Han, J., Mao, R.: CLOSET an efficient algorithm for mining frequent closed itemsets. In: Proc. DMKD workshop (2000)"},{"key":"6_CR22","unstructured":"Raedt, L.D., Jaeger, M., Lee, S., Mannila, H.: A theory of inductive query answering (extended abstract). In: Proc. ICDM, pp. 123\u2013130 (2002)"},{"key":"6_CR23","doi-asserted-by":"crossref","unstructured":"Rioult, F., Boulicaut, J.-F., Cr\u00e9milleux, B., Besson, J.: Using transposition for pattern discovery from microarray data. In: DMKD workshop (2003)","DOI":"10.1145\/882082.882099"},{"key":"6_CR24","unstructured":"Rioult, F., Cr\u00e9milleux, B.: Optimisation of pattern mining: a new method founded on database transposition. In: EIS 2004 (2004)"},{"key":"6_CR25","doi-asserted-by":"crossref","unstructured":"Soulet, A., Cr\u00e9milleux, B., Rioult, F.: Condensed representation of emerging patterns. In: Proc. PAKDD (2004)","DOI":"10.1007\/978-3-540-24775-3_16"},{"key":"6_CR26","doi-asserted-by":"crossref","unstructured":"Stadler, B., Stadler, P.: Basic properties of filter convergence spaces. J. Chem. Inf. Comput. Sci.\u00a042 (2002)","DOI":"10.1021\/ci0100898"},{"issue":"6-9","key":"6_CR27","doi-asserted-by":"publisher","first-page":"493","DOI":"10.1016\/0898-1221(92)90120-7","volume":"23","author":"R. Wille","year":"1992","unstructured":"Wille, R.: Concept lattices and conceptual knowledge systems. Computer mathematic applied\u00a023(6-9), 493\u2013515 (1992)","journal-title":"Computer mathematic applied"},{"key":"6_CR28","doi-asserted-by":"crossref","unstructured":"Zaki, M.J., Hsiao, C.-J.: CHARM: An efficient algorithm for closed itemset mining. In: Proc. SDM (2002)","DOI":"10.1137\/1.9781611972726.27"}],"container-title":["Lecture Notes in Computer Science","Knowledge Discovery in Inductive Databases"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-31841-5_6.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,2,18]],"date-time":"2025-02-18T22:39:12Z","timestamp":1739918352000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-31841-5_6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2005]]},"ISBN":["9783540250821","9783540318415"],"references-count":28,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-31841-5_6","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2005]]}}}