Incomplete classifications of a finite set of objects using monotone systems
From MaRDI portal
The paper is dedicated to incomplete classifications. An incomplete classification is a method which identifies a special class of objects (e.g. background) and then assigns the rest of objects to disjoint classes. The authors introduce an incomplete classification method based on the identification of the minimal cores of a monotone system. The proposed algorithm does not depend neither on the number of classes nor on the number of objects involved in the process of classification.
Recommendations
- Classification algorithms based on core seeking in sequences of nested monotone systems
- A distance based classification method using an incomplete training set
- Incomplete information systems
- An approach to solving classification problems under incomplete information
- scientific article; zbMATH DE number 4145363
Cited in
(7)- Fixed points approach to clustering
- Monotone linkage clustering and quasi-concave set functions
- Classification algorithms based on core seeking in sequences of nested monotone systems
- Diverse data selection via combinatorial quasi-concavity of distance covariance: a polynomial time global minimax algorithm
- Quasi-concave functions on meet-semilattices
- A distance based classification method using an incomplete training set
- Duality between quasi-concave functions and monotone linkage functions
This page was built for publication: Incomplete classifications of a finite set of objects using monotone systems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q920517)
