The following pages link to (Q5609474):
Displaying 13 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)
- Foliated semantic networks: Concepts, facts, qualities (Q1202680) (← links)
- An incremental concept formation approach for learning from databases (Q1341713) (← links)
- A fast algorithm for building lattices (Q1606994) (← links)
- Associative models for storing and retrieving concept lattices (Q1958821) (← links)
- Reinventing known results in FCA: notes on two recently published algorithms for computation of formal concepts (Q2286395) (← links)
- A local approach to concept generation (Q2385441) (← links)
- A framework for incremental generation of closed itemsets (Q2478435) (← links)
- Data mining algorithms to compute mixed concepts with negative attributes: an application to breast cancer data analysis (Q2831029) (← links)
- A fast incremental algorithm for building lattices (Q4409027) (← links)
