The proposal of dynamic thresholds in an immune algorithm for fuzzy clustering

Alexandre Szabo, F. O. França
{"title":"The proposal of dynamic thresholds in an immune algorithm for fuzzy clustering","authors":"Alexandre Szabo, F. O. França","doi":"10.1109/FUZZ-IEEE.2015.7338021","DOIUrl":null,"url":null,"abstract":"Most datasets obtained in real-world applications are typically unlabeled, requiring a manual labor of classifying a sample of such data or the application of unsupervised learning. Clustering is typically used to devise how data are grouped together before sampling the data to be labeled. Most clustering algorithms often assumes that the number of clusters is known and that a given instance from the dataset belongs to only one cluster. The Fainet algorithm is a bioinspired fuzzy clustering algorithm that finds fuzzy partitions and dynamically estimates the number of clusters. The results from the literature showed that, given a correct parameters set, this algorithm can outperform most clustering methods from the literature. However, in order to obtain such optimal set, a typical user should first acquire a knowledge of the dataset being studied. This work proposes dynamic rules to finetune the parameters set on-the-fly. The advantages of the proposed method is that the parameters not only adapts to the dataset characteristics but also to how close the solutions are from the optima. The results show that the method greatly improves the prototypes representativeness while optimizing the estimated number of clusters.","PeriodicalId":185191,"journal":{"name":"2015 IEEE International Conference on Fuzzy Systems (FUZZ-IEEE)","volume":"5 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2015-11-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"3","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2015 IEEE International Conference on Fuzzy Systems (FUZZ-IEEE)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/FUZZ-IEEE.2015.7338021","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 3

Abstract

Most datasets obtained in real-world applications are typically unlabeled, requiring a manual labor of classifying a sample of such data or the application of unsupervised learning. Clustering is typically used to devise how data are grouped together before sampling the data to be labeled. Most clustering algorithms often assumes that the number of clusters is known and that a given instance from the dataset belongs to only one cluster. The Fainet algorithm is a bioinspired fuzzy clustering algorithm that finds fuzzy partitions and dynamically estimates the number of clusters. The results from the literature showed that, given a correct parameters set, this algorithm can outperform most clustering methods from the literature. However, in order to obtain such optimal set, a typical user should first acquire a knowledge of the dataset being studied. This work proposes dynamic rules to finetune the parameters set on-the-fly. The advantages of the proposed method is that the parameters not only adapts to the dataset characteristics but also to how close the solutions are from the optima. The results show that the method greatly improves the prototypes representativeness while optimizing the estimated number of clusters.
一种免疫模糊聚类算法中动态阈值的提出
在实际应用中获得的大多数数据集通常是未标记的,需要人工对此类数据的样本进行分类或应用无监督学习。聚类通常用于设计如何在对要标记的数据进行采样之前将数据分组在一起。大多数聚类算法通常假设簇的数量是已知的,并且数据集中的给定实例只属于一个簇。Fainet算法是一种生物启发的模糊聚类算法,它发现模糊分区并动态估计聚类的数量。文献结果表明,在给定正确的参数集的情况下,该算法可以优于文献中大多数聚类方法。然而,为了获得这样的最优集,一个典型的用户应该首先获得正在研究的数据集的知识。这项工作提出了动态规则来调整动态设置的参数。该方法的优点在于参数不仅能适应数据集的特征,还能适应解与最优解的接近程度。结果表明,该方法在优化聚类估计数量的同时,大大提高了原型的代表性。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
自引率
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学术官方微信