CoChat

Incremental Learning of Random Forests for Large-Scale Image Classification

Ristin, Marko, Guillaumin, Matthieu, Gall, Juergen, Van Gool, Luc · 2016 · IEEE Transactions on Pattern Analysis and Machine Intelligence
Cited by 154

The DOI matches its Crossref record; 8 of the 8 references it cites were found in a registry or an index.

Abstract

Large image datasets such as ImageNet or open-ended photo websites like Flickr are revealing new challenges to image classification that were not apparent in smaller, fixed sets. In particular, the efficient handling of dynamically growing datasets, where not only the amount of training data but also the number of classes increases over time, is a relatively unexplored problem. In this challenging setting, we study how two variants of Random Forests (RF) perform under four strategies to incorporate new classes while avoiding to retrain the RFs from scratch. The various strategies account for different trade-offs between classification accuracy and computational efficiency. In our extensive experiments, we show that both RF variants, one based on Nearest Class Mean classifiers and the other on SVMs, outperform conventional RFs and are well suited for incrementally learning new classes. In particular, we show that RFs initially trained with just 10 classes can be extended to 1,000 classes with an acceptable loss of accuracy compared to training from the full data and with great computational savings compared to retraining for each new batch of classes.

Overview

The claims and statistics of this paper haven’t been checked yet.

Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.

A few free checks a day · papers already verified open instantly · results are public

Integrity signals

Registry

Crossref · 10.1109/tpami.2015.2459678

Cites

8 of 8 references verified0 citation errors · 0 not checkable

Statistics

Verification

Claims the paper makes

The claims and statistics of this paper haven’t been checked yet.

Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.

A few free checks a day · papers already verified open instantly · results are public

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

Show all 8 references

Research works printed but not linked: 33

  1. 10.1109/CVPR.2012.6248060 · DOI · Paper page
  2. 10.1109/ICCV.2007.4409053 · DOI
  3. 10.1109/CVPR.2011.5995368 · DOI · Paper page
  4. 10.1109/CVPR.2012.6248055 · DOI · Paper page
  5. 10.1109/CVPR.2011.5995477 · DOI · Paper page
  6. 10.1109/CVPR.2010.5540064 · DOI · Paper page
  7. 10.1109/ICCVW.2009.5457447 · DOI · Paper page
  8. 10.1145/347090.347107 · DOI · Paper page
  9. lakshminarayanan, 0, Mondrian forests: Efficient online random forests, Proc Adv Neural Inf Process Syst, 3140
  10. schulter, 0, Online Hough-forests, Proc Brit Mach Vis Conf, 128.1
  11. 10.1007/s11263-009-0275-4 · DOI · Paper page
  12. 10.1109/CVPR.2011.5995627 · DOI · Paper page
  13. 10.1007/s11263-014-0713-9 · DOI
  14. bengio, 0, Label embedding trees for large multi-class tasks, Proc Adv Neural Inf Process Syst, 163
  15. deng, 0, Hedging your bets: Optimizing accuracy-specificity trade-offs in large scale visual recognition, Proc IEEE Conf Comput Vis Pattern Recog, 3450
  16. 10.1109/CVPR.2006.264 · DOI · Paper page
  17. 10.1109/ICCV.2007.4409066 · DOI · Paper page
  18. 10.1109/CVPR.2011.5995441 · DOI
  19. 10.1109/CVPR.2012.6247757 · DOI
  20. deng, 0, Fast and balanced: Efficient label tree learning for large scale object recognition, Proc Adv Neural Inf Process Syst, 567
  21. 10.1145/3147.3165 · DOI · Paper page
  22. wang, 0, An incremental extremely random forest classifier for online learning and tracking, Proc 16th IEEE Int Conf Image Process, 1433
  23. 10.1109/CVPR.2011.5995720 · DOI · Paper page
  24. 10.1023/A:1018628609742 · DOI · Paper page
  25. 10.1109/CVPR.2013.114 · DOI
  26. 10.1007/978-3-319-10599-4_29 · DOI · Paper page
  27. 10.1109/ICCV.2011.6126228 · DOI · Paper page
  28. 10.1109/CVPR.2013.431 · DOI · Paper page
  29. 10.1109/TPAMI.2013.146 · DOI · Paper page
  30. 10.1109/TPAMI.2008.128 · DOI · Paper page
  31. 10.1109/TPAMI.2013.83 · DOI · Paper page
  32. 10.1007/978-3-642-15555-0_6 · DOI · Paper page
  33. 10.1109/CVPR.2014.107 · DOI

Cited by

See all 154

Metadata

Authors
Ristin, M., Guillaumin, M., Gall, J., & Van Gool, L.
Venue
IEEE Transactions on Pattern Analysis and Machine Intelligence
Published
2016-03-01
Volume
38
Issue
3
Pages
490-503
ISSN
  • 0162-8828 (ISSN-L)
  • 2160-9292
  • 1939-3539
OpenAlex
W2267727210
Cited by
154
References
8
FWCI
18.14
Type
journal article
Language
en
Open access
closed
Funders
  • CTI project (15769.1 PFES-ES)
  • DFG Emmy Noether program (GA 1927/1-1)
  • DFG project (GA 1927/2-2 FOR 1505)
  • Toyota

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: Incremental Learning of Random Forests for Large-Scale Image Classification. https://app.cochat.ai/papers/10.1109/tpami.2015.2459678
The paper
Ristin, M., Guillaumin, M., Gall, J., & Van Gool, L. (2016). Incremental Learning of Random Forests for Large-Scale Image Classification. IEEE Transactions on Pattern Analysis and Machine Intelligence. https://doi.org/10.1109/tpami.2015.2459678

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.