Possibilistic rough fuzzy C-means algorithm in data clustering and image segmentation

摘要: Several data clustering techniques have been developed in literature. It has observed that the algorithms by using imprecise models like rough sets, fuzzy sets and intuitionistic better than crisp algorithms. Also, hybrid provide far individual models. such a combination of set introduced Zadeh, Pawlak Atanassov. Notable among them being Rough Fuzzy C-Means (RFCM) Mitra et al c-means algorithm (RIFCM) studied Tripathy Krishnapuram Keller basic probabilistic flavour; for example due to presence constraint on memberships used (FCM) algorithm. So, they concept possibilistic approach C-means (PFCM) Another PFCM is Pal al. In this paper, we improve (PRCM) Anuradha et, introduce new algorithm, which call as (PRFCM) compare its efficiency with improved PRCM PRFCM establish experimentally comparatively corresponding RCM We perform experimental analysis taking different types numerical datasets images inputs standard accuracy measures DB D-index.