Abstract
The paper presents theorems characterizing concept lattices which happen to be trees after removing the bottom element. Concept lattices are the clustering/classification systems provided as an output of formal concept analysis. In general, a concept lattice may contain overlapping clusters and need not be a tree. On the other hand, tree-like classification schemes are appealing and are produced by several classification methods as the output. This paper attempts to help establish a bridge between concept lattices and tree-based classification methods. We present results presenting conditions for input data which are sufficient and necessary for the output concept lattice to form a tree after one removes its bottom element. In addition, we present illustrative examples and several remarks on related efforts and future research topics.
Supported by Kontakt 1–2006–33 (Bilateral Scientific Cooperation, project “Algebraic, logical and computational aspects of fuzzy relational modelling paradigms”), by grant No. 1ET101370417 of GA AV ČR, by grant No. 201/05/0079 of the Czech Science Foundation, and by institutional support, research plan MSM 6198959214.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Arabie, P., Hubert, L.J., DeSoete, G.: Clustering and Classification. World Scientific, Singapore (1996)
Belohlavek, R., Sklenar, V.: Formal concept analysis constrained by attribute-dependency formulas. In: Ganter, B., Godin, R. (eds.) ICFCA 2005. LNCS (LNAI), vol. 3403, pp. 176–191. Springer, Heidelberg (2005)
Belohlavek, R., Vychodil, V.: Formal concept analysis with constraints by closure operators. In: Schärfe, H., Hitzler, P., Øhrstrøm, P. (eds.) ICCS 2006. LNCS (LNAI), vol. 4068, pp. 131–143. Springer, Heidelberg (2006)
Carpineto, C., Romano, G.: Concept Data Analysis. Theory and Applications. J. Wiley, Chichester (2004)
Everitt, B.S., Landau, S., Leese, M.: Cluster Analysis, 4th edn. Oxford University Press, New York (2001)
Ganter, B.: Begriffe und Implikationen, manuscript (1998)
Ganter, B., Wille, R.: Formal Concept Analysis. Mathematical Foundations. Springer, Heidelberg (1999)
Gratzer, G.A.: General Lattice Theory. 2nd edn. Birkhauser (1998)
Grimaldi, R.P.: Discrete and Combinatorial Mathematics, 5th edn. Pearson Education (2002)
Guigues, J.-L., Duquenne, V.: Familles minimales d’implications informatives resultant d’un tableau de données binaires. Math. Sci. Humaines 95, 5–18 (1986)
Kuznetsov, S.O., Obiedkov, S.A.: Comparing performance of algorithms for generating concept lattices. J. Exp. Theor. Artif. Intelligence 14(2/3), 189–216 (2002)
Lindig, C.: Fast concept analysis. In: Ganter, B., Mineau, G.W. (eds.) ICCS 2000. LNCS, vol. 1867, pp. 152–161. Springer, Heidelberg (2000)
Zaki, M.J.: Mining non-redundant association rules. Data Mining and Knowledge Discovery 9, 223–248 (2004)
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 2007 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Belohlavek, R., De Baets, B., Outrata, J., Vychodil, V. (2007). Trees in Concept Lattices. In: Torra, V., Narukawa, Y., Yoshida, Y. (eds) Modeling Decisions for Artificial Intelligence. MDAI 2007. Lecture Notes in Computer Science(), vol 4617. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-73729-2_17
Download citation
DOI: https://doi.org/10.1007/978-3-540-73729-2_17
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-73728-5
Online ISBN: 978-3-540-73729-2
eBook Packages: Computer ScienceComputer Science (R0)