Abstract
The frequently used strategy of forming hypotheses, based on observations, to generate predictions can be formalized in several ways. We study an elaborated approach that has some conceptual flavour and translate the basic ideas in the language of Formal Concept Analysis, blazing the trail for applications to other conceptual structures as well. We investigate the relation to pseudo intents, discuss algorithmic questions, and give an example.
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
Anshakov, O.M., Finn, V.K., Skvortsov, D.P.: On axiomatization of manyvalued logics associated with the formalization of plausible reasonings. Studia Logica 25(4), 23–47 (1989)
Duquenne, V., Guigues, J.-L.: Familles minimales d’implications informatives résultant d’un tableau de données binaires. Math. Sci. Hum. 24(95), 5–18 (1986)
Finn, V.K.: On Machine-Oriented Formalization of Plausible Reasoning in the Style of F. Backon–J. S. Mill. Semiotika i Informatika 20, 35–101 (1983) [in Russian]
Finn, V.K.: Plausible Reasoning in Systems of JSM Type. Itogi Nauki i Tekhniki. Seriya Informatika 15, 54–101 (1991) [in Russian]
Ganter, B.: Algorithmen zur Formalen Begriffsanalyse. In: Ganter, B., Wille, R., Wolff, K.E. (eds.) Beiträge zur Begriffsanalyse, B. I. Wissenschaftsverlag, Mannheim, pp. 241–254 (1987)
Ganter, B., Wille, R.: Formal Concept Analysis. In: Mathematical Foundations. Springer, Berlin (1999)
Ganter, B., Kuznetsov, S.: Stepwise Construction of the Dedekind-McNeille Completion. In: Mugnier, M.-L., Chein, M. (eds.) ICCS 1998. LNCS (LNAI), vol. 1453, pp. 295–302. Springer, Heidelberg (1998)
Goldberg, L.A.: Efficient Algorithms for Listing Combinatorial Structures. Cambridge University Press, Cambridge (1993)
Johnson, D.S., Yannakakis, M., Papadimitriou, C.H.: On Generating all Maximal Independent Sets. Information Processing Letters 27, 119–123 (1988)
Kuznetsov, S.O.: JSM-method as a Machine Learning System. Itogi Nauki i Tekhniki. Informatika 15, 17–54 (1991) [in Russian]
Kuznetsov, S.O.: Mathematical Aspects of Concept Analysis. Journalof MathematicalScience, Series Contemporary Mathematics and Its Applications 18, 1654–1698 (1996)
Kuznetsov, S.O., Finn, V.K.: On a model of learning and classification based on similarity operation. Obozrenie Prikladnoi i Promyshlennoi Matematiki 3(1), 66–90 (1996) [in Russian]
Kuznetsov, S.O.: Learning of Simple Conceptual Graphs from Positive and Negative Examples. In: Żytkow, J.M., Rauch, J. (eds.) PKDD 1999. LNCS (LNAI), vol. 1704, pp. 384–392. Springer, Heidelberg (1999)
van de Waterbeemd, H. (ed.): Structure-Property Correlations in Drug Research. Landes, Austin (1996)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2000 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Ganter, B., Kuznetsov, S.O. (2000). Formalizing Hypotheses with Concepts. In: Ganter, B., Mineau, G.W. (eds) Conceptual Structures: Logical, Linguistic, and Computational Issues. ICCS 2000. Lecture Notes in Computer Science(), vol 1867. Springer, Berlin, Heidelberg. https://doi.org/10.1007/10722280_24
Download citation
DOI: https://doi.org/10.1007/10722280_24
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-67859-5
Online ISBN: 978-3-540-44663-7
eBook Packages: Springer Book Archive