Profile-guided Hybrid Approach for block-wise missing data handling in multi-omics: a breast cancer case study.

IF 7.9 3区 生物学 Q1 MATHEMATICAL & COMPUTATIONAL BIOLOGY
Esraa Hamdi Abdelaziz, Eman Amin, Rasha Ismail, Mai Mabrouk
{"title":"Profile-guided Hybrid Approach for block-wise missing data handling in multi-omics: a breast cancer case study.","authors":"Esraa Hamdi Abdelaziz, Eman Amin, Rasha Ismail, Mai Mabrouk","doi":"10.1186/s13040-026-00530-8","DOIUrl":null,"url":null,"abstract":"<p><p>BACKGROUND: Block-wise missingness is a common challenge in multi-omics data, hindering the development of robust and generalizable machine learning models, as real-world cohorts rarely contain complete omic profiles. Many current methods either discard incomplete samples, use available-case models that need retraining when faced with new missingness patterns, or depend on full-dataset imputation, which can risk biological integrity and model stability. METHODS: Using a complete four-omics breast cancer dataset (705 patients, 1,937 features), up to 60% block-wise missingness was simulated across five clinically relevant scenarios and used to compare four strategies for handling missing data: an Imputation-Based model, Dynamic and Exhaustive Available-Case approaches, and the proposed Hybrid Approach that combines profile-guided modeling with selective, test-time imputation. Performance was evaluated using accuracy, F1 score, balanced accuracy, inference time, and variability across 15 random seeds, with significance assessed using the Wilcoxon signed-rank test. RESULTS: The Hybrid Approach consistently achieved the strongest and most stable performance. Relative to the complete-data baseline, it reached an average accuracy of 103.7%, F1 score of 123.3%, and balanced accuracy of 104.8%, outperforming the Imputation-Based method and matching or exceeding both Dynamic and Exhaustive Available-Case strategies. Statistical testing confirmed that these improvements were significant. The method also demonstrated fast and predictable inference (~ 2 s) and an average total runtime of ~ 49 s per configuration—nearly three times faster than the Exhaustive approach (~ 124 s)—while maintaining high reproducibility and low variance across seeds, a key indicator of computational stability. CONCLUSION: By selectively combining lightweight imputation with profile-specific modeling, the Hybrid Approach provides a computationally efficient and statistically robust solution for block-wise missing data. This framework offers a generalizable strategy for multi-omics data mining, and lays the foundation for future systems incorporating cross-profile learning and advanced imputation. </p>","PeriodicalId":48947,"journal":{"name":"Biodata Mining","volume":" ","pages":""},"PeriodicalIF":7.9000,"publicationDate":"2026-03-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://www.ncbi.nlm.nih.gov/pmc/articles/PMC13063710/pdf/","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Biodata Mining","FirstCategoryId":"99","ListUrlMain":"https://doi.org/10.1186/s13040-026-00530-8","RegionNum":3,"RegionCategory":"生物学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q1","JCRName":"MATHEMATICAL & COMPUTATIONAL BIOLOGY","Score":null,"Total":0}
引用次数: 0

Abstract

BACKGROUND: Block-wise missingness is a common challenge in multi-omics data, hindering the development of robust and generalizable machine learning models, as real-world cohorts rarely contain complete omic profiles. Many current methods either discard incomplete samples, use available-case models that need retraining when faced with new missingness patterns, or depend on full-dataset imputation, which can risk biological integrity and model stability. METHODS: Using a complete four-omics breast cancer dataset (705 patients, 1,937 features), up to 60% block-wise missingness was simulated across five clinically relevant scenarios and used to compare four strategies for handling missing data: an Imputation-Based model, Dynamic and Exhaustive Available-Case approaches, and the proposed Hybrid Approach that combines profile-guided modeling with selective, test-time imputation. Performance was evaluated using accuracy, F1 score, balanced accuracy, inference time, and variability across 15 random seeds, with significance assessed using the Wilcoxon signed-rank test. RESULTS: The Hybrid Approach consistently achieved the strongest and most stable performance. Relative to the complete-data baseline, it reached an average accuracy of 103.7%, F1 score of 123.3%, and balanced accuracy of 104.8%, outperforming the Imputation-Based method and matching or exceeding both Dynamic and Exhaustive Available-Case strategies. Statistical testing confirmed that these improvements were significant. The method also demonstrated fast and predictable inference (~ 2 s) and an average total runtime of ~ 49 s per configuration—nearly three times faster than the Exhaustive approach (~ 124 s)—while maintaining high reproducibility and low variance across seeds, a key indicator of computational stability. CONCLUSION: By selectively combining lightweight imputation with profile-specific modeling, the Hybrid Approach provides a computationally efficient and statistically robust solution for block-wise missing data. This framework offers a generalizable strategy for multi-omics data mining, and lays the foundation for future systems incorporating cross-profile learning and advanced imputation.

多组学中数据块丢失处理的概况引导混合方法:一个乳腺癌案例研究。
背景:在多组学数据中,块缺失是一个常见的挑战,它阻碍了健壮和可推广的机器学习模型的发展,因为现实世界的队列很少包含完整的组学概况。当前的许多方法要么丢弃不完整的样本,要么使用在面对新的缺失模式时需要重新训练的可用案例模型,要么依赖于完整数据集的输入,这可能会危及生物完整性和模型稳定性。方法:使用一个完整的四组学乳腺癌数据集(705名患者,1937个特征),在五个临床相关场景中模拟高达60%的块级缺失,并用于比较处理缺失数据的四种策略:基于输入的模型,动态和详尽的可用病例方法,以及拟议的混合方法,该方法将概况引导建模与选择性测试时间输入相结合。使用准确性、F1分数、平衡准确性、推理时间和15个随机种子的可变性来评估性能,并使用Wilcoxon符号秩检验来评估显著性。结果:混合方法始终具有最强和最稳定的性能。相对于完整数据基线,该方法的平均准确率为103.7%,F1得分为123.3%,平衡准确率为104.8%,优于基于输入的方法,匹配或超过动态和穷举可用案例策略。统计测试证实了这些改进是显著的。该方法还证明了快速和可预测的推理(~ 2秒),平均总运行时间为~ 49秒,比穷举方法(~ 124秒)快近三倍,同时保持了高再现性和种子间的低方差,这是计算稳定性的关键指标。结论:通过选择性地将轻量级输入与特定剖面建模相结合,混合方法为块丢失数据提供了计算效率和统计鲁棒性的解决方案。该框架为多组学数据挖掘提供了一种可推广的策略,并为未来结合跨剖面学习和高级imputation的系统奠定了基础。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
Biodata Mining
Biodata Mining MATHEMATICAL & COMPUTATIONAL BIOLOGY-
CiteScore
7.90
自引率
0.00%
发文量
28
审稿时长
23 weeks
期刊介绍: BioData Mining is an open access, open peer-reviewed journal encompassing research on all aspects of data mining applied to high-dimensional biological and biomedical data, focusing on computational aspects of knowledge discovery from large-scale genetic, transcriptomic, genomic, proteomic, and metabolomic data. Topical areas include, but are not limited to: -Development, evaluation, and application of novel data mining and machine learning algorithms. -Adaptation, evaluation, and application of traditional data mining and machine learning algorithms. -Open-source software for the application of data mining and machine learning algorithms. -Design, development and integration of databases, software and web services for the storage, management, retrieval, and analysis of data from large scale studies. -Pre-processing, post-processing, modeling, and interpretation of data mining and machine learning results for biological interpretation and knowledge discovery.
×
引用
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学术官方微信
小红书