The DOI matches its Crossref record; 5 of the 5 references it cites were found in a registry or an index.
RANDOM FOREST SIMILARITY FOR PROTEIN-PROTEIN INTERACTION PREDICTION FROM MULTIPLE SOURCES
Abstract
One of the most important, but often ignored, parts of any clustering and classification algorithm is the computation of the similarity matrix. This is especially important when integrating high throughput biological data sources because of the high noise rates and the many missing values. In this paper we present a new method to compute such similarities for the task of classifying pairs of proteins as interacting or not. Our method uses direct and indirect information about interaction pairs to constructs a random forest (a collection of decision tress) from a training set. The resulting forest is used to determine the similarity between protein pairs and this similarity is used by a classification algorithm (a modified kNN) to classify protein pairs. Testing the algorithm on yeast data indicates that it is able to improve coverage to 20% of interacting pairs with a false positive rate of 50%. These results compare favorably with all previously suggested methods for this task indicating the importance of robust similarity estimates.
Overview
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
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
A comprehensive analysis of protein–protein interactions in Saccharomyces cerevisiae
Uetz, P., Giot, L., Cagney, G., Mansfield, T. A., Judson, R. S., Knight, J. R., Lockshon, D., Narayan, V., Srinivasan, M., Pochart, P., et al. (2000) · Nature · doi:10.1038/35001009 · Cited by 4,706
Global analysis of protein localization in budding yeast
Huh, W.-K., Falvo, J. V., Gerke, L. C., Carroll, A. S., Howson, R. W., Weissman, J. S., & O'Shea, E. K. (2003) · Nature · doi:10.1038/nature02026 · Cited by 4,248
Global analysis of protein expression in yeast
Ghaemmaghami, S., Huh, W.-K., Bower, K., Howson, R. W., Belle, A., Dephoure, N., O'Shea, E. K., & Weissman, J. S. (2003) · Nature · doi:10.1038/nature02046 · Cited by 3,750
A comprehensive two-hybrid analysis to explore the yeast protein interactome
Ito, T., Chiba, T., Ozawa, R., Yoshida, M., Hattori, M., & Sakaki, Y. (2001) · Proceedings of the National Academy of Sciences · doi:10.1073/pnas.061034498 · Cited by 3,566
Transcriptional Regulatory Networks in Saccharomyces cerevisiae
Lee, T. I., Rinaldi, N. J., Robert, F., Odom, D. T., Bar-Joseph, Z., Gerber, G. K., Hannett, N. M., Harbison, C. T., Thompson, C. M., Simon, I., et al. (2002) · Science · doi:10.1126/science.1075090 · Cited by 2,956
Self-citation
Cited by
Leskovec, J., Lang, K. J., Dasgupta, A., & Mahoney, M. W. (2009) · Internet Mathematics · doi:10.1080/15427951.2009.10129177 · Cited by 1,872
Statistical properties of community structure in large social and information networks
Leskovec, J., Lang, K. J., Dasgupta, A., & Mahoney, M. W. (2008) · Proceedings of the 17th international conference on World Wide Web · doi:10.1145/1367497.1367591 · Cited by 860
Random Forest for Bioinformatics
Qi, Y. (2012) · Ensemble Machine Learning · doi:10.1007/978-1-4419-9326-7_11 · Cited by 754
Self-citationModeling cellular machinery through biological network comparison
Sharan, R., & Ideker, T. (2006) · Nature Biotechnology · doi:10.1038/nbt1196 · Cited by 559
Prediction of protein–protein interactions using random decision forest framework
Chen, X.-W., & Liu, M. (2005) · Bioinformatics · doi:10.1093/bioinformatics/bti721 · Cited by 382
Metadata
- Authors
- QI, Y., KLEIN-SEETHARAMAN, J., & BAR-JOSEPH, Z.
- Venue
- Biocomputing 2005
- Publisher
- WORLD SCIENTIFIC
- Published
- 2004-12
- Pages
- 531-542
- OpenAlex
- W2147774652
- Cited by
- 175
- References
- 5
- FWCI
- 18.83
- Type
- conference paper
- Language
- en
- Open access
- closed
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: RANDOM FOREST SIMILARITY FOR PROTEIN-PROTEIN INTERACTION PREDICTION FROM MULTIPLE SOURCES. https://app.cochat.ai/papers/10.1142/9789812702456_0050
- The paper
- QI, Y., KLEIN-SEETHARAMAN, J., & BAR-JOSEPH, Z. (2004). RANDOM FOREST SIMILARITY FOR PROTEIN-PROTEIN INTERACTION PREDICTION FROM MULTIPLE SOURCES. Biocomputing 2005. https://doi.org/10.1142/9789812702456_0050
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.