Closure Versus Dualization: A Comparison of Software Tools for Formal Concept Analysis
- 6 September 2025
- book chapter
- Published by Springer Nature
- p. 219-227
Abstract
No abstract availableKeywords
This publication has 9 references indexed in Scilit:
- A Repository for Formal Contexts2024
- fcaR, Formal Concept Analysis with RThe R Journal, 2022
- Efficient Algorithms for Dualizing Large-Scale Hypergraphs2013
- Parallel algorithm for computing fixpoints of Galois connectionsAnnals of Mathematics and Artificial Intelligence, 2010
- Closed patterns meet n -ary relationsACM Transactions on Knowledge Discovery From Data, 2009
- TRIAS--An Algorithm for Mining Iceberg Tri-Lattices2006
- AddIntent: A New Incremental Algorithm for Constructing Concept Lattices2004
- Polyadic Concept AnalysisOrder, 2002
- Formal Concept Analysis1999