A meta-learning approach for genomic survival analysis

被引:0
|
作者
Yeping Lina Qiu
Hong Zheng
Arnout Devos
Heather Selby
Olivier Gevaert
机构
[1] Stanford University,Department of Electrical Engineering
[2] Stanford University,Department of Medicine, Stanford Center for Biomedical Informatics Research
[3] Swiss Federal Institute of Technology Lausanne (EPFL),School of Computer and Communication Sciences
[4] Stanford University,Department of Biomedical Data Science
来源
关键词
D O I
暂无
中图分类号
学科分类号
摘要
RNA sequencing has emerged as a promising approach in cancer prognosis as sequencing data becomes more easily and affordably accessible. However, it remains challenging to build good predictive models especially when the sample size is limited and the number of features is high, which is a common situation in biomedical settings. To address these limitations, we propose a meta-learning framework based on neural networks for survival analysis and evaluate it in a genomic cancer research setting. We demonstrate that, compared to regular transfer-learning, meta-learning is a significantly more effective paradigm to leverage high-dimensional data that is relevant but not directly related to the problem of interest. Specifically, meta-learning explicitly constructs a model, from abundant data of relevant tasks, to learn a new task with few samples effectively. For the application of predicting cancer survival outcome, we also show that the meta-learning framework with a few samples is able to achieve competitive performance with learning from scratch with a significantly larger number of samples. Finally, we demonstrate that the meta-learning model implicitly prioritizes genes based on their contribution to survival prediction and allows us to identify important pathways in cancer.
引用
收藏
相关论文
共 50 条
  • [1] A meta-learning approach for genomic survival analysis
    Qiu, Yeping Lina
    Zheng, Hong
    Devos, Arnout
    Selby, Heather
    Gevaert, Olivier
    [J]. NATURE COMMUNICATIONS, 2020, 11 (01)
  • [2] Classification by Cluster Analysis: A New Meta-Learning Based Approach
    Jurek, Anna
    Bi, Yaxin
    Wu, Shengli
    Nugent, Chris
    [J]. MULTIPLE CLASSIFIER SYSTEMS, 2011, 6713 : 259 - 268
  • [3] A Meta-learning Approach to Fair Ranking
    Wang, Yuan
    Tao, Zhiqiang
    Fang, Yi
    [J]. PROCEEDINGS OF THE 45TH INTERNATIONAL ACM SIGIR CONFERENCE ON RESEARCH AND DEVELOPMENT IN INFORMATION RETRIEVAL (SIGIR '22), 2022, : 2539 - 2544
  • [4] A Meta-Learning Approach to Error Prediction
    Guimaraes, Miguel
    Carneiro, Davide
    [J]. PROCEEDINGS OF 2021 16TH IBERIAN CONFERENCE ON INFORMATION SYSTEMS AND TECHNOLOGIES (CISTI'2021), 2021,
  • [5] Testing the Genomic Bottleneck Hypothesis in Hebbian Meta-Learning
    Palm, Rasmus Berg
    Najarro, Elias
    Risi, Sebastian
    [J]. NEURIPS 2020 WORKSHOP ON PRE-REGISTRATION IN MACHINE LEARNING, VOL 148, 2020, 148 : 100 - 110
  • [6] Testing the Genomic Bottleneck Hypothesis in Hebbian Meta-Learning
    Palm, Rasmus Berg
    Najarro, Elias
    Risi, Sebastian
    [J]. Proceedings of Machine Learning Research, 2021, 148 : 100 - 110
  • [7] Learning to adapt: a meta-learning approach for speaker adaptation
    Klejch, Ondrej
    Fainberg, Joachim
    Bell, Peter
    [J]. 19TH ANNUAL CONFERENCE OF THE INTERNATIONAL SPEECH COMMUNICATION ASSOCIATION (INTERSPEECH 2018), VOLS 1-6: SPEECH RESEARCH FOR EMERGING MARKETS IN MULTILINGUAL SOCIETIES, 2018, : 867 - 871
  • [8] MAC: a meta-learning approach for feature learning and recombination
    Tiwari, Sambhavi
    Gogoi, Manas
    Verma, Shekhar
    Singh, Krishna Pratap
    [J]. PATTERN ANALYSIS AND APPLICATIONS, 2024, 27 (02)
  • [9] BRAINSTORMING Agent based Meta-learning Approach
    Plewczynski, Dariusz
    [J]. ICAART 2011: PROCEEDINGS OF THE 3RD INTERNATIONAL CONFERENCE ON AGENTS AND ARTIFICIAL INTELLIGENCE, VOL 2, 2011, : 487 - 490
  • [10] Meta-learning approach to neural network optimization
    Kordik, Pavel
    Koutnik, Jan
    Drchal, Jan
    Kovarik, Oleg
    Cepek, Miroslav
    Snorek, Miroslav
    [J]. NEURAL NETWORKS, 2010, 23 (04) : 568 - 582