{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T15:12:26Z","timestamp":1725549146638},"publisher-location":"Berlin, Heidelberg","reference-count":21,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540250821"},{"type":"electronic","value":"9783540318415"}],"license":[{"start":{"date-parts":[[2005,1,1]],"date-time":"2005-01-01T00:00:00Z","timestamp":1104537600000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2005]]},"DOI":"10.1007\/978-3-540-31841-5_3","type":"book-chapter","created":{"date-parts":[[2010,3,1]],"date-time":"2010-03-01T11:01:31Z","timestamp":1267441291000},"page":"33-45","source":"Crossref","is-referenced-by-count":12,"title":["Mining Formal Concepts with a Bounded Number of Exceptions from Transactional Data"],"prefix":"10.1007","author":[{"given":"J\u00e9r\u00e9my","family":"Besson","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"C\u00e9line","family":"Robardet","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jean-Fran\u00e7ois","family":"Boulicaut","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"unstructured":"Becquet, C., Blachon, S., Jeudy, B., Boulicaut, J.-F., Gandrillon, O.: Strong association rule mining for large gene expression data analysis: a case study on human SAGE data. Genome Biology\u00a012 (2002) See, \n                    \n                      http:\/\/genomebiology.com\/2002\/3\/12\/research\/0067","key":"3_CR1"},{"unstructured":"Berry, A., Bordat, J.-P., Sigayret, A.: Concepts can not afford to stammer. In: Proceedings JIM 2003, Metz, France, September 2003, pp. 25\u201335 (2003)","key":"3_CR2"},{"key":"3_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)"},{"doi-asserted-by":"crossref","unstructured":"Besson, J., Robardet, C., Boulicaut, J.-F., Rome, S.: Constraint-based bi-set mining for biologically relevant pattern discovery in microarray data. Intelligent Data Analysis journal\u00a09 (2004) (in press)","key":"3_CR4","DOI":"10.3233\/IDA-2005-9105"},{"key":"3_CR5","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)"},{"issue":"1","key":"3_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"},{"issue":"8","key":"3_CR7","doi-asserted-by":"publisher","first-page":"949","DOI":"10.1016\/S0306-4379(03)00002-4","volume":"28","author":"A. Bykowski","year":"2003","unstructured":"Bykowski, A., Rigotti, C.: DBC: a condensed representation of frequent patterns for efficient mining. Information Systems Journal\u00a028(8), 949\u2013977 (2003)","journal-title":"Information Systems Journal"},{"unstructured":"Ganter, B.: Two basic algorithms in concept analysis. Technical report, Technisch Hochschule Darmstadt, Preprint 831 (1984)","key":"3_CR8"},{"key":"3_CR9","series-title":"Lecture Notes in Artificial Intelligence","doi-asserted-by":"publisher","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)"},{"unstructured":"Goethals, B., Zaki, M.J. (eds.): FIMI 2003, Frequent Itemset Mining Implementations, Proceedings of the ICDM 2003 Workshop on Frequent Itemset Mining Implementations, Melbourne, Florida, USA, 19 December 2003. CEUR Workshop Proceedings, vol.\u00a090 (2003)","key":"3_CR10"},{"key":"3_CR11","doi-asserted-by":"publisher","first-page":"190","DOI":"10.1016\/S0020-0190(99)00108-8","volume":"71","author":"L. Nourine","year":"1999","unstructured":"Nourine, L., Raynaud, O.: A fast algortihm for building lattices. Information Processing Letters\u00a071, 190\u2013204 (1999)","journal-title":"Information Processing Letters"},{"issue":"1","key":"3_CR12","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"},{"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":"3_CR13"},{"doi-asserted-by":"crossref","unstructured":"Pensa, R., Leschi, C., Besson, J., Boulicaut, J.-F.: Assessment of discretization techniques for relevant pattern discovery from gene expression data. In: Proceedings BIOKDD 2004 co-located with ACM SIGKDD 2004, Seattle, USA (August 2004) (in press)","key":"3_CR14","DOI":"10.1007\/978-3-540-30214-8_18"},{"doi-asserted-by":"crossref","unstructured":"Rioult, F., Boulicaut, J.-F., Cr\u00e9milleux, B., Besson, J.: Using transposition for pattern discovery from microarray data. In: Proceedings ACM SIGMOD Workshop DMKD 2003, San Diego, USA, June 2003, pp. 73\u201379 (2003)","key":"3_CR15","DOI":"10.1145\/882082.882099"},{"unstructured":"Rioult, F., Robardet, C., Blachon, S., Cr\u00e9milleux, B., Gandrillon, O., Boulicaut, J.-F.: Mining concepts from large SAGE gene expression matrices. In: Proceedings KDID 2003 co-located with ECML-PKDD 2003 ISBN:953-6690-34-9, Cavtat-Dubrovnik, Croatia, September 22, pp. 107\u2013118 (2003)","key":"3_CR16"},{"doi-asserted-by":"crossref","unstructured":"Rome, S., Cl\u00e9ment, K., Rabasa-Lhoret, R., Loizon, E., Poitou, C., Barsh, G.S., Riou, J.-P., Laville, M., Vidal, H.: Microarray profiling of human skeletal muscle reveals that insulin regulates 800 genes during an hyperinsulinemic clamp. Journal of Biological Chemistry (March 2003) (in pess)","key":"3_CR17","DOI":"10.1074\/jbc.M300293200"},{"key":"3_CR18","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., Taouil, R., Bastide, Y., Pasquier, N., Lakhal, L.: Computing iceberg concept lattices with titanic. Data and Knowledge Engineering\u00a042, 189\u2013222 (2002)","journal-title":"Data and Knowledge Engineering"},{"doi-asserted-by":"crossref","unstructured":"Wang, J., Han, J., Pei, J.: CLOSET+: searching for the best strategies for mining frequent closed itemsets. In: Proceedings of the ninth ACM SIGKDD international conference on Knowledge discovery and data mining (2003)","key":"3_CR19","DOI":"10.1145\/956750.956779"},{"key":"3_CR20","doi-asserted-by":"crossref","first-page":"445","DOI":"10.1007\/978-94-009-7798-3_15","volume-title":"Ordered sets","author":"R. Wille","year":"1982","unstructured":"Wille, R.: Restructuring lattice theory: an approach based on hierarchies of concepts. In: Rival, I. (ed.) Ordered sets, pp. 445\u2013470. Reidel, Dordrecht (1982)"},{"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 (April 2002)","key":"3_CR21","DOI":"10.1137\/1.9781611972726.27"}],"container-title":["Lecture Notes in Computer Science","Knowledge Discovery in Inductive Databases"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-31841-5_3","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,19]],"date-time":"2019-05-19T13:27:29Z","timestamp":1558272449000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-31841-5_3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2005]]},"ISBN":["9783540250821","9783540318415"],"references-count":21,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-31841-5_3","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2005]]}}}