On a new evidential C-means algorithm with instance-level constraints
From MaRDI portal
Recommendations
- CECM: constrained evidential C-means algorithm
- Fast semi-supervised evidential clustering
- Some Pairwise Constrained Semi-Supervised Fuzzy c-Means Clustering Algorithms
- A semi-supervised spectral clustering algorithm based on pairwise constraints
- Semi-supervised fuzzy \(c\)-means algorithms by revising dissimilarity/kernel matrices
Cites work
- A Reflective Newton Method for Minimizing a Quadratic Function Subject to Bounds on Some of the Variables
- Active semi-supervised fuzzy clustering
- CECM: constrained evidential C-means algorithm
- ECM: An evidential version of the fuzzy c-means algorithm
- scientific article; zbMATH DE number 3942813 (Why is no real title available?)
- scientific article; zbMATH DE number 3701955 (Why is no real title available?)
- scientific article; zbMATH DE number 3560492 (Why is no real title available?)
- The transferable belief model
Cited in
(5)- Fast semi-supervised evidential clustering
- Clustering with constraints: a mean-field approximation perspective
- CECM: constrained evidential C-means algorithm
- An effective semi-supervised clustering framework integrating pairwise constraints and attribute preferences
- Mixture Modeling with Pairwise, Instance-Level Class Constraints
This page was built for publication: On a new evidential C-means algorithm with instance-level constraints
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3297802)