Positive-unlabeled learning for disease gene identification
Open accessThe DOI matches its Crossref record; 59 of the 59 references it cites were found in a registry or an index.
Abstract
Background: Identifying disease genes from human genome is an important but challenging task in biomedical research. Machine learning methods can be applied to discover new disease genes based on the known ones. Existing machine learning methods typically use the known disease genes as the positive training set P and the unknown genes as the negative training set N (non-disease gene set does not exist) to build classifiers to identify new disease genes from the unknown genes. However, such kind of classifiers is actually built from a noisy negative set N as there can be unknown disease genes in N itself. As a result, the classifiers do not perform as well as they could be. Result: Instead of treating the unknown genes as negative examples in N, we treat them as an unlabeled set U. We design a novel positive-unlabeled (PU) learning algorithm PUDI (PU learning for disease gene identification) to build a classifier using P and U. We first partition U into four sets, namely, reliable negative set RN, likely positive set LP, likely negative set LN and weak negative set WN. The weighted support vector machines are then used to build a multi-level classifier based on the four training sets and positive training set P to identify disease genes. Our experimental results demonstrate that our proposed PUDI algorithm outperformed the existing methods significantly. Conclusion: The proposed PUDI algorithm is able to identify disease genes more accurately by treating the unknown data more appropriately as unlabeled set U instead of negative set N. Given that many machine learning problems in biomedical research do involve positive and unlabeled data instead of negative data, it is possible that the machine learning methods for these problems can be further improved by adopting PU learning methods, as we have done here for disease gene identification. Availability and implementation: The executable program and data are available at http://www1.i2r.a-star.edu.sg/∼xlli/PUDI/PUDI.html. Contact: xlli@i2r.a-star.edu.sg or yang0293@e.ntu.edu.sg Supplementary information: Supplementary Data are available at Bioinformatics online.
Overview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
Collective dynamics of ‘small-world’ networks
Watts, D. J., & Strogatz, S. H. (1998) · Nature · doi:10.1038/30918 · Cited by 43,060
LIBSVM: A library for support vector machines
Chang, C.-C., & Lin, C.-J. (2011) · ACM Transactions on Intelligent Systems and Technology · doi:10.1145/1961189.1961199 · Cited by 40,918 · cited 1×
“To take into account of the inherently different levels of trustworthiness of labels in P, RN, LP, LN and WN, we use a multi-level examples learning technique, weighted SVMs (Chang and Lin, 2011; Vapink, 1998), to build a classifier.”
MethodWu, Y. (1999) · Technometrics · doi:10.1080/00401706.1999.10485951 · Cited by 27,221 · cited 1×
“To take into account of the inherently different levels of trustworthiness of labels in P, RN, LP, LN and WN, we use a multi-level examples learning technique, weighted SVMs (Chang and Lin, 2011; Vapink, 1998), to build a classifier.”
MethodThe Pfam Protein Families Database
Bateman, A. (2002) · Nucleic Acids Research · doi:10.1093/nar/30.1.276 · Cited by 14,000
The Gene Ontology (GO) database and informatics resource
Gene Ontology Consortium (2004) · Nucleic Acids Research · doi:10.1093/nar/gkh036 · Cited by 4,579 · cited 1×
“A more biologically meaningful approach would be to build a binary classification model that can automatically classify a gene as disease or not.”
BackgroundA STATISTICAL INTERPRETATION OF TERM SPECIFICITY AND ITS APPLICATION IN RETRIEVAL
SPARCK JONES, K. (1972) · Journal of Documentation · doi:10.1108/eb026526 · Cited by 4,505
Goh, K.-I., Cusick, M. E., Valle, D., Childs, B., Vidal, M., & Barabási, A.-L. (2007) · Proceedings of the National Academy of Sciences · doi:10.1073/pnas.0701361104 · Cited by 3,242 · cited 1×
“However, such kind of classifiers is actually built from a noisy negative set N as there can be unknown disease genes in”
BackgroundHuman Protein Reference Database--2009 update
Keshava Prasad, T. S., Goel, R., Kandasamy, K., Keerthikumar, S., Kumar, S., Mathivanan, S., Telikicherla, D., Raju, R., Shafreen, B., Venugopal, A., et al. (2009) · Nucleic Acids Research · doi:10.1093/nar/gkn892 · Cited by 3,234
The Pfam protein families database
Finn, R. D., Mistry, J., Tate, J., Coggill, P., Heger, A., Pollington, J. E., Gavin, O. L., Gunasekaran, P., Ceric, G., Forslund, K., et al. (2010) · Nucleic Acids Research · doi:10.1093/nar/gkp985 · Cited by 2,694 · cited 2×
“Köhler et al. (2008) made use of the observation that proteins caused by same/similar disorders are likely attached together in protein–protein interaction (PPI) network (Gandhi et al., 2006) and applied the random walk algorithm on the PPI network for disease gene prioritization.”
MethodGeneCards Version 3: the human gene integrator
Safran, M., Dalah, I., Alexander, J., Rosen, N., Iny Stein, T., Shmoish, M., Nativ, N., Bahir, I., Doniger, T., Krug, H., et al. (2010) · Database · doi:10.1093/database/baq020 · Cited by 2,088
Cited by
Learning from positive and unlabeled data: a survey
Bekker, J., & Davis, J. (2020) · Machine Learning · doi:10.1007/s10994-020-05877-5 · Cited by 651
“Several PU methods were developed to this end: ProDiGe is a method based on bagging SVMs (Mordelet and Vert 2011, 2014), PUDI is also a weighted SVM method, but they have different weights for four identified groups of unlabeled examples: reliable negative, likely positive, likely negative and weakly negative (Yang et…”
MethodEnhancing the prediction of disease-gene associations with multimodal deep learning
Luo, P., Li, Y., Tian, L.-P., & Wu, F.-X. (2019) · Bioinformatics · doi:10.1093/bioinformatics/btz155 · Cited by 67
Binder, J., Ursu, O., Bologa, C., Jiang, S., Maphis, N., Dadras, S., Chisholm, D., Weick, J., Myers, O., Kumar, P., et al. (2022) · Communications Biology · doi:10.1038/s42003-022-03068-7 · Cited by 49
Formatting biological big data for modern machine learning in drug discovery
Duran‐Frigola, M., Fernández‐Torras, A., Bertoni, M., & Aloy, P. (2019) · WIREs Computational Molecular Science · doi:10.1002/wcms.1408 · Cited by 25
Metadata
- Authors
- Yang, P., Li, X.-L., Mei, J.-P., Kwoh, C.-K., & Ng, S.-K.
- Venue
- Bioinformatics
- Publisher
- Oxford University Press (OUP)
- Published
- 2012-08-24
- Volume
- 28
- Issue
- 20
- Pages
- 2640-2647
- ISSN
- 1367-4803 (ISSN-L)
- 1367-4811
- OpenAlex
- W2170283814
- Cited by
- 210
- References
- 59
- FWCI
- 2.09
- Type
- journal article
- Language
- en
- Open access
- hybrid
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
How to cite
Cite CoChat for the checks on this page, and the paper for its own findings.
- This page
- CoChat. (2026). Citation check: Positive-unlabeled learning for disease gene identification. https://app.cochat.ai/papers/10.1093/bioinformatics/bts504
- The paper
- Yang, P., Li, X.-L., Mei, J.-P., Kwoh, C.-K., & Ng, S.-K. (2012). Positive-unlabeled learning for disease gene identification. Bioinformatics. https://doi.org/10.1093/bioinformatics/bts504
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.