An analysis of first-order logics of probability
Artificial Intelligence
Efficient mining of association rules using closed itemset lattices
Information Systems
Data mining in finance: advances in relational and hybrid methods
Data mining in finance: advances in relational and hybrid methods
Formal Concept Analysis: Mathematical Foundations
Formal Concept Analysis: Mathematical Foundations
Introduction to Data Mining, (First Edition)
Introduction to Data Mining, (First Edition)
Discovery of empirical theories based on the measurement theory
Minds and Machines - Machine learning as experimental philosophy of science
Discovering Significant Patterns
Machine Learning
Intelligent Data Analysis - New Methods in Bioinformatics Presented at the Fifth International Conference on Bioinformatics of Genome Regulation and Structure
Hi-index | 0.00 |
An inductive probabilistic approach to formal concept analysis (FCA) is proposed in which probability on formal contexts is considered; probabilistic formal concepts that have predictive force are defined: nonclassified objects can be assigned to earlier found probabilistic formal concepts; random attributes are eliminated from probabilistic formal concepts; probabilistic formal concepts are robust with respect to data noise. A result of experiment is presented in which formal concepts (in their standard definition in FCA) are first distorted by random noise and then recovered by detecting probabilistic formal concepts.