The following pages link to (Q4170725):
Displaying 18 items.
- Fast algorithm for computing fixpoints of Galois connections induced by object-attribute relational data (Q425555) (← links)
- Mathematical aspects of concept analysis (Q676803) (← links)
- Handling high dimensionality contexts in formal concept analysis via binary decision diagrams (Q781866) (← links)
- An incremental algorithm to construct a lattice of set intersections (Q1001808) (← links)
- Foliated semantic networks: Concepts, facts, qualities (Q1202680) (← links)
- An incremental concept formation approach for learning from databases (Q1341713) (← links)
- A formal method for inheritance graph hierarchy construction (Q1394885) (← links)
- Lattices, closures systems and implication bases: a survey of structural aspects and algorithms (Q1659991) (← links)
- Complexity of learning in concept lattices from positive and negative examples (Q1878406) (← links)
- Link key candidate extraction with relational concept analysis (Q2286378) (← links)
- Attribute-incremental construction of the canonical implication basis (Q2385433) (← links)
- A local approach to concept generation (Q2385441) (← links)
- Parallel algorithm for computing fixpoints of Galois connections (Q2430355) (← links)
- Closure-based constraints in formal concept analysis (Q2446833) (← links)
- A framework for incremental generation of closed itemsets (Q2478435) (← links)
- The rectangle complex of a relation (Q2682893) (← links)
- Data mining algorithms to compute mixed concepts with negative attributes: an application to breast cancer data analysis (Q2831029) (← links)
- Computing stable extensions of argumentation frameworks using formal concept analysis (Q6545530) (← links)
