{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,11]],"date-time":"2025-10-11T08:22:54Z","timestamp":1760170974790},"reference-count":53,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2015,12,8]],"date-time":"2015-12-08T00:00:00Z","timestamp":1449532800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Adv Data Anal Classif"],"published-print":{"date-parts":[[2017,3]]},"DOI":"10.1007\/s11634-015-0225-7","type":"journal-article","created":{"date-parts":[[2015,12,9]],"date-time":"2015-12-09T04:52:58Z","timestamp":1449636778000},"page":"49-77","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["Dichotomic lattices and local discretization for Galois lattices"],"prefix":"10.1007","volume":"11","author":[{"given":"Nathalie","family":"Girard","sequence":"first","affiliation":[]},{"given":"Karell","family":"Bertet","sequence":"additional","affiliation":[]},{"given":"Muriel","family":"Visani","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2015,12,8]]},"reference":[{"key":"225_CR1","unstructured":"Barbut M, Monjardet B (1970) Ordres et classifications : alg\u00e8bre et combinatoire, 2 tomes. Hachette, Paris"},{"issue":"5","key":"225_CR2","first-page":"407","volume":"26","author":"K Bertet","year":"2009","unstructured":"Bertet K, Visani M, Girard N (2009) Treillis dichotomiques et arbres de d\u00e9cision. Traitement Signal 26(5):407\u2013416","journal-title":"Traitement Signal"},{"key":"225_CR3","doi-asserted-by":"crossref","unstructured":"Birkhoff G (1940) Lattice theory, 1st edn. American Mathematical Society, New York","DOI":"10.1090\/coll\/025"},{"key":"225_CR4","unstructured":"Birkhoff G (1967) Lattice theory, vol\u00a025, 3rd edn. American Mathematical Society, New York"},{"key":"225_CR5","first-page":"31","volume":"96","author":"JP Bordat","year":"1986","unstructured":"Bordat JP (1986) Calcul pratique du treillis de Galois d\u2019une correspondance. Math Sci Hum 96:31\u201347","journal-title":"Math Sci Hum"},{"key":"225_CR6","unstructured":"Breiman L, Friedman J, Olshen R, Stone C (1984) Classification and regression trees. Wadsworth Inc., Belmont"},{"key":"225_CR7","doi-asserted-by":"crossref","unstructured":"Caspard N, Leclerc B, Monjardet B (2012) Finite ordered sets: concepts, results and uses. In: Collection encyclopedia of mathematics and its applications, vol 144, Cambridge University Press, Cambridge","DOI":"10.1017\/CBO9781139005135"},{"issue":"4","key":"225_CR8","doi-asserted-by":"crossref","first-page":"1136","DOI":"10.1109\/TSMCB.2011.2108646","volume":"41","author":"M Coustaty","year":"2011","unstructured":"Coustaty M, Bertet K, Visani M, Ogier JM (2011) A new adaptive structural signature for symbol recognition by using a Galois lattice as a classifier. IEEE Trans Syst Man Cybern Part B Cybern 41(4):1136\u20131148","journal-title":"IEEE Trans Syst Man Cybern Part B Cybern"},{"key":"225_CR9","unstructured":"Davey B, Priestley H (1991) Introduction to lattices and orders, 2nd edn. Cambridge University Press, Cambridge"},{"key":"225_CR10","doi-asserted-by":"crossref","unstructured":"Diday E, Emilion R (2003) Maximal and stochastic Galois lattices. Discrete Appl Math 127(2):271\u2013284 (ordinal and symbolic data analysis (OSDA \u201998), University of Massachusetts, Amherst, 28\u201330 September 1998)","DOI":"10.1016\/S0166-218X(02)00210-X"},{"key":"225_CR11","doi-asserted-by":"crossref","unstructured":"Dougherty J, Kohavi R, Sahami M (1995) Supervised and unsupervised discretization of continuous features. In: Machine learning. Proceedings of the 12th international conference, Morgan Kaufmann, pp 194\u2013202","DOI":"10.1016\/B978-1-55860-377-6.50032-3"},{"key":"225_CR12","doi-asserted-by":"crossref","first-page":"476","DOI":"10.1109\/34.589207","volume":"19","author":"F Esposito","year":"1997","unstructured":"Esposito F, Malerba D, Semeraro G (1997) A comparative analysis of methods for pruning decision trees. IEEE Trans Pattern Anal Mach Intell 19:476\u2013491","journal-title":"IEEE Trans Pattern Anal Mach Intell"},{"key":"225_CR13","unstructured":"Fayyad U, Irani K (1993) Multi-interval discretization of continuous-valued attributes for classification learning. In: Proceedings of the international joint conference on uncertainty in AI, Morgan Kaufman, pp 1022\u20131027"},{"key":"225_CR14","unstructured":"Frank E, Witten I (1999) Making better use of global discretization. In: Proceedings of 16th international conference on machine learning, Bled, pp 115\u2013123"},{"key":"225_CR15","doi-asserted-by":"crossref","unstructured":"Fu H, Fu H, Njiwoua P, Mephu-Nguifo EM (2004) A comparative study of FCA-based supervised classification algorithms. In: Concept lattices. LNCS, vol 2961. Springer, Berlin, pp 219\u2013220","DOI":"10.1007\/978-3-540-24651-0_26"},{"key":"225_CR16","unstructured":"Ganter B (1984) Two basic algorithms in concept analysis. In: Technische Hochschule Darmstadt (preprint 831)"},{"key":"225_CR17","doi-asserted-by":"crossref","first-page":"129","DOI":"10.1007\/3-540-44583-8_10","volume-title":"Conceptual structures: broadening the base. LNCS","author":"B Ganter","year":"2001","unstructured":"Ganter B, Kuznetsov S (2001) Pattern structures and their projections. In: Delugach H, Stumme G (eds) Conceptual structures: broadening the base. LNCS, vol 2120. Springer, Berlin, pp 129\u2013142"},{"key":"225_CR18","doi-asserted-by":"crossref","first-page":"139","DOI":"10.1007\/978-1-4684-6381-1_6","volume-title":"Applications of combinatorics and graph theory to biological and social sciences. LNCS","author":"B Ganter","year":"1989","unstructured":"Ganter B, Wille R (1989) Conceptual scaling. In: Roberts F (ed) Applications of combinatorics and graph theory to biological and social sciences. LNCS. Springer, Berlin, pp 139\u2013167"},{"key":"225_CR19","doi-asserted-by":"crossref","unstructured":"Ganter B, Wille R (1999) Formal concept analysis. In: Mathematical foundations. Springer, Berlin","DOI":"10.1007\/978-3-642-59830-2"},{"key":"225_CR20","doi-asserted-by":"crossref","first-page":"747","DOI":"10.1006\/imms.1993.1035","volume":"38","author":"R Godin","year":"1998","unstructured":"Godin R, Missaoui R, April A (1998) Experimental comparison of navigation in a Galois lattice with conventional information retrieval methods. Int J Man Mach Stud 38:747\u2013767","journal-title":"Int J Man Mach Stud"},{"key":"225_CR21","unstructured":"GREC (2003) Images base GREC 2003 (Graphics RECognition). http:\/\/www.cvc.uab.es\/grec2003\/symreccontest\/index.htm . Accessed 08 January 2008"},{"key":"225_CR22","unstructured":"Guillas S, Bertet K, Visani M, Ogier JM, Girard N (2008) Some links between decision tree and dichotomic lattice. In: Proceedings CW (ed) Proceedings of the sixth international conference on concept lattices and their applications, CLA 2008, pp 193\u2013205"},{"issue":"2","key":"225_CR23","doi-asserted-by":"crossref","first-page":"321","DOI":"10.1093\/biomet\/28.3-4.321","volume":"I","author":"H Hotelling","year":"1936","unstructured":"Hotelling H (1936) Relations between two sets of variates. Biometrika XXVII I (2):321\u2013377","journal-title":"Biometrika XXVII"},{"key":"225_CR24","first-page":"181","volume-title":"Intelligent data engineering and automated learning. LNCS","author":"G Hwang","year":"2002","unstructured":"Hwang G, Li F (2002) A dynamic method for discretization of continuous attributes. In: Yin H, Allinson N, Freeman R, Keane J, Hubbard S (eds) Intelligent data engineering and automated learning. LNCS, vol 2412. Springer, Berlin, pp 181\u2013193"},{"issue":"2","key":"225_CR25","first-page":"119","volume":"29","author":"GV Kass","year":"1980","unstructured":"Kass GV (1980) An exploratory technique for investigating large quantities of categorical data. J R Stat Soc Ser C (Appl Stat) 29(2):119\u2013127","journal-title":"J R Stat Soc Ser C (Appl Stat)"},{"issue":"10","key":"225_CR26","doi-asserted-by":"crossref","first-page":"1989","DOI":"10.1016\/j.ins.2010.07.007","volume":"181","author":"M Kaytoue","year":"2011","unstructured":"Kaytoue M, Kuznetsov SO, Napoli A, Duplessis S (2011) Mining gene expression data with pattern structures in formal concept analysis. Inf Sci 181(10):1989\u20132001","journal-title":"Inf Sci"},{"key":"225_CR27","doi-asserted-by":"crossref","unstructured":"Klimushkin M, Obiedkov S, Roth C (2010) Approaches to the selection of relevant concepts in the case of noisy data. In: Kwuida L, Sertkaya B (eds) Proceedings of the 8th international conference formal concept analysis. LNCS\/LNAI, vol 5986. Springer, New York, pp 255\u2013266","DOI":"10.1007\/978-3-642-11928-6_18"},{"key":"225_CR28","doi-asserted-by":"crossref","first-page":"101","DOI":"10.1007\/s10472-007-9053-6","volume":"49","author":"S Kuznetsov","year":"2007","unstructured":"Kuznetsov S (2007) On stability of a formal concept. Ann Math Artif Intell 49:101\u2013115","journal-title":"Ann Math Artif Intell"},{"key":"225_CR29","doi-asserted-by":"crossref","first-page":"289","DOI":"10.1007\/3-540-44794-6_24","volume-title":"Principles of data mining and knowledge discovery. LNCS","author":"S Kuznetsov","year":"2001","unstructured":"Kuznetsov S, Obiedkov S (2001) Algorithms for the construction of concept lattices and their diagram graphs. In: De Raedt L, Siebes A (eds) Principles of data mining and knowledge discovery. LNCS, vol 2168. Springer, Berlin, pp 289\u2013300"},{"key":"225_CR30","doi-asserted-by":"crossref","unstructured":"Kuznetsov S, Obiedkov S, Roth C (2007) Reducing the representation complexity of lattice-based taxonomies. In: Priss U, Polovina S, Hill R (eds) Proceedings of the ICCS 15th international conference on conceptual structures. LNCS\/LNAI, vol 4604. Springer, New York, pp 241\u2013254","DOI":"10.1007\/978-3-540-73681-3_18"},{"key":"225_CR31","unstructured":"Lichman M (2013) UCI machine learning repository. University of California, Irvine, School of Information and Computer Sciences. http:\/\/archive.ics.uci.edu\/ml"},{"key":"225_CR32","first-page":"93","volume-title":"Actes des Journ\u00e9es Fran\u00e7aises sur l\u2019Apprentissage (JFA)","author":"M Liqui\u00e8re","year":"1990","unstructured":"Liqui\u00e8re M, Mephu-Nguifo E (1990) LEGAL: LEarning with GAlois Lattice. Actes des Journ\u00e9es Fran\u00e7aises sur l\u2019Apprentissage (JFA). Lannion, France, pp 93\u2013113"},{"key":"225_CR33","doi-asserted-by":"crossref","first-page":"393","DOI":"10.1023\/A:1016304305535","volume":"6","author":"H Liu","year":"2002","unstructured":"Liu H, Hussain F, Tan CL, Dash M (2002) Discretization: an enabling technique. Data Min Knowl Discov 6:393\u2013423","journal-title":"Data Min Knowl Discov"},{"key":"225_CR34","doi-asserted-by":"crossref","first-page":"227","DOI":"10.1023\/A:1022604100933","volume":"4","author":"J Mingers","year":"1989","unstructured":"Mingers J (1989) An empirical comparison of pruning methods for decision tree induction. Mach Learn 4:227\u2013243","journal-title":"Mach Learn"},{"key":"225_CR35","doi-asserted-by":"crossref","unstructured":"Morgan JN, Sonquist JA (1963) Problems in the analysis of survey data, and a proposal. J Am Stat Assoc 58(302):415\u2013434","DOI":"10.1080\/01621459.1963.10500855"},{"key":"225_CR36","doi-asserted-by":"publisher","unstructured":"Muhlenbach F, Rakotomalala R (2002) Multivariate supervised discretization, a neighborhood graph approach. In: Proceedings of 2002 IEEE International conference on data mining, 2002. ICDM 2003, pp 314\u2013321. doi: 10.1109\/ICDM.2002.1183918","DOI":"10.1109\/ICDM.2002.1183918"},{"key":"225_CR37","doi-asserted-by":"crossref","unstructured":"Muhlenbach F, Rakotomalala R (2005) Discretization of continuous attributes. In: Idea Group Reference (ed) Encyclopedia of data warehousing and mining, John Wang, pp 397\u2013402","DOI":"10.4018\/978-1-59140-557-3.ch076"},{"key":"225_CR38","unstructured":"Oosthuizen GD (1988) The use of a lattice in knowledge processing. PhD thesis, University of Strathclyde, Glasgow"},{"issue":"3","key":"225_CR39","doi-asserted-by":"crossref","first-page":"493","DOI":"10.2307\/1990305","volume":"55","author":"O \u00d6re","year":"1944","unstructured":"\u00d6re O (1944) Galois connexions. Trans Am Math Soc 55(3):493\u2013513","journal-title":"Trans Am Math Soc"},{"key":"225_CR40","unstructured":"Quinlan JR (1979) Discovering rules by induction from large collections of examples. In: Michie D (ed) Expert systems in the micro-electronic age. Edinburgh University Press, Edinburgh, pp 168\u2013201"},{"key":"225_CR41","doi-asserted-by":"publisher","unstructured":"Quinlan JR (1986) Induction of decision trees. Mach Learn 1(1):81\u2013106. doi: 10.1023\/A:1022643204877","DOI":"10.1023\/A:1022643204877"},{"key":"225_CR42","first-page":"304","volume-title":"Proceedings of the 10th international joint conference on artificial intelligence -","author":"JR Quinlan","year":"1987","unstructured":"Quinlan JR (1987) Generating production rules from decision trees. Proceedings of the 10th international joint conference on artificial intelligence -, vol 1. Morgan Kaufmann, San Francisco, pp 304\u2013307"},{"key":"225_CR43","unstructured":"Quinlan JR (1993) C4.5: programs for machine learning. Morgan Kaufman, Los Altos"},{"key":"225_CR44","doi-asserted-by":"crossref","first-page":"77","DOI":"10.1613\/jair.279","volume":"4","author":"JR Quinlan","year":"1996","unstructured":"Quinlan JR (1996) Improved use of continuous attributes in C4.5. J Artif Intell Res 4:77\u201390","journal-title":"J Artif Intell Res"},{"key":"225_CR45","doi-asserted-by":"crossref","first-page":"165","DOI":"10.1007\/0-387-25465-X_9","volume-title":"Data mining and knowledge discovery handbook","author":"L Rokach","year":"2005","unstructured":"Rokach L, Maimon O (2005) Decision trees. Data mining and knowledge discovery handbook. Springer, New York, pp 165\u2013192"},{"key":"225_CR46","unstructured":"Roth C, Obiedkov SA, Kourie DG (2006) Towards concise representation for taxonomies of epistemic communities. In: CLA, pp 240\u2013255"},{"key":"225_CR47","unstructured":"Sahami M (1995) Learning classification rules using lattices. In: Lavrac N, Wrobel S (eds) Proceedings of the European conference on machine learning, ECML\u201995, Heraclion, Crete, pp 343\u2013346"},{"key":"225_CR48","doi-asserted-by":"crossref","unstructured":"Stumme G (1996) Local scaling in conceptual data systems. In: ICCS\u201996, pp 308\u2013320","DOI":"10.1007\/3-540-61534-2_20"},{"key":"225_CR49","doi-asserted-by":"crossref","first-page":"372","DOI":"10.1007\/978-3-540-24651-0_31","volume-title":"Concept lattices. LNCS","author":"D Merwe van der","year":"2004","unstructured":"van der Merwe D, Obiedkov S, Kourie D (2004) Addintent: a new incremental algorithm for constructing concept lattices. In: Eklund P (ed) Concept lattices. LNCS, vol 2961. Springer, Berlin, pp 372\u2013385"},{"issue":"4","key":"225_CR50","doi-asserted-by":"crossref","first-page":"449","DOI":"10.1142\/S0218001411008634","volume":"25","author":"M Visani","year":"2011","unstructured":"Visani M, Bertet K, Ogier JM (2011) Navigala: an original symbol classifier based on navigation through a Galois lattice. Int J Pattern Recognit Artif Intell 25(4):449\u2013473","journal-title":"Int J Pattern Recognit Artif Intell"},{"key":"225_CR51","doi-asserted-by":"crossref","unstructured":"Wille R (1982) Restructuring lattice theory: an approach based on hierarchies of concepts. In: Ordered sets, pp 445\u2013470","DOI":"10.1007\/978-94-009-7798-3_15"},{"key":"225_CR52","doi-asserted-by":"crossref","unstructured":"Zhang XH, Wu J, Lu TJ, Jiang Y (2007) A discretization algorithm based on Gini criterion. In: International conference on machine learning and cybernetics, vol\u00a05, pp 2557\u20132561","DOI":"10.1109\/ICMLC.2007.4370578"},{"key":"225_CR53","unstructured":"Zighed D, Rakotomalala R, Feschet F (1997) Optimal multiple intervals discretization of continuous attributes for supervised learning. In: Heckerman D, Mannila H, Pregibon D, Uthurusamy R (eds) Proceedings of the third international conference on knowledge discovery and data mining. AAAI Press, pp 295\u2013298"}],"container-title":["Advances in Data Analysis and Classification"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11634-015-0225-7.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s11634-015-0225-7\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11634-015-0225-7","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11634-015-0225-7.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,8,16]],"date-time":"2023-08-16T02:46:27Z","timestamp":1692153987000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s11634-015-0225-7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015,12,8]]},"references-count":53,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2017,3]]}},"alternative-id":["225"],"URL":"https:\/\/doi.org\/10.1007\/s11634-015-0225-7","relation":{},"ISSN":["1862-5347","1862-5355"],"issn-type":[{"value":"1862-5347","type":"print"},{"value":"1862-5355","type":"electronic"}],"subject":[],"published":{"date-parts":[[2015,12,8]]}}}