A `best-of-breed' approach for designing a fast algorithm for computing fixpoints of Galois connections

DOI10.1016/j.ins.2014.10.011zbMath1360.68797OpenAlexW1991761908MaRDI QIDQ527183

Simon Andrews

Publication date: 16 May 2017

Published in: Information Sciences (Search for Journal in Brave)

Full work available at URL: http://shura.shu.ac.uk/8677/1/Andrews_a_best_of_breed_approach_for_designing2015.pdf

zbMATH Keywords

formal concept analysisfast CbO algorithmFCAfixpoints of Galois connectionsin-closepartial closure canonicity test

Mathematics Subject Classification ID

Knowledge representation (68T30) Galois correspondences, closure operators (in relation to ordered sets) (06A15)

Related Items (18)

Rules acquisition of formal decision contexts based on three-way concept lattices ⋮ Interface between logical analysis of data and formal concept analysis ⋮ Improving the performance of Lindig-style algorithms with empty intersections ⋮ Systematic categorization and evaluation of CbO-based algorithms in FCA ⋮ LinCbO: fast algorithm for computation of the Duquenne-Guigues basis ⋮ Pruning techniques in lincbo for the computation of the duquenne-guigues basis ⋮ Concept and attribute reduction based on rectangle theory of formal concept ⋮ Formal concept analysis for the generation of plural referring expressions ⋮ DECOMPOSITIONAL APPROACH TO RESEARCH OF FORMAL CONTEXTS ⋮ Reinventing known results in FCA: notes on two recently published algorithms for computation of formal concepts ⋮ On efficient factorization of standard fuzzy concept lattices and attribute-oriented fuzzy concept lattices ⋮ Evolution of objects and concepts ⋮ Data mining algorithms to compute mixed concepts with negative attributes: an application to breast cancer data analysis ⋮ LCM from FCA point of view: a CbO-style algorithm with speed-up features ⋮ Handling high dimensionality contexts in formal concept analysis via binary decision diagrams ⋮ A reduction theorem to compute fixpoints of fuzzy closure operators ⋮ On Decomposition of a Binary Context Without Losing Formal Concepts ⋮ On pruning techniques in map-reduce style CbO algorithms

Uses Software

• AddIntent
• UCI-ml
• FcaBedrock
• In-Close
• FCbO
• FCALGS

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Fast algorithm for computing fixpoints of Galois connections induced by object-attribute relational data
• Mathematical aspects of concept analysis
• A fast algorithm for building lattices
• Parallel algorithm for computing fixpoints of Galois connections
• Comparing performance of algorithms for generating concept lattices
• Concept Lattices
• On computing the size of a lattice and related decision problems

This page was built for publication: A `best-of-breed' approach for designing a fast algorithm for computing fixpoints of Galois connections