Cited by 677Machine Learning and AlgorithmsNeural Networks and ApplicationsStatistical Methods and Inference

Decision forests: A unified framework for classification, regression, density estimation, manifold learning and semi-supervised learning

Criminisi, Antonio, Shotton, Jamie, Konukoglu, Ender·2012·Foundations and Trends® in Computer Graphics and Vision

Abstract

This review presents a unified, efficient model of random decision forests which can be applied to a number of machine learning, computer vision, and medical image analysis tasks. Our model extends existing forest-based techniques as it unifies classification, regression, density estimation, manifold learning, semisupervised learning, and active learning under the same decision forest framework. This gives us the opportunity to write and optimize the core implementation only once, with application to many diverse tasks. The proposed model may be used both in a discriminative or generative way and may be applied to discrete or continuous, labeled or unlabeled data. The main contributions of this review are: (1) Proposing a unified, probabilistic and efficient model for a variety of learning tasks; (2) Demonstrating margin-maximizing properties of classification forests; (3) Discussing probabilistic regression forests in comparison with other nonlinear regression algorithms; (4) Introducing density forests for estimating probability density functions; (5) Proposing an efficient algorithm for sampling from a density forest; (6) Introducing manifold forests for nonlinear dimensionality reduction; (7) Proposing new algorithms for transductive learning and active learning. Finally, we discuss how alternatives such as random ferns and extremely randomized trees stem from our more general forest model. This document is directed at both students who wish to learn the basics of decision forests, as well as researchers interested in the new contributions. It presents both fundamental and novel concepts in a structured way, with many illustrative examples and real-world applications. Thorough comparisons with state-of-the-art algorithms such as support vector machines, boosting and Gaussian processes are presented and relative advantages and disadvantages discussed. The many synthetic examples and existing commercial applications demonstrate the validity of the proposed model and its flexibility.

Integrity signals

Registry

Crossref · 10.1561/0600000035

Cites

58 of 58 references verified0 citation errors · 0 not checkable

Statistics

Recomputing p-values needs the paper’s full text.

Claims the paper makes

This paper’s full text isn’t openly available, so its claims and self-check weren’t run. The registry and citation checks still apply.

Cites

Flagged first, then by citations

Cited by

Sorted by citations

Authors
Criminisi, A., Shotton, J., & Konukoglu, E.
Affiliations
  • Microsoft Research (United Kingdom) (GB)
  • Microsoft Research Ltd. , 7 J J Thomson Ave, Cambridge, CB3 0FB,
Corresponding author
Criminisi, Antonio
Venue
Foundations and Trends® in Computer Graphics and Vision
Publisher
Emerald
Published
2012-03-29
Volume
7
Issue
2-3
Pages
81-227
ISSN
  • 1572-2740 (ISSN-L)
  • 1572-2759
OpenAlex
W4293171766
Cited by
677
References
58
Citations by year
2026: 18 · 2025: 29 · 2024: 30 · 2023: 52 · 2022: 37 · 2021: 55 · 2020: 51 · 2019: 64 · 2018: 50 · 2017: 62 · 2016: 66 · 2015: 66 · 2014: 45 · 2013: 37 · 2012: 15
FWCI
51.33
Type
journal article
Language
en
Open access
closed
Locations
Foundations and Trends® in Computer Graphics and Vision (publishedVersion)
Topics
  • Physical Sciences › Computer Science › Artificial Intelligence › Machine Learning and Algorithms
  • Physical Sciences › Computer Science › Artificial Intelligence › Neural Networks and Applications
  • Physical Sciences › Mathematics › Statistics and Probability › Statistical Methods and Inference
Keywords
decision forest, random forest, classification, regression analysis, density estimation, manifold learning, nonlinear dimensionality reduction, semi-supervised learning, active learning (machine learning), transductive learning, margin maximization, random ferns, extra trees, probabilistic regression

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