Cargando…

Consistent probabilistic outputs for protein function prediction

In predicting hierarchical protein function annotations, such as terms in the Gene Ontology (GO), the simplest approach makes predictions for each term independently. However, this approach has the unfortunate consequence that the predictor may assign to a single protein a set of terms that are inco...

Descripción completa

Detalles Bibliográficos
Autores principales: Obozinski, Guillaume, Lanckriet, Gert, Grant, Charles, Jordan, Michael I, Noble, William Stafford
Formato: Texto
Lenguaje:English
Publicado: BioMed Central 2008
Materias:
Acceso en línea:https://www.ncbi.nlm.nih.gov/pmc/articles/PMC2447540/
https://www.ncbi.nlm.nih.gov/pubmed/18613950
http://dx.doi.org/10.1186/gb-2008-9-s1-s6
_version_ 1782156963051732992
author Obozinski, Guillaume
Lanckriet, Gert
Grant, Charles
Jordan, Michael I
Noble, William Stafford
author_facet Obozinski, Guillaume
Lanckriet, Gert
Grant, Charles
Jordan, Michael I
Noble, William Stafford
author_sort Obozinski, Guillaume
collection PubMed
description In predicting hierarchical protein function annotations, such as terms in the Gene Ontology (GO), the simplest approach makes predictions for each term independently. However, this approach has the unfortunate consequence that the predictor may assign to a single protein a set of terms that are inconsistent with one another; for example, the predictor may assign a specific GO term to a given protein ('purine nucleotide binding') but not assign the parent term ('nucleotide binding'). Such predictions are difficult to interpret. In this work, we focus on methods for calibrating and combining independent predictions to obtain a set of probabilistic predictions that are consistent with the topology of the ontology. We call this procedure 'reconciliation'. We begin with a baseline method for predicting GO terms from a collection of data types using an ensemble of discriminative classifiers. We apply the method to a previously described benchmark data set, and we demonstrate that the resulting predictions are frequently inconsistent with the topology of the GO. We then consider 11 distinct reconciliation methods: three heuristic methods; four variants of a Bayesian network; an extension of logistic regression to the structured case; and three novel projection methods - isotonic regression and two variants of a Kullback-Leibler projection method. We evaluate each method in three different modes - per term, per protein and joint - corresponding to three types of prediction tasks. Although the principal goal of reconciliation is interpretability, it is important to assess whether interpretability comes at a cost in terms of precision and recall. Indeed, we find that many apparently reasonable reconciliation methods yield reconciled probabilities with significantly lower precision than the original, unreconciled estimates. On the other hand, we find that isotonic regression usually performs better than the underlying, unreconciled method, and almost never performs worse; isotonic regression appears to be able to use the constraints from the GO network to its advantage. An exception to this rule is the high precision regime for joint evaluation, where Kullback-Leibler projection yields the best performance.
format Text
id pubmed-2447540
institution National Center for Biotechnology Information
language English
publishDate 2008
publisher BioMed Central
record_format MEDLINE/PubMed
spelling pubmed-24475402008-07-10 Consistent probabilistic outputs for protein function prediction Obozinski, Guillaume Lanckriet, Gert Grant, Charles Jordan, Michael I Noble, William Stafford Genome Biol Method In predicting hierarchical protein function annotations, such as terms in the Gene Ontology (GO), the simplest approach makes predictions for each term independently. However, this approach has the unfortunate consequence that the predictor may assign to a single protein a set of terms that are inconsistent with one another; for example, the predictor may assign a specific GO term to a given protein ('purine nucleotide binding') but not assign the parent term ('nucleotide binding'). Such predictions are difficult to interpret. In this work, we focus on methods for calibrating and combining independent predictions to obtain a set of probabilistic predictions that are consistent with the topology of the ontology. We call this procedure 'reconciliation'. We begin with a baseline method for predicting GO terms from a collection of data types using an ensemble of discriminative classifiers. We apply the method to a previously described benchmark data set, and we demonstrate that the resulting predictions are frequently inconsistent with the topology of the GO. We then consider 11 distinct reconciliation methods: three heuristic methods; four variants of a Bayesian network; an extension of logistic regression to the structured case; and three novel projection methods - isotonic regression and two variants of a Kullback-Leibler projection method. We evaluate each method in three different modes - per term, per protein and joint - corresponding to three types of prediction tasks. Although the principal goal of reconciliation is interpretability, it is important to assess whether interpretability comes at a cost in terms of precision and recall. Indeed, we find that many apparently reasonable reconciliation methods yield reconciled probabilities with significantly lower precision than the original, unreconciled estimates. On the other hand, we find that isotonic regression usually performs better than the underlying, unreconciled method, and almost never performs worse; isotonic regression appears to be able to use the constraints from the GO network to its advantage. An exception to this rule is the high precision regime for joint evaluation, where Kullback-Leibler projection yields the best performance. BioMed Central 2008 2008-06-27 /pmc/articles/PMC2447540/ /pubmed/18613950 http://dx.doi.org/10.1186/gb-2008-9-s1-s6 Text en Copyright © 2008 Obozinski et al; licensee BioMed Central Ltd. http://creativecommons.org/licenses/by/2.0 This is an open access article distributed under the terms of the Creative Commons Attribution License ( (http://creativecommons.org/licenses/by/2.0) ), which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.
spellingShingle Method
Obozinski, Guillaume
Lanckriet, Gert
Grant, Charles
Jordan, Michael I
Noble, William Stafford
Consistent probabilistic outputs for protein function prediction
title Consistent probabilistic outputs for protein function prediction
title_full Consistent probabilistic outputs for protein function prediction
title_fullStr Consistent probabilistic outputs for protein function prediction
title_full_unstemmed Consistent probabilistic outputs for protein function prediction
title_short Consistent probabilistic outputs for protein function prediction
title_sort consistent probabilistic outputs for protein function prediction
topic Method
url https://www.ncbi.nlm.nih.gov/pmc/articles/PMC2447540/
https://www.ncbi.nlm.nih.gov/pubmed/18613950
http://dx.doi.org/10.1186/gb-2008-9-s1-s6
work_keys_str_mv AT obozinskiguillaume consistentprobabilisticoutputsforproteinfunctionprediction
AT lanckrietgert consistentprobabilisticoutputsforproteinfunctionprediction
AT grantcharles consistentprobabilisticoutputsforproteinfunctionprediction
AT jordanmichaeli consistentprobabilisticoutputsforproteinfunctionprediction
AT noblewilliamstafford consistentprobabilisticoutputsforproteinfunctionprediction