The present study proposes an algorithm for sequential cluster extraction using power-regularized possibilistic c-means (pPCM). First, pPCM is derived in a similar manner to two types of entropy-regularized possibilistic c-means (ePCM) derivations, where a power function is utilized instead of the negative entropy in ePCM. The cluster fusion with pPCM is identical to the mean-shift with a generalized Epanichnikov kernel, whereas the proposed method employs sequential cluster extraction with pPCM. Numerical examples show that the cluster number produced by the proposed algorithm did not match with the true class number in real datasets, but the extracted clustering results were partially successful in terms of capturing dense regions of objects.
|ジャーナル||Journal of Advanced Computational Intelligence and Intelligent Informatics|
|出版ステータス||Published - 2015 1月 1|
ASJC Scopus subject areas
- コンピュータ ビジョンおよびパターン認識