Pages that link to "Item:Q425555"
From MaRDI portal
The following pages link to Fast algorithm for computing fixpoints of Galois connections induced by object-attribute relational data (Q425555):
Displaying 24 items.
- A comprehensive survey on formal concept analysis, its research trends and applications (Q326255) (← links)
- A `best-of-breed' approach for designing a fast algorithm for computing fixpoints of Galois connections (Q527183) (← links)
- On efficient factorization of standard fuzzy concept lattices and attribute-oriented fuzzy concept lattices (Q1795368) (← links)
- Attribute reduction in intuitionistic fuzzy concept lattices (Q2015295) (← links)
- Describing hierarchy of concept lattice by using matrix (Q2053853) (← 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)
- Pruning techniques in LinCbO for computation of the Duquenne-Guigues basis (Q2117120) (← links)
- Interface between logical analysis of data and formal concept analysis (Q2178106) (← links)
- On attribute reduction in concept lattices: experimental evaluation shows discernibility matrix based methods inefficient (Q2200602) (← links)
- Impact of Boolean factorization as preprocessing methods for classification of Boolean data (Q2254610) (← links)
- Reinventing known results in FCA: notes on two recently published algorithms for computation of formal concepts (Q2286395) (← links)
- Contribution to attributive and object subcontexts in inferring good maximally redundant tests (Q2286403) (← links)
- Evolution of objects and concepts (Q2296038) (← links)
- A theoretical study on the object (property) oriented concept lattices based on three-way decisions (Q2296040) (← 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)
- A lattice-free concept lattice update algorithm (Q2817085) (← links)
- Using Pattern Structures for Analyzing Ontology-Based Annotations of Biomedical Data (Q4924387) (← links)
- Scalable Visual Analytics in FCA (Q5054985) (← 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)
