Comparison of Data Structures for Computing Formal Concepts

DOI10.1007/978-3-642-04820-3_11zbMath1273.68379OpenAlexW1816496736MaRDI QIDQ3652100

Vilem Vychodil, Petr Krajča

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

performancealgorithmscomparisondata structuresformal concept analysis

Mathematics Subject Classification ID

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

Related Items (7)

Introducing the closure structure and the GDPM algorithm for mining and understanding a tabular dataset ⋮ Fast algorithm for computing fixpoints of Galois connections induced by object-attribute relational data ⋮ 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 ⋮ 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

This page was built for publication: Comparison of Data Structures for Computing Formal Concepts