arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 2007.04908cs.AI
收藏

Modified Possibilistic Fuzzy C-Means Algorithm for Clustering Incomplete Data Sets

Telkom University(特卢克姆大学);AKBID Tahirah Al Baeti Bulukumba(塔希拉·阿尔·巴埃蒂助产学院布卢孔巴);Universitas Wijaya Kusuma Surabaya(泗水维贾亚·库苏马大学);Universitas Fajar(法贾尔大学)

Rustam, Koredianto Usman, Mudyawati Kamaruddin, Dina Chamidah, Nopendri, Khaerudin Saleh, Yulinda Eliskar, Ismail Marzuki

英文摘要:

Possibilistic fuzzy c-means (PFCM) algorithm is a reliable algorithm has been proposed to deal the weakness of two popular algorithms for clustering, fuzzy c-means (FCM) and possibilistic c-means (PCM). PFCM algorithm deals with the weaknesses of FCM in handling noise sensitivity and the weaknesses of PCM in the case of coincidence clusters. However, the PFCM algorithm can be only applied to cluster complete data sets. Therefore, in this study, we propose a modification of the PFCM algorithm that can be applied to incomplete data sets clustering. We modified the PFCM algorithm to OCSPFCM and NPSPFCM algorithms and measured performance on three things: 1) accuracy percentage, 2) a number of iterations to termination, and 3) centroid errors. Based on the results that both algorithms have the potential for clustering incomplete data sets. However, the performance of the NPSPFCM algorithm is better than the OCSPFCM algorithm for clustering incomplete data sets.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑