Formal Concept Analysis
From MaRDI portal
Publication:5710379
DOI10.1007/b105806zbMath1078.68773OpenAlexW2784958976WikidataQ59640361 ScholiaQ59640361MaRDI QIDQ5710379
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
Knowledge representation (68T30) Galois correspondences, closure operators (in relation to ordered sets) (06A15) Lattices (06B99)
Related Items (4)
Listing closed sets of strongly accessible set systems with applications to data mining ⋮ Recursive decomposition tree of a Moore co-family and closure algorithm. ⋮ Enumeration aspects of maximal cliques and bicliques ⋮ Effective approximation of parametrized closure systems over transactional data streams
This page was built for publication: Formal Concept Analysis
