Structured feature ranking for genomic marker identification accommodating multiple types of networks.

IF 1.4 4区 数学 Q3 BIOLOGY Biometrics Pub Date : 2024-10-03 DOI:10.1093/biomtc/ujae158
Yeheng Ge, Tao Li, Xingdong Feng, Mengyun Wu, Hailong Liu
{"title":"Structured feature ranking for genomic marker identification accommodating multiple types of networks.","authors":"Yeheng Ge, Tao Li, Xingdong Feng, Mengyun Wu, Hailong Liu","doi":"10.1093/biomtc/ujae158","DOIUrl":null,"url":null,"abstract":"<p><p>Numerous statistical methods have been developed to search for genomic markers associated with the development, progression, and response to treatment of complex diseases. Among them, feature ranking plays a vital role due to its intuitive formulation and computational efficiency. However, most of the existing methods are based on the marginal importance of molecular predictors and share the limitation that the dependence (network) structures among predictors are not well accommodated, where a disease phenotype usually reflects various biological processes that interact in a complex network. In this paper, we propose a structured feature ranking method for identifying genomic markers, where such network structures are effectively accommodated using Laplacian regularization. The proposed method innovatively investigates multiple network scenarios, where the networks can be known a priori and data-dependently estimated. In addition, we rigorously explore the noise and uncertainty in the networks and control their impacts with proper selection of tuning parameters. These characteristics make the proposed method enjoy especially broad applicability. Theoretical result of our proposal is rigorously established. Compared to the original marginal measure, the proposed network structured measure can achieve sure screening properties with a faster convergence rate under mild conditions. Extensive simulations and analysis of The Cancer Genome Atlas melanoma data demonstrate the improvement of finite sample performance and practical usefulness of the proposed method.</p>","PeriodicalId":8930,"journal":{"name":"Biometrics","volume":"80 4","pages":""},"PeriodicalIF":1.4000,"publicationDate":"2024-10-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Biometrics","FirstCategoryId":"100","ListUrlMain":"https://doi.org/10.1093/biomtc/ujae158","RegionNum":4,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q3","JCRName":"BIOLOGY","Score":null,"Total":0}
引用次数: 0

Abstract

Numerous statistical methods have been developed to search for genomic markers associated with the development, progression, and response to treatment of complex diseases. Among them, feature ranking plays a vital role due to its intuitive formulation and computational efficiency. However, most of the existing methods are based on the marginal importance of molecular predictors and share the limitation that the dependence (network) structures among predictors are not well accommodated, where a disease phenotype usually reflects various biological processes that interact in a complex network. In this paper, we propose a structured feature ranking method for identifying genomic markers, where such network structures are effectively accommodated using Laplacian regularization. The proposed method innovatively investigates multiple network scenarios, where the networks can be known a priori and data-dependently estimated. In addition, we rigorously explore the noise and uncertainty in the networks and control their impacts with proper selection of tuning parameters. These characteristics make the proposed method enjoy especially broad applicability. Theoretical result of our proposal is rigorously established. Compared to the original marginal measure, the proposed network structured measure can achieve sure screening properties with a faster convergence rate under mild conditions. Extensive simulations and analysis of The Cancer Genome Atlas melanoma data demonstrate the improvement of finite sample performance and practical usefulness of the proposed method.

查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
适应多种类型网络的基因组标记识别的结构化特征排序。
已经开发了许多统计方法来寻找与复杂疾病的发生、进展和治疗反应相关的基因组标记。其中,特征排序因其公式直观、计算效率高而起着至关重要的作用。然而,大多数现有方法都是基于分子预测因子的边际重要性,并且存在预测因子之间的依赖(网络)结构不能很好适应的局限性,其中疾病表型通常反映了在复杂网络中相互作用的各种生物过程。在本文中,我们提出了一种用于识别基因组标记的结构化特征排序方法,其中使用拉普拉斯正则化有效地容纳了这种网络结构。该方法创新性地研究了多个网络场景,其中网络可以被先验地知道并依赖于数据进行估计。此外,我们严格研究了网络中的噪声和不确定性,并通过合理选择调谐参数来控制它们的影响。这些特点使所提出的方法具有特别广泛的适用性。我们的建议的理论结果是严格成立的。与原有的边际测度相比,本文提出的网络结构化测度在温和条件下具有较快的收敛速度,具有一定的筛选性能。对癌症基因组图谱黑色素瘤数据的大量模拟和分析证明了有限样本性能的改进和所提出方法的实用性。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 去求助
来源期刊
Biometrics
Biometrics 生物-生物学
CiteScore
2.70
自引率
5.30%
发文量
178
审稿时长
4-8 weeks
期刊介绍: The International Biometric Society is an international society promoting the development and application of statistical and mathematical theory and methods in the biosciences, including agriculture, biomedical science and public health, ecology, environmental sciences, forestry, and allied disciplines. The Society welcomes as members statisticians, mathematicians, biological scientists, and others devoted to interdisciplinary efforts in advancing the collection and interpretation of information in the biosciences. The Society sponsors the biennial International Biometric Conference, held in sites throughout the world; through its National Groups and Regions, it also Society sponsors regional and local meetings.
期刊最新文献
Gaussian processes for time series with lead-lag effects with applications to biology data. Weighted Q-learning for optimal dynamic treatment regimes with nonignorable missing covariates. Causal inference with cross-temporal design. Distributed model building and recursive integration for big spatial data modeling. Robust Bayesian graphical regression models for assessing tumor heterogeneity in proteomic networks.
×
引用
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