NMF、谱聚类和k均值聚类性能的统计分析

Andri Mirzal
{"title":"NMF、谱聚类和k均值聚类性能的统计分析","authors":"Andri Mirzal","doi":"10.1109/ICCIS49240.2020.9257641","DOIUrl":null,"url":null,"abstract":"Nonnegative matrix factorization (NMF), spectral clustering, and k-means are the most used clustering methods in machine learning research. They have been used in many domains including text, image, and cancer clustering. However, there is still a limited number of works that discuss statistical significance of performance differences between these methods. This issue is epecially important in NMF as this method is still very actively researched with a sheer number of new algorithms are published every year, and being able to demonstrate newly proposed algorithms statistically outperform previous ones is certainly desired. In this paper, we present statistical analysis of clustering performance differences between NMF, spectral clustering, and k-means. We use ten NMF algorithms, six spectral clustering algorithms, and one standard k-means algorithm for benchmark. For data, eleven publicly available microarray gene expression datasets with numbers of classes range from two to ten are used. The experimental results show that statistically performance differences between NMF algorithms and the standard k-means algorithm are not significant, and spectral methods surprisingly perform less well than NMF and k-means.","PeriodicalId":425637,"journal":{"name":"2020 2nd International Conference on Computer and Information Sciences (ICCIS)","volume":"204 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2020-10-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"3","resultStr":"{\"title\":\"Statistical Analysis of Clustering Performances of NMF, Spectral Clustering, and K-means\",\"authors\":\"Andri Mirzal\",\"doi\":\"10.1109/ICCIS49240.2020.9257641\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Nonnegative matrix factorization (NMF), spectral clustering, and k-means are the most used clustering methods in machine learning research. They have been used in many domains including text, image, and cancer clustering. However, there is still a limited number of works that discuss statistical significance of performance differences between these methods. This issue is epecially important in NMF as this method is still very actively researched with a sheer number of new algorithms are published every year, and being able to demonstrate newly proposed algorithms statistically outperform previous ones is certainly desired. In this paper, we present statistical analysis of clustering performance differences between NMF, spectral clustering, and k-means. We use ten NMF algorithms, six spectral clustering algorithms, and one standard k-means algorithm for benchmark. For data, eleven publicly available microarray gene expression datasets with numbers of classes range from two to ten are used. The experimental results show that statistically performance differences between NMF algorithms and the standard k-means algorithm are not significant, and spectral methods surprisingly perform less well than NMF and k-means.\",\"PeriodicalId\":425637,\"journal\":{\"name\":\"2020 2nd International Conference on Computer and Information Sciences (ICCIS)\",\"volume\":\"204 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2020-10-13\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"3\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2020 2nd International Conference on Computer and Information Sciences (ICCIS)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ICCIS49240.2020.9257641\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2020 2nd International Conference on Computer and Information Sciences (ICCIS)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICCIS49240.2020.9257641","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 3

摘要

非负矩阵分解(NMF)、谱聚类和k-means是机器学习研究中最常用的聚类方法。它们已被用于许多领域,包括文本、图像和癌症聚类。然而,讨论这些方法之间性能差异的统计显著性的作品仍然有限。这个问题在NMF中尤其重要,因为该方法仍然非常积极地研究,每年都有大量的新算法发表,并且能够证明新提出的算法在统计上优于以前的算法是当然希望的。在本文中,我们对NMF、谱聚类和k-means聚类性能的差异进行了统计分析。我们使用了10种NMF算法、6种谱聚类算法和1种标准k-means算法作为基准。对于数据,使用11个公开可用的微阵列基因表达数据集,其类数从2到10不等。实验结果表明,NMF算法与标准k-means算法之间的统计性能差异不显著,谱方法的性能不如NMF和k-means。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
Statistical Analysis of Clustering Performances of NMF, Spectral Clustering, and K-means
Nonnegative matrix factorization (NMF), spectral clustering, and k-means are the most used clustering methods in machine learning research. They have been used in many domains including text, image, and cancer clustering. However, there is still a limited number of works that discuss statistical significance of performance differences between these methods. This issue is epecially important in NMF as this method is still very actively researched with a sheer number of new algorithms are published every year, and being able to demonstrate newly proposed algorithms statistically outperform previous ones is certainly desired. In this paper, we present statistical analysis of clustering performance differences between NMF, spectral clustering, and k-means. We use ten NMF algorithms, six spectral clustering algorithms, and one standard k-means algorithm for benchmark. For data, eleven publicly available microarray gene expression datasets with numbers of classes range from two to ten are used. The experimental results show that statistically performance differences between NMF algorithms and the standard k-means algorithm are not significant, and spectral methods surprisingly perform less well than NMF and k-means.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
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学术官方微信