Back to search

Article

Refining interaction search through signed iterative Random Forests

2018-11-11

Abstract excerpt

Advances in supervised learning have enabled accurate prediction in biological systems governed by complex interactions among biomolecules. However, state-of-the-art predictive algorithms are typically “black-boxes,” learning statistical interactions that are difficult to translate into testable hypotheses. The iterative Random Forest (iRF) algorithm took a step towards bridging this gap by providing a computation...

Topics

Open a Topic to create a Post that cites this publication.

Identifiers and source

Literature Corpus work
8a19196f-289b-55d7-9440-655a4ce8cb83
DOI
10.1101/467498
Open publication

Related research

Semantic proximity does not establish scientific evidence.

Click a neighbor to travelStep 1 · 12 closest
Interactive article relationship graphSelect a related publication card to move it into the centre and load its closest explainable connections. Solid lines are source-backed structured connections. Dashed lines are semantic discovery signals and are not scientific evidence.
Refining interaction search through signed iterative Random ForestsDOI 10.1101/467498
Select a neighboring publication to make it the new centre.