{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,20]],"date-time":"2026-05-20T18:27:24Z","timestamp":1779301644166,"version":"3.51.4"},"publisher-location":"Berlin, Heidelberg","reference-count":45,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783540781363","type":"print"},{"value":"9783540781370","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/978-3-540-78137-0_2","type":"book-chapter","created":{"date-parts":[[2008,2,14]],"date-time":"2008-02-14T04:34:46Z","timestamp":1202963686000},"page":"14-31","source":"Crossref","is-referenced-by-count":14,"title":["Actionability and Formal Concepts: A Data Mining Perspective"],"prefix":"10.1007","author":[{"given":"Jean-Fran\u00e7ois","family":"Boulicaut","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"J\u00e9r\u00e9my","family":"Besson","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"2_CR1","series-title":"Lecture Notes in Artificial Intelligence","volume-title":"Formal Concept Analysis","year":"2005","unstructured":"Ganter, B., Stumme, G., Wille, R. (eds.): Formal Concept Analysis. LNCS (LNAI), vol.\u00a03626. Springer, Heidelberg (2005)"},{"key":"2_CR2","series-title":"Lecture Notes in Artificial Intelligence","first-page":"1","volume-title":"Database Support for Data Mining Applications","author":"J.F. Boulicaut","year":"2004","unstructured":"Boulicaut, J.F.: Inductive databases and multiple uses of frequent itemsets: the cInQ approach. In: Meo, R., Lanzi, P.L., Klemettinen, M. (eds.) Database Support for Data Mining Applications. LNCS (LNAI), vol.\u00a02682, pp. 1\u201323. Springer, Heidelberg (2004)"},{"key":"2_CR3","series-title":"Lecture Notes in Artificial Intelligence","doi-asserted-by":"publisher","first-page":"64","DOI":"10.1007\/11615576_4","volume-title":"Constraint-Based Mining and Inductive Databases","author":"T. Calders","year":"2006","unstructured":"Calders, T., Rigotti, C., Boulicaut, J.F.: A survey on condensed representations for frequent sets. In: Boulicaut, J.-F., De Raedt, L., Mannila, H. (eds.) Constraint-Based Mining and Inductive Databases. LNCS (LNAI), vol.\u00a03848, pp. 64\u201380. Springer, Heidelberg (2006)"},{"key":"2_CR4","series-title":"Lecture Notes in Artificial Intelligence","doi-asserted-by":"crossref","first-page":"352","DOI":"10.1007\/978-3-540-24651-0_30","volume-title":"Concept Lattices","author":"P. Valtchev","year":"2004","unstructured":"Valtchev, P., Missaoui, R., Godin, R.: Formal concept analysis for knowledge discovery and data mining: The new challenges. In: Eklund, P.W. (ed.) ICFCA 2004. LNCS (LNAI), vol.\u00a02961, pp. 352\u2013371. Springer, Heidelberg (2004)"},{"issue":"1","key":"2_CR5","doi-asserted-by":"crossref","first-page":"59","DOI":"10.3233\/IDA-2005-9105","volume":"9","author":"J. Besson","year":"2005","unstructured":"Besson, J., et al.: Constraint-based formal concept mining and its application to microarray data analysis. Intelligent Data Analysis\u00a09(1), 59\u201382 (2005)","journal-title":"Intelligent Data Analysis"},{"issue":"2-3","key":"2_CR6","doi-asserted-by":"publisher","first-page":"189","DOI":"10.1080\/09528130210164170","volume":"14","author":"S.O. Kuznetsov","year":"2002","unstructured":"Kuznetsov, S.O., Obiedkov, S.A.: Comparing performance of algorithms for generating concept lattices. Experimental and Theoretical Artificial Intelligence\u00a014(2-3), 189\u2013216 (2002)","journal-title":"Experimental and Theoretical Artificial Intelligence"},{"key":"2_CR7","doi-asserted-by":"publisher","first-page":"189","DOI":"10.1016\/S0169-023X(02)00057-5","volume":"42","author":"G. Stumme","year":"2002","unstructured":"Stumme, G., et al.: Computing iceberg concept lattices with titanic. Data & Knowledge Engineering\u00a042, 189\u2013222 (2002)","journal-title":"Data & Knowledge Engineering"},{"key":"2_CR8","series-title":"Lecture Notes in Artificial Intelligence","doi-asserted-by":"crossref","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":"2_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"33","DOI":"10.1007\/978-3-540-31841-5_3","volume-title":"Knowledge Discovery in Inductive Databases","author":"J. Besson","year":"2005","unstructured":"Besson, J., Robardet, C., Boulicaut, J.F.: Mining formal concepts with a bounded number of exceptions from transactional data. In: Goethals, B., Siebes, A. (eds.) KDID 2004. LNCS, vol.\u00a03377, pp. 33\u201345. Springer, Heidelberg (2005)"},{"key":"2_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"293","DOI":"10.1007\/11552253_27","volume-title":"Advances in Intelligent Data Analysis VI","author":"R. Pensa","year":"2005","unstructured":"Pensa, R., Boulicaut, J.F.: From local pattern mining to relevant bi-cluster characterization. In: Famili, A.F., et al. (eds.) IDA 2005. LNCS, vol.\u00a03646, pp. 293\u2013304. Springer, Heidelberg (2005)"},{"key":"2_CR11","series-title":"Lecture Notes in Artificial Intelligence","doi-asserted-by":"publisher","first-page":"144","DOI":"10.1007\/11787181_11","volume-title":"Conceptual Structures: Inspiration and Application","author":"J. Besson","year":"2006","unstructured":"Besson, J., Robardet, C., Boulicaut, J.F.: Mining a new fault-tolerant pattern type as an alternative to formal concept discovery. In: Sch\u00e4rfe, H., Hitzler, P., \u00d8hrstr\u00f8m, P. (eds.) ICCS 2006. LNCS (LNAI), vol.\u00a04068, pp. 144\u2013157. Springer, Heidelberg (2006)"},{"key":"2_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"55","DOI":"10.1007\/11733492_4","volume-title":"Knowledge Discovery in Inductive Databases","author":"J. Besson","year":"2006","unstructured":"Besson, J., et al.: Constraint-based mining of fault-tolerant patterns from boolean data. In: Bonchi, F., Boulicaut, J.-F. (eds.) KDID 2005. LNCS, vol.\u00a03933, pp. 55\u201371. Springer, Heidelberg (2006)"},{"key":"2_CR13","unstructured":"Goethals, B., Zaki, M.: Proceedings of the IEEE ICDM Workshop on Frequent Itemset Mining Implementations FIMI 2003, Melbourne, USA (2003)"},{"key":"2_CR14","unstructured":"Ganter, B.: Two basic algorithms in concept analysis. Technical report, Technisch Hochschule Darmstadt, Germany, Preprint 831 (1984)"},{"issue":"4","key":"2_CR15","doi-asserted-by":"publisher","first-page":"241","DOI":"10.1023\/A:1024076020895","volume":"7","author":"C. Bucila","year":"2003","unstructured":"Bucila, C., et al.: DualMiner: A dual-pruning algorithm for itemsets with constraints. Data Mining and Knowledge Discovery\u00a07(4), 241\u2013272 (2003)","journal-title":"Data Mining and Knowledge Discovery"},{"key":"2_CR16","unstructured":"Besson, J.: D\u00e9couvertes de motifs pertinents pour l\u2019analyse du transcriptome: application \u00e0 l\u2019insulino-r\u00e9sistance. PhD thesis, INSA-Lyon, 69621 Villeurbanne cedex, France. (in French) (2005)"},{"issue":"1","key":"2_CR17","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\u00a07(1), 5\u201322 (2003)","journal-title":"Data Mining and Knowledge Discovery"},{"key":"2_CR18","unstructured":"Pei, J., Han, J., Mao, R.: CLOSET an efficient algorithm for mining frequent closed itemsets. In: Proceedings ACM SIGMOD Workshop DMKD 2000 (2000)"},{"key":"2_CR19","doi-asserted-by":"crossref","unstructured":"Zaki, M.J., Hsiao, C.J.: CHARM: An efficient algorithm for closed itemset mining. In: Proceedings SIAM DM 2002, Arlington, USA (2002)","DOI":"10.1137\/1.9781611972726.27"},{"key":"2_CR20","doi-asserted-by":"crossref","unstructured":"Gionis, A., et al.: Assessing data mining results via swap randomization. In: Proceedings ACM SIGKDD 2006, Philadelphia, USA, pp. 167\u2013176 (2006)","DOI":"10.1145\/1150402.1150424"},{"key":"2_CR21","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., et al.: Efficient mining of association rules using closed itemset lattices. Information Systems\u00a024, 25\u201346 (1999)","journal-title":"Information Systems"},{"key":"2_CR22","doi-asserted-by":"publisher","first-page":"66","DOI":"10.1145\/380995.381017","volume":"2","author":"Y. Bastide","year":"2000","unstructured":"Bastide, Y., et al.: Mining frequent patterns with counting inference. SIGKDD Explorations\u00a02, 66 (2000)","journal-title":"SIGKDD Explorations"},{"key":"2_CR23","series-title":"Lecture Notes in Artificial Intelligence","doi-asserted-by":"publisher","first-page":"212","DOI":"10.1007\/11558590_22","volume-title":"AI*IA 2005: Advances in Artificial Intelligence","author":"R. Pensa","year":"2005","unstructured":"Pensa, R., Boulicaut, J.F.: Towards fault-tolerant formal concept analysis. In: Bandini, S., Manzoni, S. (eds.) AI*IA 2005. LNCS (LNAI), vol.\u00a03673, pp. 212\u2013223. Springer, Heidelberg (2005)"},{"key":"2_CR24","first-page":"194","volume-title":"Proceedings ACM SIGKDD","author":"C. Yang","year":"2001","unstructured":"Yang, C., Fayyad, U., Bradley, P.S.: Efficient discovery of error-tolerant frequent itemsets in high dimensions. In: Proceedings ACM SIGKDD, pp. 194\u2013203. ACM Press, New York (2001)"},{"key":"2_CR25","first-page":"683","volume-title":"Proceedings ACM SIGKDD 2004","author":"J.K. Sepp\u00e4nen","year":"2004","unstructured":"Sepp\u00e4nen, J.K., Mannila, H.: Dense itemsets. In: Proceedings ACM SIGKDD 2004, Seattle, USA, pp. 683\u2013688. ACM Press, New York (2004)"},{"key":"2_CR26","series-title":"Lecture Notes in Artificial Intelligence","doi-asserted-by":"crossref","first-page":"173","DOI":"10.1007\/978-3-540-30116-5_18","volume-title":"Knowledge Discovery in Databases: PKDD 2004","author":"A. Gionis","year":"2004","unstructured":"Gionis, A., Mannila, H., Sepp\u00e4nen, J.K.: Geometric and combinatorial tiles in 0-1 data. In: Boulicaut, J.-F., et al. (eds.) PKDD 2004. LNCS (LNAI), vol.\u00a03202, pp. 173\u2013184. Springer, Heidelberg (2004)"},{"key":"2_CR27","doi-asserted-by":"crossref","unstructured":"Cheng, J., Ke, Y., Ng, W.: Delta-tolerance closed frequent itemsets. In: Proceedings IEEE ICDM 2006, Hong Kong, China, pp. 139\u2013148 (2006)","DOI":"10.1109\/ICDM.2006.1"},{"key":"2_CR28","doi-asserted-by":"crossref","unstructured":"Cheng, H., Yu, P.S., Han, J.: Ac-close: Efficiently mining approximate closed itemsets by core pattern recovery. In: Proceedings IEEE ICDM 2006, Hong Kong, China, pp. 839\u2013844 (2006)","DOI":"10.1109\/ICDM.2006.10"},{"key":"2_CR29","unstructured":"Robardet, C., et al.: Using classification and visualization on pattern databases for gene expression data analysis. In: Proceedings PaRMa\u201904 co-located with EDBT 2004, Heraclion-Crete, Greece. CEUR Proceedings, vol.\u00a096, pp. 107\u2013118 (2004)"},{"issue":"0033","key":"2_CR30","first-page":"1","volume":"7","author":"S. Blachon","year":"2007","unstructured":"Blachon, S., et al.: Clustering formal concepts to discover biologically relevant knowledge from gene expression data. Silico Biology\u00a07(0033), 1\u201315 (2007)","journal-title":"Silico Biology"},{"key":"2_CR31","first-page":"89","volume-title":"Proceedings ACM SIGKDD 2003","author":"I.S. Dhillon","year":"2003","unstructured":"Dhillon, I.S., Mallela, S., Modha, D.S.: Information-theoretic co-clustering. In: Proceedings ACM SIGKDD 2003, Washington, USA, pp. 89\u201398. ACM Press, New York (2003)"},{"key":"2_CR32","series-title":"Lecture Notes in Artificial Intelligence","doi-asserted-by":"publisher","first-page":"643","DOI":"10.1007\/11564126_68","volume-title":"Knowledge Discovery in Databases: PKDD 2005","author":"R. Pensa","year":"2005","unstructured":"Pensa, R., Robardet, C., Boulicaut, J.F.: A bi-clustering framework for categorical data. In: Jorge, A.M., et al. (eds.) PKDD 2005. LNCS (LNAI), vol.\u00a03721, pp. 643\u2013650. Springer, Heidelberg (2005)"},{"key":"2_CR33","first-page":"177","volume-title":"Proceedings ES 2002","author":"N. Durand","year":"2002","unstructured":"Durand, N., Cr\u00e9milleux, B.: Ecclat: a new approach of clusters discovery in categorical data. In: Proceedings ES 2002, Cambridge, UK, pp. 177\u2013190. Springer, Heidelberg (2002)"},{"key":"2_CR34","unstructured":"Mineau, G., Godin, A.B.,, R.: Simple pre- and post-pruning techniques for large conceptual clustering structures. In: Electronic Transactions on Artificial Intelligence (ETAI), pp. 1\u201320 (2000)"},{"key":"2_CR35","series-title":"Lecture Notes in Artificial Intelligence","doi-asserted-by":"crossref","first-page":"278","DOI":"10.1007\/978-3-540-30214-8_22","volume-title":"Discovery Science","author":"F. Geerts","year":"2004","unstructured":"Geerts, F., Goethals, B., Mielik\u00e4inen, T.: Tiling databases. In: Suzuki, E., Arikawa, S. (eds.) DS 2004. LNCS (LNAI), vol.\u00a03245, pp. 278\u2013289. Springer, Heidelberg (2004)"},{"key":"2_CR36","doi-asserted-by":"publisher","first-page":"90","DOI":"10.1145\/1007730.1007731","volume":"6","author":"L. Parsons","year":"2004","unstructured":"Parsons, L., Haque, E., Liu, H.: Subspace clustering for high dimensional data: a review. ACM SIGKDD Exploration Newsletter\u00a06, 90\u2013105 (2004)","journal-title":"ACM SIGKDD Exploration Newsletter"},{"key":"2_CR37","doi-asserted-by":"publisher","first-page":"24","DOI":"10.1109\/TCBB.2004.2","volume":"1","author":"S.C. Madeira","year":"2004","unstructured":"Madeira, S.C., Oliveira, A.L.: Biclustering algorithms for biological data analysis: A survey. IEEE\/ACM Trans. Comput. Biol. Bioinf.\u00a01, 24\u201345 (2004)","journal-title":"IEEE\/ACM Trans. Comput. Biol. Bioinf."},{"key":"2_CR38","doi-asserted-by":"crossref","unstructured":"Kl\u00e9ma, J., et al.: Mining plausible patterns from genomic data. In: Proceedings IEEE CBMS 2006, Salt Lake City, USA, pp. 183\u2013190 (2006)","DOI":"10.1109\/CBMS.2006.116"},{"key":"2_CR39","doi-asserted-by":"crossref","unstructured":"Jaschke, R., et al.: TRIAS: An algorithm for mining iceberg tri-lattices. In: Proceedings IEEE ICDM 2006, Hong Kong, China, pp. 907\u2013911 (2006)","DOI":"10.1109\/ICDM.2006.162"},{"key":"2_CR40","unstructured":"Ji, L., Tan, K.L., Tung, A.K.H.: Mining frequent closed cubes in 3D datasets. In: Proceedings VLDB 2006, Seoul, Korea, pp. 811\u2013822 (2006)"},{"key":"2_CR41","series-title":"Lecture Notes in Artificial Intelligence","first-page":"192","volume-title":"Formal Concept Analysis","author":"R. Godin","year":"2005","unstructured":"Godin, R., Valtchev, P.: Formal concept analysis-based class hierarchy design in object-oriented software development. In: Ganter, B., Stumme, G., Wille, R. (eds.) Formal Concept Analysis. LNCS (LNAI), vol.\u00a03626, pp. 192\u2013207. Springer, Heidelberg (2005)"},{"key":"2_CR42","first-page":"23","volume-title":"4th Int. Conf. on Conceptual Structures ICCS 1996","author":"R. Wille","year":"1996","unstructured":"Wille, R.: Conceptual structures of multicontexts. In: 4th Int. Conf. on Conceptual Structures ICCS 1996, pp. 23\u201339. Springer, Heidelberg (1996)"},{"key":"2_CR43","doi-asserted-by":"publisher","first-page":"58","DOI":"10.1145\/240455.240472","volume":"39","author":"T. Imielinski","year":"1996","unstructured":"Imielinski, T., Mannila, H.: A database perspective on knowledge discovery. Communications of ACM\u00a039, 58\u201364 (1996)","journal-title":"Communications of ACM"},{"key":"2_CR44","first-page":"80","volume-title":"Proceedings KDD 1998","author":"B. Liu","year":"1998","unstructured":"Liu, B., Hsu, W., Ma, Y.: Integrating classification and association rule mining. In: Proceedings KDD 1998, pp. 80\u201386. AAAI Press, Menlo Park (1998)"},{"key":"2_CR45","unstructured":"Pensa, R.G., Robardet, C., Boulicaut, J.F.: Constraint-driven Co-Clustering of 0\/1 Data. In: S.B., et al. (eds.) Constrained Clustering: Advances in Algorithms, Theory and Applications. Data Mining and Knowledge Discovery Series, Chapman & Hall\/CRC Press (to appear, 2008)"}],"container-title":["Lecture Notes in Computer Science","Formal Concept Analysis"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-78137-0_2.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,27]],"date-time":"2021-04-27T10:59:13Z","timestamp":1619521153000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-78137-0_2"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["9783540781363","9783540781370"],"references-count":45,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-78137-0_2","relation":{},"subject":[]}}