一种改进的模糊聚类罚函数算法

Md. Kibria Saroare, Md. Syadus Sefat, S. Sen, M. Shahjahan
{"title":"一种改进的模糊聚类罚函数算法","authors":"Md. Kibria Saroare, Md. Syadus Sefat, S. Sen, M. Shahjahan","doi":"10.1109/INTELLISYS.2017.8324332","DOIUrl":null,"url":null,"abstract":"Clustering is one of the most challenging tasks to organize and categorize data with the presence of noise and outliers. With the increase of overlapping especially in gene expression data, clustering ability decreases considerably. A number of exigent algorithms are available to confront such data in the field of biomedical engineering. The proposed approach demonstrates the modified penalty function using co-variance of membership in the objective function of standard fuzzy clustering algorithm. This may resolve the missing interaction among membership variables. In this proposed algorithm, highly and lightly expressed data points are separated more efficiently due to covariance pressure. The algorithm is described and compared with the most elevated techniques such as k-means (KM), fuzzy c-means (FCM), and penalized fuzzy c-means (PFCM) clustering techniques. These techniques are verified for different validity measures for artificial dataset and a Brain Tumor gene expression dataset. Our proposed clustering algorithm shows a much higher usability than the other related techniques.","PeriodicalId":131825,"journal":{"name":"2017 Intelligent Systems Conference (IntelliSys)","volume":"13 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2017-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":"{\"title\":\"A modified penalty function in fuzzy clustering algorithm\",\"authors\":\"Md. Kibria Saroare, Md. Syadus Sefat, S. Sen, M. Shahjahan\",\"doi\":\"10.1109/INTELLISYS.2017.8324332\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Clustering is one of the most challenging tasks to organize and categorize data with the presence of noise and outliers. With the increase of overlapping especially in gene expression data, clustering ability decreases considerably. A number of exigent algorithms are available to confront such data in the field of biomedical engineering. The proposed approach demonstrates the modified penalty function using co-variance of membership in the objective function of standard fuzzy clustering algorithm. This may resolve the missing interaction among membership variables. In this proposed algorithm, highly and lightly expressed data points are separated more efficiently due to covariance pressure. The algorithm is described and compared with the most elevated techniques such as k-means (KM), fuzzy c-means (FCM), and penalized fuzzy c-means (PFCM) clustering techniques. These techniques are verified for different validity measures for artificial dataset and a Brain Tumor gene expression dataset. Our proposed clustering algorithm shows a much higher usability than the other related techniques.\",\"PeriodicalId\":131825,\"journal\":{\"name\":\"2017 Intelligent Systems Conference (IntelliSys)\",\"volume\":\"13 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2017-09-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"1\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2017 Intelligent Systems Conference (IntelliSys)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/INTELLISYS.2017.8324332\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2017 Intelligent Systems Conference (IntelliSys)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/INTELLISYS.2017.8324332","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 1

摘要

聚类是对存在噪声和异常值的数据进行组织和分类的最具挑战性的任务之一。随着重叠的增加,尤其是基因表达数据的重叠,聚类能力明显下降。在生物医学工程领域,许多紧急算法可用于处理此类数据。该方法利用标准模糊聚类算法的目标函数中隶属度的协方差来证明改进的惩罚函数。这可以解决成员变量之间缺少交互的问题。在该算法中,由于协方差压力,高表达和轻表达的数据点被更有效地分离。描述了该算法,并将其与k-means (KM)、模糊c-means (FCM)和惩罚模糊c-means (PFCM)聚类技术等最先进的聚类技术进行了比较。这些技术在人工数据集和脑肿瘤基因表达数据集的不同有效性度量中得到验证。我们提出的聚类算法比其他相关技术显示出更高的可用性。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
A modified penalty function in fuzzy clustering algorithm
Clustering is one of the most challenging tasks to organize and categorize data with the presence of noise and outliers. With the increase of overlapping especially in gene expression data, clustering ability decreases considerably. A number of exigent algorithms are available to confront such data in the field of biomedical engineering. The proposed approach demonstrates the modified penalty function using co-variance of membership in the objective function of standard fuzzy clustering algorithm. This may resolve the missing interaction among membership variables. In this proposed algorithm, highly and lightly expressed data points are separated more efficiently due to covariance pressure. The algorithm is described and compared with the most elevated techniques such as k-means (KM), fuzzy c-means (FCM), and penalized fuzzy c-means (PFCM) clustering techniques. These techniques are verified for different validity measures for artificial dataset and a Brain Tumor gene expression dataset. Our proposed clustering algorithm shows a much higher usability than the other related techniques.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
0.00%
发文量
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:604180095
Book学术官方微信