# TECM: Transfer Learning-based Evidential C-Means Clustering

arXiv: https://arxiv.org/abs/2112.10152 · HTML: https://mlsanity.com/paper/2112.10152/

## Key facts

- No citing papers in the map yet (data through 14 Oct 2026).
- Builds on 6 of its 63 references that are in the map.
- First posted on arXiv 19 Dec 2021.

## Builds on (most cited first, 6 of 6)

- [A Comprehensive Survey on Transfer Learning](https://mlsanity.com/paper/1911.02685/) (2019)
- [Deep Density-based Image Clustering](https://mlsanity.com/paper/1812.04287/) (2018)
- [NN-EVCLUS: Neural Network-based Evidential Clustering](https://mlsanity.com/paper/2009.12795/) (2020)
- [EGMM: an Evidential Version of the Gaussian Mixture Model for Clustering](https://mlsanity.com/paper/2010.01333/) (2020)
- [Transfer Prototype-based Fuzzy Clustering](https://mlsanity.com/paper/1409.5686/) (2014)
- [Median evidential c-means algorithm and its application to community detection](https://mlsanity.com/paper/1501.01460/) (2015)

## Abstract (arXiv)

As a representative evidential clustering algorithm, evidential c-means (ECM) provides a deeper insight into the data by allowing an object to belong not only to a single class, but also to any subset of a collection of classes, which generalizes the hard, fuzzy, possibilistic, and rough partitions. However, compared with other partition-based algorithms, ECM must estimate numerous additional parameters, and thus insufficient or contaminated data will have a greater influence on its clustering performance. To solve this problem, in this study, a transfer learning-based ECM (TECM) algorithm is proposed by introducing the strategy of transfer learning into the process of evidential clustering. The TECM objective function is constructed by integrating the knowledge learned from the source domain with the data in the target domain to cluster the target data. Subsequently, an alternate optimization scheme is developed to solve the constraint objective function of the TECM algorithm. The proposed TECM algorithm is applicable to cases where the source and target domains have the same or different numbers of clusters. A series of experiments were conducted on both synthetic and real datasets, and the experimental results demonstrated the effectiveness of the proposed TECM algorithm compared to ECM and other representative multitask or transfer-clustering algorithms.