mr-tree - a scalable mapreduce algorithm for building decision trees
Clicks: 328
ID: 173518
2014
Article Quality & Performance Metrics
Overall Quality
Not rated
Combines reader engagement with the AI quality analysis. This
article has not been analysed, so there is no overall score —
reader engagement is measured and shown alongside.
Reader Engagement
Steady Performance
67.6
/100
328 views
239 readers
Trending
AI Quality Assessment
Not analyzed
Readership in this journal
SteadyRanked #8 of 22 articles by views in current eye research
Most read
Least read
Bar heights use a square-root scale.
Mint this article as an NFT
Not yet mintedCreate a permanent, verifiable on-chain record of this article on the Scimatic Network. The NFT is held in your Journament account, and you can withdraw it to your own wallet at any time.
5
SUSD
one-off · no wallet required
Abstract
Learning decision trees against very large amounts
of data is not practical on single node computers due to the huge
amount of calculations required by this process. Apache Hadoop
is a large scale distributed computing platform that runs on
commodity hardware clusters and can be used successfully for
data mining task against very large datasets. This work presents
a parallel decision tree learning algorithm expressed in
MapReduce programming model that runs on Apache Hadoop
platform and has a very good scalability with dataset size.
| Reference Key |
purdil2014journalmr-tree
Use this key to autocite in the manuscript while using
SciMatic Manuscript Manager or Thesis Manager
|
|---|---|
| Authors | ;Vasile PURDILĂ;Stefan-Gheorghe PENTIUC |
| Journal | current eye research |
| Year | 2014 |
| DOI |
DOI not found
|
| URL | |
| Keywords |
Citations
No citations found. To add a citation, contact the admin at info@scimatic.org
Comments
No comments yet. Be the first to comment on this article.