scientific article; zbMATH DE number 4016967
From MaRDI portal
Publication:3029054
Recommendations
Cited in
(39)- Enumeration aspects of maximal cliques and bicliques
- Complexity of minimum biclique cover and minimum biclique decomposition for bipartite domino-free graphs
- An incremental concept formation approach for learning from databases
- Computing on-line the lattice of maximal antichains of posets
- Weak-order extensions of an order.
- A fast algorithm for building lattices
- Lattices, closures systems and implication bases: a survey of structural aspects and algorithms
- Algorithms for computing the Shapley value of cooperative games on lattices
- Complexity of learning in concept lattices from positive and negative examples
- Representing a concept lattice by a graph
- Associative models for storing and retrieving concept lattices
- \textsc{NextPriorityConcept}: a new and generic algorithm computing concepts from complex and heterogeneous data
- Recursive decomposition tree of a Moore co-family and closure algorithm.
- Hermes: a simple and efficient algorithm for building the AOC-poset of a binary relation
- FCA for software product line representation: mixing configuration and feature relationships in a unique canonical representation
- Contribution to attributive and object subcontexts in inferring good maximally redundant tests
- On computing the Galois lattice of bipartite distance hereditary graphs
- A local approach to concept generation
- Dichotomic lattices and local discretization for Galois lattices
- Generalized domination in closure systems
- Improving the performance of Lindig-style algorithms with empty intersections
- Galois lattice as a framework to specify building class hierarchies algorithms
- Data mining algorithms to compute mixed concepts with negative attributes: an application to breast cancer data analysis
- scientific article; zbMATH DE number 3845812 (Why is no real title available?)
- Reconstructing concept lattices usingnth-order context kernels
- scientific article; zbMATH DE number 4160798 (Why is no real title available?)
- Performances of Galois Sub-hierarchy-building Algorithms
- Pattern Detection in Object-Oriented Source Code
- A fast incremental algorithm for building lattices
- Analysis of Complex and Heterogeneous Data Using FCA and Monadic Predicates
- A `best-of-breed' approach for designing a fast algorithm for computing fixpoints of Galois connections
- Galois lattice theory for probabilistic visual landmarks
- Towards an Iterative Classification Based on Concept Lattice
- Formal concept analysis for the generation of plural referring expressions
- Computing stable extensions of argumentation frameworks using formal concept analysis
- Single sample-oriented attribute reduction for rule learning with formal concept analysis
- Plausible reasoning in an algorithm for generation of good classification tests
- Mathematical aspects of concept analysis
- Handling high dimensionality contexts in formal concept analysis via binary decision diagrams
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 Q3029054)
