一种新的软分配k均值算法

Peng Chen, Yongmei Chen, Beibei Jin
{"title":"一种新的软分配k均值算法","authors":"Peng Chen, Yongmei Chen, Beibei Jin","doi":"10.1145/3184066.3184073","DOIUrl":null,"url":null,"abstract":"K-means is one of the most popular and simple clustering algorithm. In spite of the fact that K-means was proposed over 60 years ago, it is still widely used. This paper provides a soft assignment K-means algorithm which is an extension of K-means where each data point can be a member of multiple clusters with a membership value. As an example, this paper apply soft assignment K-means algorithm to estimate the parameters of Gaussian mixture models and compare it with traditional K-means algorithm. Experiments demonstrate that soft assignment K-means algorithm can give more accurate result than traditional K-means algorithm which using hard assignment mechanism.","PeriodicalId":109559,"journal":{"name":"International Conference on Machine Learning and Soft Computing","volume":"109 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2018-02-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":"{\"title\":\"A new soft assignment K-means algorithm\",\"authors\":\"Peng Chen, Yongmei Chen, Beibei Jin\",\"doi\":\"10.1145/3184066.3184073\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"K-means is one of the most popular and simple clustering algorithm. In spite of the fact that K-means was proposed over 60 years ago, it is still widely used. This paper provides a soft assignment K-means algorithm which is an extension of K-means where each data point can be a member of multiple clusters with a membership value. As an example, this paper apply soft assignment K-means algorithm to estimate the parameters of Gaussian mixture models and compare it with traditional K-means algorithm. Experiments demonstrate that soft assignment K-means algorithm can give more accurate result than traditional K-means algorithm which using hard assignment mechanism.\",\"PeriodicalId\":109559,\"journal\":{\"name\":\"International Conference on Machine Learning and Soft Computing\",\"volume\":\"109 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2018-02-02\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"1\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"International Conference on Machine Learning and Soft Computing\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1145/3184066.3184073\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"International Conference on Machine Learning and Soft Computing","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1145/3184066.3184073","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 1

摘要

K-means是目前最流行、最简单的聚类算法之一。尽管K-means是在60多年前提出的,但它仍然被广泛使用。本文提出了一种软分配K-means算法,该算法是K-means的扩展,其中每个数据点可以是具有隶属度值的多个簇的成员。以软赋值K-means算法为例,对高斯混合模型的参数进行估计,并与传统的K-means算法进行比较。实验表明,软分配K-means算法比采用硬分配机制的传统K-means算法能给出更准确的结果。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
A new soft assignment K-means algorithm
K-means is one of the most popular and simple clustering algorithm. In spite of the fact that K-means was proposed over 60 years ago, it is still widely used. This paper provides a soft assignment K-means algorithm which is an extension of K-means where each data point can be a member of multiple clusters with a membership value. As an example, this paper apply soft assignment K-means algorithm to estimate the parameters of Gaussian mixture models and compare it with traditional K-means algorithm. Experiments demonstrate that soft assignment K-means algorithm can give more accurate result than traditional K-means algorithm which using hard assignment mechanism.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
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学术官方微信