Comparison of data structures for computing formal concepts

DOI10.1007/978-3-642-04820-3_11MaRDI QIDQ3652100zbMATH OpenOpenAlexFDO

Authors Petr Krajca, Vilem Vychodil

Publication date 17 December 2009

Published in Modeling Decisions for Artificial Intelligence (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-642-04820-3_11

zbMATH Keywords

algorithmscomparisondata structuresformal concept analysisperformance

Mathematics Subject Classification ID

Data structures (68P05) Knowledge representation (68T30)

Recommendations

• Comparing performance of algorithms for generating concept lattices
• Concept Lattices
• scientific article; zbMATH DE number 1670915
• scientific article; zbMATH DE number 1898282
• An Algorithm to Find Frequent Concepts of a Formal Context with Taxonomy

Cited in

(11)

• Complexity of algorithms that construct subsets of data from formal definitions
• LCM from FCA point of view: a CbO-style algorithm with speed-up features
• Pruning techniques in LinCbO for computation of the Duquenne-Guigues basis
• On attribute reduction in concept lattices: experimental evaluation shows discernibility matrix based methods inefficient
• Biclustering meets triadic concept analysis
• Contribution to attributive and object subcontexts in inferring good maximally redundant tests
• Introducing the closure structure and the GDPM algorithm for mining and understanding a tabular dataset
• scientific article; zbMATH DE number 3862452 (Why is no real title available?)
• scientific article; zbMATH DE number 3876614 (Why is no real title available?)
• Polynomial Embeddings and Representations
• Fast algorithm for computing fixpoints of Galois connections induced by object-attribute relational data

This page was built for publication: Comparison of data structures for computing formal concepts

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3652100)