Abstract
We generalize the main notions of Formal Concept Analysis with the ideas of the semantic probabilistic inference. We demonstrate that under standard restrictions, our definitions completely correspond to the original notions of Formal Concept Analysis. From the point of view of applications, we propose a method of recovering concepts in formal contexts in presence of noise on data.
This work was funded by the grant of the President of Russian Federation (grant No. MK-2037.2011.9), the Russian Foundation for Basic Research (grant No. 11-07-00560a), and Integration Projects of the Siberian Division of the Russian Academy of Sciences (grant No. 47, 111, 119).
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
Deogun, J., Jiang, L., Xie, Y., Raghavan, V.: Probability Logic Modeling of Knowledge Discovery in Databases. In: Zhong, N., Raś, Z.W., Tsumoto, S., Suzuki, E. (eds.) ISMIS 2003. LNCS (LNAI), vol. 2871, pp. 402–407. Springer, Heidelberg (2003)
Ganter, B., Wille, R.: Formal Concept Analysis: Mathematical Foundations. Springer, Heidelberg (1999)
Ganter, B., Stumme, G., Wille, R. (eds.): Formal Concept Analysis: Foundations and Applications. Springer, Heidelberg (2005)
Guigues, J.– L., Duquenne, V.: Families minimales d’implications informatives resultant d’un tableau de données binaires. Math. Sci. Humaines 95, 5–18 (1986)
Kovalerchuk, B., Vityaev, E.: Data Mining in Finance: Advances in Relational and Hybrid methods. Kluwer (2000)
Kuznetsov, S.: On the intractability of computing the Duquenne–Guigues base. J. UCS 10(8), 927–933 (2004)
Kuznetsov, S., Obiedkov, S.: Comparing performance of algorithms for generating concept lattices. J. Exp. Theor. Artif. Intell. 14(2-3), 189–216 (2002)
van der Merwe, D., Obiedkov, S., Kourie, D.: AddIntent: A New Incremental Algorithm for Constructing Concept Lattices. In: Eklund, P. (ed.) ICFCA 2004. LNCS (LNAI), vol. 2961, pp. 372–385. Springer, Heidelberg (2004)
Smerdov, S., Vityaev, E.: Synthesis of logic, probability, and learning: Formalizing the concept of prediction. Siberian Electronic Mathematical Reports 6, 340–365 (2009) (in Russian, with english abstract)
Vityaev, E.: Knowledge Discovery. Computational Cognition. Models of Cognitive Processes, p. 293. Novosibirsk State University (2006) (in Russian)
Vityaev, E.: The logic of prediction. In: Proc. 9th Asian Logic Conference, pp. 263–276 (2006)
Vityaev, E., Kovalerchuk, B.: Empirical theories discovery based on the Measurement Theory. Mind and Machine 14(4), 551–573 (2005)
Vityaev, E., Lapardin, K., Khomicheva, I., Proskura, A.: Transcription factor binding site recognition by regularity matrices based on the natural classification method. Intelligent Data Analysis 12(5), 495–512 (2008); Vityaev, E., Kolchanov, N. (eds.) Special Issue New Methods in Bioinformatics
Vityaev, E., Smerdov, S.: New definition of prediction without logical inference. In: Kovalerchuk, B. (ed.) Proc. IASTED Int. Conf. on Computational Intelligence (CI 2009), pp. 48–54 (2009)
Scientific Discovery website, http://math.nsc.ru/AP/ScientificDiscovery/
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2012 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Demin, A., Ponomaryov, D., Vityaev, E. (2012). Probabilistic Concepts in Formal Contexts. In: Clarke, E., Virbitskaite, I., Voronkov, A. (eds) Perspectives of Systems Informatics. PSI 2011. Lecture Notes in Computer Science, vol 7162. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-29709-0_33
Download citation
DOI: https://doi.org/10.1007/978-3-642-29709-0_33
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-29708-3
Online ISBN: 978-3-642-29709-0
eBook Packages: Computer ScienceComputer Science (R0)