Sequential cluster extraction using power-regularized possibilistic c-means

Research output: Contribution to journalArticlepeer-review

5 Citations (Scopus)


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.

Original languageEnglish
Pages (from-to)67-73
Number of pages7
JournalJournal of Advanced Computational Intelligence and Intelligent Informatics
Issue number1
Publication statusPublished - 2015 Jan 1


  • Possibilistic clustering
  • Power-regularization
  • Sequential cluster extraction

ASJC Scopus subject areas

  • Human-Computer Interaction
  • Computer Vision and Pattern Recognition
  • Artificial Intelligence


Dive into the research topics of 'Sequential cluster extraction using power-regularized possibilistic c-means'. Together they form a unique fingerprint.

Cite this