多模态组学数据整合聚类的主子空间更新

Aparajita Khan, P. Maji
{"title":"多模态组学数据整合聚类的主子空间更新","authors":"Aparajita Khan, P. Maji","doi":"10.1109/CINE.2017.14","DOIUrl":null,"url":null,"abstract":"Cancer subtyping is a key step towards the design of improved personalized therapies. Subtype discovery from large-scale multimodal data sets poses several challenges like data heterogeneity and high dimensionality. Moreover, existing integrative clustering algorithms tend to consider that each modality provides homogeneous and consistent subtype information, which may not be true for real life omics data sets. In this regard, this paper presents a fast algorithm to extract a low-rank joint subspace from the principal subspace of each individual modality such that the joint subspace best preserves the underlying subtype structure. The algorithm evaluates the quality of cluster information provided by each modality and the concordance of information shared among different modalities. This allows the algorithm to judiciously select the most relevant modalities and discard modalities providing noisy and inconsistent information while construction of the joint subspace. The performance of clustering in the joint subspace extracted by the proposed algorithm and its computational efficiency is compared with several existing integrative clustering approaches, on real life multimodal omics data sets. Moreover, survival analysis shows that the subtypes identified by the proposed approach have significantly different survival profiles.","PeriodicalId":236972,"journal":{"name":"2017 3rd International Conference on Computational Intelligence and Networks (CINE)","volume":"48 4 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2017-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Principal Subspace Updation for Integrative Clustering of Multimodal Omics Data\",\"authors\":\"Aparajita Khan, P. Maji\",\"doi\":\"10.1109/CINE.2017.14\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Cancer subtyping is a key step towards the design of improved personalized therapies. Subtype discovery from large-scale multimodal data sets poses several challenges like data heterogeneity and high dimensionality. Moreover, existing integrative clustering algorithms tend to consider that each modality provides homogeneous and consistent subtype information, which may not be true for real life omics data sets. In this regard, this paper presents a fast algorithm to extract a low-rank joint subspace from the principal subspace of each individual modality such that the joint subspace best preserves the underlying subtype structure. The algorithm evaluates the quality of cluster information provided by each modality and the concordance of information shared among different modalities. This allows the algorithm to judiciously select the most relevant modalities and discard modalities providing noisy and inconsistent information while construction of the joint subspace. The performance of clustering in the joint subspace extracted by the proposed algorithm and its computational efficiency is compared with several existing integrative clustering approaches, on real life multimodal omics data sets. Moreover, survival analysis shows that the subtypes identified by the proposed approach have significantly different survival profiles.\",\"PeriodicalId\":236972,\"journal\":{\"name\":\"2017 3rd International Conference on Computational Intelligence and Networks (CINE)\",\"volume\":\"48 4 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 3rd International Conference on Computational Intelligence and Networks (CINE)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/CINE.2017.14\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2017 3rd International Conference on Computational Intelligence and Networks (CINE)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/CINE.2017.14","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

摘要

癌症亚型是设计改进的个性化治疗的关键一步。大规模多模态数据集的子类型发现面临着数据异构性和高维性等挑战。此外,现有的整合聚类算法倾向于考虑每种模式提供同质和一致的亚型信息,这对于现实生活中的组学数据集可能并不正确。为此,本文提出了一种从每个模态的主子空间中提取低秩联合子空间的快速算法,使联合子空间最好地保留了底层子类型结构。该算法评估每个模态提供的聚类信息的质量以及不同模态之间共享信息的一致性。这使得该算法能够在构建联合子空间时明智地选择最相关的模态并丢弃提供噪声和不一致信息的模态。在实际的多模态组学数据集上,将该算法提取的联合子空间的聚类性能和计算效率与几种现有的综合聚类方法进行了比较。此外,生存分析表明,通过该方法确定的亚型具有显著不同的生存概况。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
Principal Subspace Updation for Integrative Clustering of Multimodal Omics Data
Cancer subtyping is a key step towards the design of improved personalized therapies. Subtype discovery from large-scale multimodal data sets poses several challenges like data heterogeneity and high dimensionality. Moreover, existing integrative clustering algorithms tend to consider that each modality provides homogeneous and consistent subtype information, which may not be true for real life omics data sets. In this regard, this paper presents a fast algorithm to extract a low-rank joint subspace from the principal subspace of each individual modality such that the joint subspace best preserves the underlying subtype structure. The algorithm evaluates the quality of cluster information provided by each modality and the concordance of information shared among different modalities. This allows the algorithm to judiciously select the most relevant modalities and discard modalities providing noisy and inconsistent information while construction of the joint subspace. The performance of clustering in the joint subspace extracted by the proposed algorithm and its computational efficiency is compared with several existing integrative clustering approaches, on real life multimodal omics data sets. Moreover, survival analysis shows that the subtypes identified by the proposed approach have significantly different survival profiles.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
0.00%
发文量
0
期刊最新文献
Building Occupancy Detection Using Feed Forward Back-Propagation Neural Networks Stock Prediction Using Functional Link Artificial Neural Network (FLANN) Symmetric Axis Based Off-Line Odia Handwritten Character and Numeral Recognition Artificial Intelligence Techniques Used to Detect Object and Face in an Image: A Review Application of JAYA Algorithm to Tune Fuzzy-PIDF Controller for Automatic Generation Control
×
引用
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