Multi-kernel clustering with tensor fusion on Grassmann manifold for high-dimensional genomic data

IF 4.2 3区 生物学 Q1 BIOCHEMICAL RESEARCH METHODS Methods Pub Date : 2024-10-11 DOI:10.1016/j.ymeth.2024.09.015
Fei Qi , Jin Guo , Junyu Li , Yi Liao , Wenxiong Liao , Hongmin Cai , Jiazhou Chen
{"title":"Multi-kernel clustering with tensor fusion on Grassmann manifold for high-dimensional genomic data","authors":"Fei Qi ,&nbsp;Jin Guo ,&nbsp;Junyu Li ,&nbsp;Yi Liao ,&nbsp;Wenxiong Liao ,&nbsp;Hongmin Cai ,&nbsp;Jiazhou Chen","doi":"10.1016/j.ymeth.2024.09.015","DOIUrl":null,"url":null,"abstract":"<div><div>The high dimensionality and noise challenges in genomic data make it difficult for traditional clustering methods. Existing multi-kernel clustering methods aim to improve the quality of the affinity matrix by learning a set of base kernels, thereby enhancing clustering performance. However, directly learning from the original base kernels presents challenges in handling errors and redundancies when dealing with high-dimensional data, and there is still a lack of feasible multi-kernel fusion strategies. To address these issues, we propose a Multi-Kernel Clustering method with Tensor fusion on Grassmann manifolds, called MKCTM. Specifically, we maximize the clustering consensus among base kernels by imposing tensor low-rank constraints to eliminate noise and redundancy. Unlike traditional kernel fusion approaches, our method fuses learned base kernels on the Grassmann manifold, resulting in a final consensus matrix for clustering. We integrate tensor learning and fusion processes into a unified optimization model and propose an effective iterative optimization algorithm for solving it. Experimental results on ten datasets, comparing against 12 popular baseline clustering methods, confirm the superiority of our approach. Our code is available at <span><span>https://github.com/foureverfei/MKCTM.git</span><svg><path></path></svg></span>.</div></div>","PeriodicalId":390,"journal":{"name":"Methods","volume":"231 ","pages":"Pages 215-225"},"PeriodicalIF":4.2000,"publicationDate":"2024-10-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Methods","FirstCategoryId":"99","ListUrlMain":"https://www.sciencedirect.com/science/article/pii/S1046202324002135","RegionNum":3,"RegionCategory":"生物学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q1","JCRName":"BIOCHEMICAL RESEARCH METHODS","Score":null,"Total":0}
引用次数: 0

Abstract

The high dimensionality and noise challenges in genomic data make it difficult for traditional clustering methods. Existing multi-kernel clustering methods aim to improve the quality of the affinity matrix by learning a set of base kernels, thereby enhancing clustering performance. However, directly learning from the original base kernels presents challenges in handling errors and redundancies when dealing with high-dimensional data, and there is still a lack of feasible multi-kernel fusion strategies. To address these issues, we propose a Multi-Kernel Clustering method with Tensor fusion on Grassmann manifolds, called MKCTM. Specifically, we maximize the clustering consensus among base kernels by imposing tensor low-rank constraints to eliminate noise and redundancy. Unlike traditional kernel fusion approaches, our method fuses learned base kernels on the Grassmann manifold, resulting in a final consensus matrix for clustering. We integrate tensor learning and fusion processes into a unified optimization model and propose an effective iterative optimization algorithm for solving it. Experimental results on ten datasets, comparing against 12 popular baseline clustering methods, confirm the superiority of our approach. Our code is available at https://github.com/foureverfei/MKCTM.git.

Abstract Image

查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
格拉斯曼流形上的多核聚类与张量融合,用于高维基因组数据
基因组数据的高维度和噪声挑战给传统聚类方法带来了困难。现有的多核聚类方法旨在通过学习一组基核来改善亲和矩阵的质量,从而提高聚类性能。然而,在处理高维数据时,直接从原始基核学习会在处理错误和冗余方面带来挑战,而且仍然缺乏可行的多核融合策略。为了解决这些问题,我们提出了一种在格拉斯曼流形上进行张量融合的多核聚类法,称为 MKCTM。具体来说,我们通过施加张量低阶约束来消除噪声和冗余,从而最大化基础内核之间的聚类共识。与传统的内核融合方法不同,我们的方法是在格拉斯曼流形上融合学习到的基础内核,从而形成最终的聚类共识矩阵。我们将张量学习和融合过程整合到一个统一的优化模型中,并提出了一种有效的迭代优化算法。在十个数据集上的实验结果与 12 种流行的基线聚类方法相比,证实了我们的方法的优越性。我们的代码见 https://github.com/foureverfei/MKCTM.git。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 去求助
来源期刊
Methods
Methods 生物-生化研究方法
CiteScore
9.80
自引率
2.10%
发文量
222
审稿时长
11.3 weeks
期刊介绍: Methods focuses on rapidly developing techniques in the experimental biological and medical sciences. Each topical issue, organized by a guest editor who is an expert in the area covered, consists solely of invited quality articles by specialist authors, many of them reviews. Issues are devoted to specific technical approaches with emphasis on clear detailed descriptions of protocols that allow them to be reproduced easily. The background information provided enables researchers to understand the principles underlying the methods; other helpful sections include comparisons of alternative methods giving the advantages and disadvantages of particular methods, guidance on avoiding potential pitfalls, and suggestions for troubleshooting.
期刊最新文献
Robust feature learning using contractive autoencoders for multi-omics clustering in cancer subtyping. Optimizing retinal Imaging: Evaluation of ultrasmall TiO2 Nanoparticle- fluorescein conjugates for improved Fundus fluorescein angiography. Ab-Amy 2.0: Predicting light chain amyloidogenic risk of therapeutic antibodies based on antibody language model. Data preprocessing methods for selective sweep detection using convolutional neural networks. SITP: A single cell bioinformatics analysis flow captures proteasome markers in the development of breast cancer
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
已复制链接
已复制链接
快去分享给好友吧!
我知道了
×
扫码分享
扫码分享
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1