PSI 2014: Perspectives of System Informatics pp 385-399 | Cite as
Probabilistic Formal Concepts with Negation
Abstract
The probabilistic generalization of formal concept analysis, as well as it’s comparison to standard formal analysis is presented. Construction is resistant to noise in the data and give one an opportunity to consider contexts with negation (object-attribute relation which allows both attribute presence and it’s absence). This generalization is obtained from the notion of formal concepts with its definition as fixed points of implications, when implications, possibly with negations, are replaced by probabilistic laws. We prove such fixed points (based on the probabilistic implications) to be consistent and wherefore determine correct probabilistic formal concepts. In the end, the demonstration for the probabilistic formal concepts formation is given together with noise resistance example.
Keywords
Formal concept analysis Probability Data mining Association rules NoiseReferences
- 1.Ganter, B.: Formal Concept Analysis: Methods, and Applications in Computer Science. TU Dresden, Germany (2003)Google Scholar
- 2.Ganter, B., Wille, R.: Formal concept analysis - Mathematical Foundations. LNCS (LNAI). Springer, Heidelberg (1999)CrossRefMATHGoogle Scholar
- 3.Klimushkin, M., Obiedkov, S., Roth, C.: Approaches to the selection of relevant concepts in the case of noisy data. In: Kwuida, L., Sertkaya, B. (eds.) ICFCA 2010. LNCS, vol. 5986, pp. 255–266. Springer, Heidelberg (2010) CrossRefGoogle Scholar
- 4.Kuznetsov, S.O.: On stability of a formal concept. Ann. Math. Artif. Intell. 49, 101–115 (2007)CrossRefMATHMathSciNetGoogle Scholar
- 5.Demin, A., Ponomaryov, D., Vityaev, E.: Probabilistic concepts in formal contexts. In: Proceedings of ARCOE Workshop at IJCAI 2011, pp. 31–35. Barcelona (2011)Google Scholar
- 6.Vityaev, E.E., Demin, A.V., Ponomaryov, D.K.: Probabilistic generalization of formal concepts. Program. Comput. Softw. 38(5), 219–230 (2012)CrossRefMATHMathSciNetGoogle Scholar
- 7.Ganter, B., Obiedkov, S.: Implications in Triadic Formal Contexts. TU Dresden, Springer (2004)Google Scholar
- 8.Missaoui, R., Kwuida, L.: Implications in triadic formal contexts. In: 9th International Conference, ICFCA 2011, Nicosia, Cyprus. Springer (2011)Google Scholar
- 9.Vityaev, E., Kovalerchuk, B.: Empirical theories discovery based on the measurement theory. Mind Mach. 14(4), 551–573 (2004)CrossRefGoogle Scholar
- 10.Vityaev, E.E.: The logic of prediction. Mathematical Logic in Asia. In: Proceedings of the 9th Asian Logic Conference Mathematical Logic in Asia, pp. 263–276. World Scientific, Singapore (2006)Google Scholar
- 11.Vityaev, E.E.: Knowledge Discovery. Computational Cognition. Cognitive Process Models. Novosibirsk State University Press, Novosibirsk (2006). (in Russian)Google Scholar
- 12.Vityaev, E., Smerdov, S.: On the problem of prediction. In: Wolff, K.E., Palchunov, D.E., Zagoruiko, N.G., Andelfinger, U. (eds.) KONT 2007 and KPP 2007. LNCS, vol. 6581, pp. 280–296. Springer, Heidelberg (2011) CrossRefGoogle Scholar
- 13.Kovalerchuk, B., Vityaev, E.: Data Mining in Finance: Advances in Relational and Hybrid methods. Kluwer Academic Publishers, Boston (2000) Google Scholar
- 14.Speransky, S.O.: On the logical consistency of probabilistic predictions. Messenger of NGU. Series: Mathematics, Mechanics, Informatics 11, 99–115 (2011). (in Russian)Google Scholar
- 15.Speransky, S.O.: Logic of probability and probability logic. Novosibirsk State University, Novosibirsk, Ph.D. thesis (2013). (in Russian)Google Scholar
- 16.Vityaev, E.E., Lapardin, K.A., Khomicheva, I.V., Proskura, A.L.: Transcription factor binding site recognition by regularity matrices based on the natural classification method. Intell. Data Anal. 12(5), 495–512 (2008)Google Scholar
- 17.Vityaev, E.E., Neupokoev, N.V.: Formal model of perception and pattern as fix point of anticipations. In: Approaches to the thinking modeling, pp. 155–172. URSS, Moscow, Editorial (2014). (in Russian)Google Scholar