Abstract
A model of learning from positive and negative examples in concept lattices is considered. Lattice- and graph-theoretic interpretations of learning concept-based classification rules (called hypotheses) and classification in this model are given. The problems of counting all formal concepts, all hypotheses, and all minimal hypotheses are shown to be #P-complete. NP-completeness of some decision problems related to learning and classification in this setting is demonstrated and several conditions of tractability of these problems are considered. Some useful particular cases where these problems can be solved in polynomial time are indicated.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
