The following pages link to Formal Concept Analysis (Q5710379):
Displayed 4 items.
- Effective approximation of parametrized closure systems over transactional data streams (Q782465) (← links)
- Listing closed sets of strongly accessible set systems with applications to data mining (Q844900) (← links)
- Enumeration aspects of maximal cliques and bicliques (Q1028116) (← links)
- Recursive decomposition tree of a Moore co-family and closure algorithm. (Q2248537) (← links)