Formalizing hypotheses with concepts

DOI10.1007/10722280_24MaRDI QIDQ2754242zbMATH OpenFDO

Authors Bernhard Ganter, Sergei O. Kuznetsov

Publication date 11 November 2001

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/10722280_24

Mathematics Subject Classification ID

Learning and adaptive systems in artificial intelligence (68T05) Knowledge representation (68T30)

Recommendations

• Hypotheses and inductive predictions
• On stability of a formal concept
• Conjecturing from consequences
• Probabilistic generalization of formal concepts
• Mechanizing hypothesis formation. Principles and case studies

Cited in

(17)

• Hypotheses and inductive predictions
• Complexity of learning in concept lattices from positive and negative examples
• General framework for consistencies in decision contexts
• Algebraic machine learning: emphasis on efficiency
• Interface between logical analysis of data and formal concept analysis
• Contribution to attributive and object subcontexts in inferring good maximally redundant tests
• Thought experiments, formalization, and disagreement
• On the calculation of formal concept stability
• On stability of a formal concept
• Enumerating minimal hypotheses and dualizing monotone Boolean functions on lattices
• On neural network architecture based on concept lattices
• scientific article; zbMATH DE number 4041972 (Why is no real title available?)
• Comparing performance of algorithms for generating concept lattices
• Scale Coarsening as Feature Selection
• Mining for Unknown Unknowns
• Tri-level conflict analysis from the angle of three-valued concept analysis
• Some decision and counting problems of the Duquenne-Guigues basis of implications

This page was built for publication: Formalizing hypotheses with concepts

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2754242)