On a New Evidential C-Means Algorithm with Instance-Level Constraints
From MaRDI portal
Publication:3297802
DOI10.1007/978-3-030-35514-2_6zbMath1440.68303OpenAlexW2993948824MaRDI QIDQ3297802
Publication date: 20 July 2020
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-030-35514-2_6
belief functionpairwise constraintssemi-supervised clusteringevidential clusteringinstance-level constraintslabeled data constraints
Related Items (1)
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- CECM: constrained evidential \(C\)-means algorithm
- The transferable belief model
- ECM: An evidential version of the fuzzy \(c\)-means algorithm
- Active semi-supervised fuzzy clustering
- A Reflective Newton Method for Minimizing a Quadratic Function Subject to Bounds on Some of the Variables
This page was built for publication: On a New Evidential C-Means Algorithm with Instance-Level Constraints