scientific article; zbMATH DE number 3823743
From MaRDI portal
Publication:3671128
Cited in
(13)- Complexity of learning in concept lattices from positive and negative examples
- Classification based on formal concept analysis and biclustering: possibilities of the approach
- On Shapley value interpretability in concept-based learning with formal concept analysis
- A new kind of implication to reason with unknown information
- Algebraic machine learning: emphasis on efficiency
- Contribution to attributive and object subcontexts in inferring good maximally redundant tests
- On the calculation of formal concept stability
- On stability of a formal concept
- Enumerating minimal hypotheses and dualizing monotone Boolean functions on lattices
- Dualization in lattices given by ordered sets of irreducibles
- Scale Coarsening as Feature Selection
- Plausible reasoning in an algorithm for generation of good classification tests
- Mathematical aspects of concept analysis
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3671128)