Change search
CiteExportLink to record
Permanent link

Direct link
Cite
Citation style
  • apa
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • Other style
More styles
Language
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Other locale
More languages
Output format
  • html
  • text
  • asciidoc
  • rtf
Concurrent Learning of Large-Scale Random Forests
Stockholms universitet, Institutionen för data- och systemvetenskap.
2011 (English)In: Scandinavian Conference on Artificial Intelligence, IOS Press , 2011Conference paper, Published paper (Refereed)
Abstract [en]

The random forest algorithm belongs to the class of ensemble learning methods that are embarassingly parallel, i.e., the learning task can be straightforwardly divided into subtasks that can be solved independently by concurrent processes. A parallel version of the random forest algorithm has been implemented in Erlang, a concurrent programming language originally developed for telecommunication applications. The implementation can be used for generating very large forests, or handling very large datasets, in a reasonable time frame. This allows for investigating potential gains in predictive performance from generating large-scale forests. An empirical investigation on 34 datasets from the UCI repository shows that forests of 1000 trees significantly outperform forests of 100 trees with respect to accuracy, area under ROC curve (AUC) and Brier score. However, increasing the forest sizes to 10 000 or 100 000 trees does not give any further significant performance gains.

Place, publisher, year, edition, pages
IOS Press , 2011.
Keyword [en]
random forests; concurrent learning; Erlang
National Category
Information Systems
Identifiers
URN: urn:nbn:se:kth:diva-221451DOI: 10.3233/978-1-60750-754-3-20ISI: 000329410700007Scopus ID: 2-s2.0-79956082815ISBN: 978-1-60750-753-6 (print)OAI: oai:DiVA.org:kth-221451DiVA, id: diva2:1175350
Conference
Scandinavian Conference on Artificial Intelligence
Note

QC 20180122

Available from: 2018-01-17 Created: 2018-01-17 Last updated: 2018-01-22Bibliographically approved

Open Access in DiVA

fulltext(157 kB)12 downloads
File information
File name FULLTEXT01.pdfFile size 157 kBChecksum SHA-512
9164843fe01fba606dd913711dc0a049e929d8e9528068b62c9b24d86a442ede1ba0dd97185d7ebdd54daba25d1615fb4f359168f78cca0f66de60c631e1cbd7
Type fulltextMimetype application/pdf

Other links

Publisher's full textScopus

Search in DiVA

By author/editor
Boström, Henrik
Information Systems

Search outside of DiVA

GoogleGoogle Scholar
Total: 12 downloads
The number of downloads is the sum of all downloads of full texts. It may include eg previous versions that are now no longer available

doi
isbn
urn-nbn

Altmetric score

doi
isbn
urn-nbn
Total: 17 hits
CiteExportLink to record
Permanent link

Direct link
Cite
Citation style
  • apa
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • Other style
More styles
Language
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Other locale
More languages
Output format
  • html
  • text
  • asciidoc
  • rtf
v. 2.34-SNAPSHOT
|