On generating all maximal independent sets
Information Processing Letters
The computational complexity of abduction
Artificial Intelligence - Special issue on knowledge representation
The design of relational databases
The design of relational databases
Functional dependencies in relational databases: a lattice point of view
Discrete Applied Mathematics - Special issue on combinatorial problems in databases
Efficient algorithms for listing combinatorial structures
Efficient algorithms for listing combinatorial structures
Machine Learning
The common order-theoretic structure of version spaces and ATMSs
Artificial Intelligence
A fast algorithm for building lattices
Information Processing Letters
A relational model of data for large shared data banks
Communications of the ACM
Machine Learning
Formal Concept Analysis: Mathematical Foundations
Formal Concept Analysis: Mathematical Foundations
Computers and Intractability; A Guide to the Theory of NP-Completeness
Computers and Intractability; A Guide to the Theory of NP-Completeness
Computers and Intractability: A Guide to the Theory of NP-Completeness
Computers and Intractability: A Guide to the Theory of NP-Completeness
Machine Learning
Stepwise Construction of the Dedekind-MacNeille Completion (Research Note)
ICCS '98 Proceedings of the 6th International Conference on Conceptual Structures: Theory, Tools and Applications
Formalizing Hypotheses with Concepts
ICCS '00 Proceedings of the Linguistic on Conceptual Structures: Logical Linguistic, and Computational Issues
Conceptual Knowledge Discovery in Databases Using Formal Concept Analysis Methods
PKDD '98 Proceedings of the Second European Symposium on Principles of Data Mining and Knowledge Discovery
Learning of Simple Conceptual Graphs from Positive and Negative Examples
PKDD '99 Proceedings of the Third European Conference on Principles of Data Mining and Knowledge Discovery
Pattern Structures and Their Projections
ICCS '01 Proceedings of the 9th International Conference on Conceptual Structures: Broadening the Base
Version spaces: an approach to concept learning.
Version spaces: an approach to concept learning.
Theory of Relational Databases
Theory of Relational Databases
Version spaces without boundary sets
AAAI'97/IAAI'97 Proceedings of the fourteenth national conference on artificial intelligence and ninth conference on Innovative applications of artificial intelligence
An algorithm of constructing concept lattices for CAT with cognitive diagnosis
Knowledge-Based Systems
Formal concept analysis for the identification of combinatorial biomarkers in breast cancer
ICFCA'08 Proceedings of the 6th international conference on Formal concept analysis
Good classification tests as formal concepts
ICFCA'12 Proceedings of the 10th international conference on Formal Concept Analysis
International Journal of Approximate Reasoning
Computing premises of a minimal cover of functional dependencies is intractable
Discrete Applied Mathematics
| Hi-index | 0.00 |
A model of machine learning from positive and negative examples (JSM-learning) is described in terms of Formal Concept Analysis (FCA). Graph-theoretical and lattice-theoretical interpretations of hypotheses and classifications resulting in the learning are proposed. Hypotheses and classifications are compared with other objects from domains of data analysis and artificial intelligence: implications in FCA, functional dependencies in the theory of relational data bases, abduction models, version spaces, and decision trees. Results about algorithmic complexity of various problems related to the generation of formal concepts, hypotheses, classifications, and implications.