NIAPU: network-informed adaptive positive-unlabeled learning for disease gene identification

被引:4
作者
Stolfi, Paola [1 ]
Mastropietro, Andrea [2 ]
Pasculli, Giuseppe [2 ]
Tieri, Paolo [1 ]
Vergni, Davide [1 ]
机构
[1] Natl Res Council Italy CNR, Inst Appl Comp IAC Mauro Picone, I-00185 Rome, Italy
[2] Sapienza Univ Rome, Dept Comp Control & Management Engn DIAG Antonio, I-00185 Rome, Italy
关键词
PREDICTION; PRIORITIZATION; WALKING;
D O I
10.1093/bioinformatics/btac848
中图分类号
Q5 [生物化学];
学科分类号
071010 ; 081704 ;
摘要
Motivation: Gene-disease associations are fundamental for understanding disease etiology and developing effective interventions and treatments. Identifying genes not yet associated with a disease due to a lack of studies is a challenging task in which prioritization based on prior knowledge is an important element. The computational search for new candidate disease genes may be eased by positive-unlabeled learning, the machine learning (ML) setting in which only a subset of instances are labeled as positive while the rest of the dataset is unlabeled. In this work, we propose a set of effective network-based features to be used in a novel Markov diffusion-based multi-class labeling strategy for putative disease gene discovery. Results: The performances of the new labeling algorithm and the effectiveness of the proposed features have been tested on 10 different disease datasets using three ML algorithms. The new features have been compared against classical topological and functional/ontological features and a set of network- and biological-derived features already used in gene discovery tasks. The predictive power of the integrated methodology in searching for new disease genes has been found to be competitive against state-of-the-art algorithms. Availability and implementation: The source code of NIAPU can be accessed at https://github.com/AndMastro/ NIAPU. The source data used in this study are available online on the respective websites. Contact: mastropietro@diag.uniroma1.it or davide.vergni@cnr.it Supplementary information: Supplementary data are available at Bioinformatics online.
引用
收藏
页数:9
相关论文
共 63 条
  • [1] [Anonymous], 2008, P 14 ACM SIGKDD INT
  • [2] Ring structures and mean first passage time in networks
    Baronchelli, A
    Loreto, V
    [J]. PHYSICAL REVIEW E, 2006, 73 (02)
  • [3] Learning from positive and unlabeled data: a survey
    Bekker, Jessa
    Davis, Jesse
    [J]. MACHINE LEARNING, 2020, 109 (04) : 719 - 760
  • [4] Building text classifiers using positive and unlabeled examples
    Bing, L
    Yang, D
    Li, XL
    Lee, WS
    Yu, PS
    [J]. THIRD IEEE INTERNATIONAL CONFERENCE ON DATA MINING, PROCEEDINGS, 2003, : 179 - 186
  • [5] A Knowledge-Driven Approach to Extract Disease-Related Biomarkers from the Literature
    Bravo, A.
    Cases, M.
    Queralt-Rosinach, N.
    Sanz, F.
    Furlong, L. I.
    [J]. BIOMED RESEARCH INTERNATIONAL, 2014, 2014
  • [6] Extraction of relations between genes and diseases from text and large-scale data analysis: implications for translational research
    Bravo, Alex
    Pinero, Janet
    Queralt-Rosinach, Nuria
    Rautschka, Michael
    Furlong, Laura I.
    [J]. BMC BIOINFORMATICS, 2015, 16
  • [7] Random forests
    Breiman, L
    [J]. MACHINE LEARNING, 2001, 45 (01) : 5 - 32
  • [8] Bundschus M., 2010, P 19 ACM INT C INF K, P1845
  • [9] Extraction of semantic biomedical relations from text using conditional random fields
    Bundschus, Markus
    Dejori, Mathaeus
    Stetter, Martin
    Tresp, Volker
    Kriegel, Hans-Peter
    [J]. BMC BIOINFORMATICS, 2008, 9 (1)
  • [10] Can T., 2005, C KNOWLEDGE DISCOVER, V1, P61, DOI [10.1145/1134030.1134042, DOI 10.1145/1134030.1134042]