On critical sets of a finite Moore family
From MaRDI portal
Publication:481926
DOI10.1007/s11634-009-0053-8zbMath1306.62139OpenAlexW2019111599MaRDI QIDQ481926
Publication date: 18 December 2014
Published in: Advances in Data Analysis and Classification. ADAC (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s11634-009-0053-8
Lua error in Module:PublicationMSCList at line 37: attempt to index local 'msc_result' (a nil value).
Cites Work
- Systems of sets such that each set properly intersects at most one other set -- application to cluster analysis
- Cluster structures and collections of Galois closed entity subsets
- Weak hierarchies associated with similarity measures - An additive clustering technique
- Functional dependencies in relational databases: A lattice point of view
- Choice functions and abstract convex geometries
- An order theoretic framework for overlapping clustering
- NP-hard approximation problems in overlapping clustering.
- A characterization theorem for the canonical basis of a closure operator
- The \(k\)-weak hierarchical representations: An extension of the indexed closed weak hierarchies
- The lattices of closure systems, closure operators, and implicational systems on a finite set: A survey
- Closure systems, implicational systems, overhanging relations and the case of hierarchical classification
- THE LATTICE THEORY OF FUNCTIONAL DEPENDENCIES AND NORMAL DECOMPOSITIONS
- Path Independence, Rationality, and Social Choice
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: On critical sets of a finite Moore family
