具有排斥原型的模糊聚类

F. Rehm, R. Winkler, R. Kruse
{"title":"具有排斥原型的模糊聚类","authors":"F. Rehm, R. Winkler, R. Kruse","doi":"10.4018/978-1-60566-858-1.CH013","DOIUrl":null,"url":null,"abstract":"A well known issue with prototype-based clustering is the user's obligation to know the right number of clusters in a dataset in advance or to determine it as a part of the data analysis process. There are different approaches to cope with this non-trivial problem. This paper follows the approach to address this problem as an integrated part of the clustering process. An extension to repulsive fuzzy c-means clustering is proposed equipping non-Euclidean prototypes with repulsive properties. Experimental results are presented that demonstrate the feasibility of our technique.","PeriodicalId":293388,"journal":{"name":"Scalable Fuzzy Algorithms for Data Management and Analysis","volume":"24 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"4","resultStr":"{\"title\":\"Fuzzy Clustering with Repulsive Prototypes\",\"authors\":\"F. Rehm, R. Winkler, R. Kruse\",\"doi\":\"10.4018/978-1-60566-858-1.CH013\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"A well known issue with prototype-based clustering is the user's obligation to know the right number of clusters in a dataset in advance or to determine it as a part of the data analysis process. There are different approaches to cope with this non-trivial problem. This paper follows the approach to address this problem as an integrated part of the clustering process. An extension to repulsive fuzzy c-means clustering is proposed equipping non-Euclidean prototypes with repulsive properties. Experimental results are presented that demonstrate the feasibility of our technique.\",\"PeriodicalId\":293388,\"journal\":{\"name\":\"Scalable Fuzzy Algorithms for Data Management and Analysis\",\"volume\":\"24 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"1900-01-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"4\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Scalable Fuzzy Algorithms for Data Management and Analysis\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.4018/978-1-60566-858-1.CH013\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Scalable Fuzzy Algorithms for Data Management and Analysis","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.4018/978-1-60566-858-1.CH013","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 4

摘要

基于原型的聚类的一个众所周知的问题是,用户有义务提前知道数据集中正确的聚类数量,或者作为数据分析过程的一部分确定它。有不同的方法来处理这个重要的问题。本文遵循将此问题作为集群过程的一个组成部分来解决的方法。提出了一种对斥性模糊c均值聚类的扩展,使非欧几里德原型具有斥性。实验结果证明了该技术的可行性。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
Fuzzy Clustering with Repulsive Prototypes
A well known issue with prototype-based clustering is the user's obligation to know the right number of clusters in a dataset in advance or to determine it as a part of the data analysis process. There are different approaches to cope with this non-trivial problem. This paper follows the approach to address this problem as an integrated part of the clustering process. An extension to repulsive fuzzy c-means clustering is proposed equipping non-Euclidean prototypes with repulsive properties. Experimental results are presented that demonstrate the feasibility of our technique.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
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学术官方微信