Deutsch
 
Hilfe Datenschutzhinweis Impressum
  DetailsucheBrowse

Datensatz

 
 
DownloadE-Mail
  Leveraging Independence and Locality for Random Forests in a Distributed Environment

Belet, R. (2013). Leveraging Independence and Locality for Random Forests in a Distributed Environment. Master Thesis, Universität des Saarlandes, Saarbrücken.

Item is

Dateien

einblenden: Dateien
ausblenden: Dateien
:
2013_ MSc Thesis_Razvan_Belet.pdf (beliebiger Volltext), 2MB
 
Datei-Permalink:
-
Name:
2013_ MSc Thesis_Razvan_Belet.pdf
Beschreibung:
-
OA-Status:
Sichtbarkeit:
Eingeschränkt (Max Planck Institute for Informatics, MSIN; )
MIME-Typ / Prüfsumme:
application/pdf
Technische Metadaten:
Copyright Datum:
-
Copyright Info:
-
Lizenz:
-

Externe Referenzen

einblenden:

Urheber

einblenden:
ausblenden:
 Urheber:
Belet, Razvan1, 2, Autor           
Weikum, Gerhard1, Ratgeber           
Schenkel, Ralf1, Gutachter           
Affiliations:
1Databases and Information Systems, MPI for Informatics, Max Planck Society, ou_24018              
2International Max Planck Research School, MPI for Informatics, Max Planck Society, Campus E1 4, 66123 Saarbrücken, DE, ou_1116551              

Inhalt

einblenden:
ausblenden:
Schlagwörter: -
 Zusammenfassung: With the emergence of big data, inducting regression trees on very large data sets became a common data mining task. Even though centralized algorithms for computing ensembles of Classification/Regression trees are a well studied machine learning/data mining problem, their distributed versions still raise scalability, efficiency and accuracy issues. Most state of the art tree learning algorithms require data to reside in memory on a single machine. Adopting this approach for trees on big data is not feasible as the limited resources provided by only one machine lead to scalability problems. While more scalable implementations of tree learning algorithms have been proposed, they typically require specialized parallel computing architectures rendering those algorithms complex and error-prone. In this thesis we will introduce two approaches to computing ensembles of regression trees on very large training data sets using the MapReduce framework as an underlying tool. The first approach employs the entire MapReduce cluster to parallely and fully distributedly learn tree ensembles. The second approach exploits locality and independence in the tree learning process.

Details

einblenden:
ausblenden:
Sprache(n): eng - English
 Datum: 2013
 Publikationsstatus: Erschienen
 Seiten: 132 p.
 Ort, Verlag, Ausgabe: Saarbrücken : Universität des Saarlandes
 Inhaltsverzeichnis: -
 Art der Begutachtung: -
 Identifikatoren: BibTex Citekey: Belet2013
 Art des Abschluß: Master

Veranstaltung

einblenden:

Entscheidung

einblenden:

Projektinformation

einblenden:

Quelle

einblenden: