Complexity of learning in concept lattices from positive and negative examples

DOI10.1016/j.dam.2003.11.002zbMath1077.68039OpenAlexW2051227029MaRDI QIDQ1878406

Sergei O. Kuznetsov

Publication date: 19 August 2004

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.dam.2003.11.002

zbMATH Keywords

LearningAlgorithmic complexityConcept lattices

Mathematics Subject Classification ID

Computational learning theory (68Q32)

Related Items (17)

Metric generalization of classification algorithms based on formal concept analysis ⋮ Concept-cognitive computing system for dynamic classification ⋮ Interface between logical analysis of data and formal concept analysis ⋮ On stability of fuzzy formal concepts over randomized one-sided formal context ⋮ A dynamic rule-based classification model via granular computing ⋮ Formal concept analysis based on the topology for attributes of a formal context ⋮ Enumerating Minimal Hypotheses and Dualizing Monotone Boolean Functions on Lattices ⋮ OnL-fuzzy Chu correspondences ⋮ Dualization in lattices given by ordered sets of irreducibles ⋮ Three-way concept learning based on cognitive operators: an information fusion viewpoint ⋮ Multi-adjoint t-concept lattices ⋮ General framework for consistencies in decision contexts ⋮ On the dualization in distributive lattices and related problems ⋮ A closed sets based learning classifier for implicit authentication in web browsing ⋮ On closure operators related to maximal tricliques in tripartite hypergraphs ⋮ Direct-optimal basis computation by means of the fusion of simplification rules ⋮ Automatic Validation of Terminology by Means of Formal Concept Analysis

Cites Work

• On generating all maximal independent sets
• A fast algorithm for building lattices
• The Complexity of Enumeration and Reliability Problems
• Node-Deletion Problems on Bipartite Graphs
• Comparing performance of algorithms for generating concept lattices
• An $n^{5/2} $ Algorithm for Maximum Matchings in Bipartite Graphs
• Concept Lattices
• Bicliques in graphs. I: Bounds on their number
• On computing the size of a lattice and related decision problems
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Complexity of learning in concept lattices from positive and negative examples