Transfer Evidential C-Means Clustering

DOI10.1007/978-3-030-88601-1_5zbMATH Open1518.68303MaRDI QIDQ6488063FDOQ6488063

Authors: Lianmeng Jiao, Feng Wang, Quan Pan 

Publication date: 24 March 2023

Recommendations

• Evidential Clustering Based on Transfer Learning
• ECM: An evidential version of the fuzzy \(c\)-means algorithm
• Knowledge transfer based maximum entropy clustering
• CECM: constrained evidential \(C\)-means algorithm
• Fast Unfolding of Credal Partitions in Evidential Clustering

Mathematics Subject Classification ID

Classification and discrimination; cluster analysis (statistical aspects) (62H30) Learning and adaptive systems in artificial intelligence (68T05)

Cites Work

• ECM: An evidential version of the fuzzy \(c\)-means algorithm

Cited In (8)

• Knowledge transfer based maximum entropy clustering
• Transfer affinity propagation clustering algorithm
• Transfer affinity propagation-based clustering
• Evidential prototype-based clustering based on transfer learning
• CECM: constrained evidential \(C\)-means algorithm
• ECM: An evidential version of the fuzzy \(c\)-means algorithm
• Fast Unfolding of Credal Partitions in Evidential Clustering
• Evidential Clustering Based on Transfer Learning

This page was built for publication: Transfer Evidential C-Means Clustering

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6488063)