Pages that link to "Item:Q527183"
From MaRDI portal
The following pages link to A `best-of-breed' approach for designing a fast algorithm for computing fixpoints of Galois connections (Q527183):
Displaying 18 items.
- Handling high dimensionality contexts in formal concept analysis via binary decision diagrams (Q781866) (← links)
- On efficient factorization of standard fuzzy concept lattices and attribute-oriented fuzzy concept lattices (Q1795368) (← links)
- LCM from FCA point of view: a CbO-style algorithm with speed-up features (Q2076970) (← links)
- On pruning techniques in map-reduce style CbO algorithms (Q2107482) (← links)
- Interface between logical analysis of data and formal concept analysis (Q2178106) (← links)
- Reinventing known results in FCA: notes on two recently published algorithms for computation of formal concepts (Q2286395) (← links)
- Evolution of objects and concepts (Q2296038) (← links)
- A reduction theorem to compute fixpoints of fuzzy closure operators (Q2328960) (← links)
- Rules acquisition of formal decision contexts based on three-way concept lattices (Q2660909) (← 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)
- DECOMPOSITIONAL APPROACH TO RESEARCH OF FORMAL CONTEXTS (Q5151269) (← links)
- On Decomposition of a Binary Context Without Losing Formal Concepts (Q5853395) (← links)
- Systematic categorization and evaluation of CbO-based algorithms in FCA (Q6065995) (← links)
- LinCbO: fast algorithm for computation of the Duquenne-Guigues basis (Q6071284) (← links)
- Pruning techniques in lincbo for the computation of the duquenne-guigues basis (Q6125182) (← links)
- Concept and attribute reduction based on rectangle theory of formal concept (Q6167852) (← links)
- Formal concept analysis for the generation of plural referring expressions (Q6186857) (← links)
