Pith. sign in

REVIEW 1 cited by

Signed iterative random forests to identify enhancer-associated transcription factor binding

Not yet reviewed by Pith; the record is open.

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

arxiv 1810.07287 v2 pith:ENJOBCLS submitted 2018-10-16 stat.ML cs.LG

classification stat.MLcs.LG
keywords bindingelementsenhancerforestsfunctionaliterativerandomsigned
verification ladder T0 review T1 audit T2 compute T3 formal

Signed reviews

No signed human review yet.

0 comments
read the original abstract

Standard ChIP-seq peak calling pipelines seek to differentiate biochemically reproducible signals of individual genomic elements from background noise. However, reproducibility alone does not imply functional regulation (e.g., enhancer activation, alternative splicing). Here we present a general-purpose, interpretable machine learning method: signed iterative random forests (siRF), which we use to infer regulatory interactions among transcription factors and functional binding signatures surrounding enhancer elements in Drosophila melanogaster.

Discussion (0). Continue with ORCID to comment.

Forward citations

Cited by 1 Pith paper

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score. Full citation record

  1. SIRUS: Stable and Interpretable RUle Set for Classification

    stat.ML 2019-08 conditional novelty 7.0 of 10

    SIRUS grows a random forest whose splits are limited to fixed quantiles, counts how often each rule appears across the forest, and retains only the most frequent rules to produce a stable and readable classifier.

Pith tools