Yoosof Mashayekhi, Ehsan Nazerfard, Arman Rahbar, Samira Sirzadeh Haji Mahmood
{"title":"The MinMax Fuzzy C-Means","authors":"Yoosof Mashayekhi, Ehsan Nazerfard, Arman Rahbar, Samira Sirzadeh Haji Mahmood","doi":"10.1109/KBEI.2019.8734919","DOIUrl":null,"url":null,"abstract":"Fuzzy c-means (FCM) is one of the most popular fuzzy clustering methods and it is used in various applications in computer science. Most clustering methods including FCM, suffer from bad initialization problem. If initial cluster centers (membership degree initialization in FCM) are not selected appropriately, it may yield poor results. In this paper we propose a method called MinMax FCM to overcome this problem. A new objective function is designed in MinMax FCM to this aim. We use maximum variance of clusters as objective function. In this regard, high-variance clusters are penalized. We compare MinMax FCM with FCM in terms of sum of clusters’ variances, maximum variance of clusters, and execution time using a number of UCI datasets.","PeriodicalId":339990,"journal":{"name":"2019 5th Conference on Knowledge Based Engineering and Innovation (KBEI)","volume":"33 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2019-02-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2019 5th Conference on Knowledge Based Engineering and Innovation (KBEI)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/KBEI.2019.8734919","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0
Abstract
Fuzzy c-means (FCM) is one of the most popular fuzzy clustering methods and it is used in various applications in computer science. Most clustering methods including FCM, suffer from bad initialization problem. If initial cluster centers (membership degree initialization in FCM) are not selected appropriately, it may yield poor results. In this paper we propose a method called MinMax FCM to overcome this problem. A new objective function is designed in MinMax FCM to this aim. We use maximum variance of clusters as objective function. In this regard, high-variance clusters are penalized. We compare MinMax FCM with FCM in terms of sum of clusters’ variances, maximum variance of clusters, and execution time using a number of UCI datasets.
京公网安备 11010802042870号
京ICP备2023020795号-1
分享
求助内容：
应助结果提醒方式：
扫码关注我们
