Formal Concept Analysis
From MaRDI portal
Publication:5710380
DOI10.1007/b105806zbMath1078.68144OpenAlexW2784958976WikidataQ59640361 ScholiaQ59640361MaRDI QIDQ5710380
Raoul Median, Lhouari Nourine, Yoan Renaud, Alain Gély
Publication date: 2 December 2005
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/b105806
Database theory (68P15) Knowledge representation (68T30) Galois correspondences, closure operators (in relation to ordered sets) (06A15)
Related Items (4)
Local and global symmetry breaking in itemset mining ⋮ On the complexity of enumerating pseudo-intents ⋮ Some Complexity Results about Essential Closed Sets ⋮ Succinct System of Minimal Generators: A Thorough Study, Limitations and New Definitions
This page was built for publication: Formal Concept Analysis
