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.
CITATION STYLE
Vityaev, E. E., & Martinovich, V. V. (2015). Probabilistic formal concepts with negation. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 8974, pp. 385–399). Springer Verlag. https://doi.org/10.1007/978-3-662-46823-4_31
Mendeley helps you to discover research relevant for your work.