The following pages link to (Q3029054):
Displaying 33 items.
- A `best-of-breed' approach for designing a fast algorithm for computing fixpoints of Galois connections (Q527183) (← links)
- Mathematical aspects of concept analysis (Q676803) (← links)
- Handling high dimensionality contexts in formal concept analysis via binary decision diagrams (Q781866) (← links)
- Enumeration aspects of maximal cliques and bicliques (Q1028116) (← links)
- Complexity of minimum biclique cover and minimum biclique decomposition for bipartite domino-free graphs (Q1270816) (← links)
- An incremental concept formation approach for learning from databases (Q1341713) (← links)
- Computing on-line the lattice of maximal antichains of posets (Q1344242) (← links)
- Weak-order extensions of an order. (Q1401400) (← links)
- A fast algorithm for building lattices (Q1606994) (← links)
- Lattices, closures systems and implication bases: a survey of structural aspects and algorithms (Q1659991) (← links)
- Algorithms for computing the Shapley value of cooperative games on lattices (Q1800390) (← links)
- Complexity of learning in concept lattices from positive and negative examples (Q1878406) (← links)
- Representing a concept lattice by a graph (Q1885806) (← links)
- Associative models for storing and retrieving concept lattices (Q1958821) (← links)
- \textsc{NextPriorityConcept}: a new and generic algorithm computing concepts from complex and heterogeneous data (Q2207493) (← links)
- Recursive decomposition tree of a Moore co-family and closure algorithm. (Q2248537) (← links)
- Hermes: a simple and efficient algorithm for building the AOC-poset of a binary relation (Q2254614) (← links)
- FCA for software product line representation: mixing configuration and feature relationships in a unique canonical representation (Q2286383) (← links)
- Contribution to attributive and object subcontexts in inferring good maximally redundant tests (Q2286403) (← links)
- A local approach to concept generation (Q2385441) (← links)
- Dichotomic lattices and local discretization for Galois lattices (Q2418288) (← links)
- Generalized domination in closure systems (Q2489652) (← links)
- Improving the performance of Lindig-style algorithms with empty intersections (Q2670896) (← links)
- Data mining algorithms to compute mixed concepts with negative attributes: an application to breast cancer data analysis (Q2831029) (← links)
- (Q3315682) (← links)
- Reconstructing concept lattices usingnth-order context kernels (Q3446041) (← links)
- Pattern Detection in Object-Oriented Source Code (Q3612877) (← links)
- Analysis of Complex and Heterogeneous Data Using FCA and Monadic Predicates (Q5054978) (← links)
- Towards an Iterative Classification Based on Concept Lattice (Q5452430) (← links)
- Formal concept analysis for the generation of plural referring expressions (Q6186857) (← links)
- Computing stable extensions of argumentation frameworks using formal concept analysis (Q6545530) (← links)
- Single sample-oriented attribute reduction for rule learning with formal concept analysis (Q6588424) (← links)
- Plausible reasoning in an algorithm for generation of good classification tests (Q6589545) (← links)
