Simultaneous clustering of multiple heterogeneous gene expression datasets

Basel Abu-Jamous, S. Kelly
{"title":"Simultaneous clustering of multiple heterogeneous gene expression datasets","authors":"Basel Abu-Jamous, S. Kelly","doi":"10.1109/AEECT.2017.8257763","DOIUrl":null,"url":null,"abstract":"Clustering algorithms aim, by definition, at partitioning a given set of objects into a set of clusters such that those objects which belong to the same cluster are similar to each other while being dissimilar to the objects belonging to the other clusters. By application to three case studies of real gene expression data, we demonstrate that the most commonly used algorithms (e.g. k-means and Markov clustering) do not always meet the objective of clustering as per the definition of clustering. This problem becomes more significant when data with more dimensions are analysed, or when multiple datasets are analysed simultaneously. We solve this problem by proposing an automated consensus clustering algorithm, Clust, which can be applied to one or more datasets simultaneously, and can identify clusters with higher within-cluster similarity and lower intra-cluster similarity than other algorithms. Thus Clust meets the basic definition of clustering in a more reliable and accurate manner.","PeriodicalId":286127,"journal":{"name":"2017 IEEE Jordan Conference on Applied Electrical Engineering and Computing Technologies (AEECT)","volume":"29 3 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2017-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2017 IEEE Jordan Conference on Applied Electrical Engineering and Computing Technologies (AEECT)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/AEECT.2017.8257763","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

Abstract

Clustering algorithms aim, by definition, at partitioning a given set of objects into a set of clusters such that those objects which belong to the same cluster are similar to each other while being dissimilar to the objects belonging to the other clusters. By application to three case studies of real gene expression data, we demonstrate that the most commonly used algorithms (e.g. k-means and Markov clustering) do not always meet the objective of clustering as per the definition of clustering. This problem becomes more significant when data with more dimensions are analysed, or when multiple datasets are analysed simultaneously. We solve this problem by proposing an automated consensus clustering algorithm, Clust, which can be applied to one or more datasets simultaneously, and can identify clusters with higher within-cluster similarity and lower intra-cluster similarity than other algorithms. Thus Clust meets the basic definition of clustering in a more reliable and accurate manner.
同时聚类多个异质基因表达数据集
根据定义,聚类算法的目标是将给定的一组对象划分为一组簇,使得属于同一簇的对象彼此相似,而属于其他簇的对象不相似。通过对真实基因表达数据的三个案例研究,我们证明了最常用的算法(如k-means和Markov聚类)并不总是符合聚类的定义。当分析维度更多的数据或同时分析多个数据集时,这个问题变得更加重要。为了解决这一问题,我们提出了一种自动共识聚类算法Clust,该算法可以同时应用于一个或多个数据集,并且可以识别出比其他算法具有更高的簇内相似度和更低的簇内相似度的聚类。因此,cluster以更可靠和准确的方式满足了聚类的基本定义。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约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学术官方微信