A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit <a rel="external noopener" href="http://www.cs.rpi.edu/~zaki/PaperDir/PS/IBM-TR-sprint_smp.pdf">the original URL</a>. The file type is <code>application/pdf</code>.
Parallel classification for data mining on shared-memory multiprocessors
<span title="">1999</span>
<i title="IEEE">
<a target="_blank" rel="noopener" href="https://fatcat.wiki/container/vuw5ktdyknehrehttg5qm4rfqm" style="color: black;">Proceedings 15th International Conference on Data Engineering (Cat. No.99CB36337)</a>
</i>
Preserved Fulltext
We present parallel algorithms for building decision-tree classi ers on shared-memory multiprocessor SMP systems. The proposed algorithms span the gamut of data and task parallelism. The data parallelism is based on attribute scheduling among processors. This basic scheme is extended with task pipelining and dynamic load balancing to yield faster implementations. The task parallel approach uses dynamic subtree partitioning among processors. We e v aluate the performance of these algorithms on
<span class="external-identifiers">
<a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1109/icde.1999.754925">doi:10.1109/icde.1999.754925</a>
<a target="_blank" rel="external noopener" href="https://dblp.org/rec/conf/icde/ZakiHA99.html">dblp:conf/icde/ZakiHA99</a>
<a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/4ydp6hzlazhnhkainlxtfq22xe">fatcat:4ydp6hzlazhnhkainlxtfq22xe</a>
</span>
more »
... o machine con gurations: one in which data is too large to t in memory and must be paged from a local disk as needed and the other in which memory is su ciently large to cache the whole data. This performance evaluation shows that the construction of a decision-tree classi er can be e ectively parallelized on an SMP machine with good speedup. For the local disk con guration, the speedup ranged from 2.97 to 3.86 for the build phase and from 2.20 to 3.67 for the total time on a 4-processor SMP. F or the large memory con guration, the range of speedup was from 5.36 to 6.67 for the build phase and from 3.07 to 5.98 for the total time on an 8-processor SMP.
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20170706102133/http://www.cs.rpi.edu/~zaki/PaperDir/PS/IBM-TR-sprint_smp.pdf" title="fulltext PDF download" data-goatcounter-click="serp-fulltext" data-goatcounter-title="serp-fulltext">
<button class="ui simple right pointing dropdown compact black labeled icon button serp-button">
<i class="icon ia-icon"></i>
Web Archive
[PDF]
<div class="menu fulltext-thumbnail">
<img src="https://blobs.fatcat.wiki/thumbnail/pdf/52/64/5264509a7df699a48d554bca3b54e4320d291f82.180px.jpg" alt="fulltext thumbnail" loading="lazy">
</div>
</button>
</a>
<a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1109/icde.1999.754925">
<button class="ui left aligned compact blue labeled icon button serp-button">
<i class="external alternate icon"></i>
ieee.com
</button>
</a>