1999•Unpublished venueRequires access

Parallel classification for data mining on shared-memory multiprocessors

Mohammed J. Zaki, Ching‐Tien Ho, R. K. Agrawal

Abstract

Presents parallel algorithms for building decision-tree classifiers 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. Our performance evaluation shows that the construction of a decision-tree classifier can be effectively parallelized on an SMP machine with good speedup.

About this research paper

What this paper is about

Why it matters

OpenAlex reports 100 citations for this work. Citation counts describe recorded attention and do not establish research quality.

Key contribution

A contribution statement is not available in the OpenAlex record.

Method / approach

Method details are not available in the OpenAlex metadata.

Main findings

Findings are not separately available in the OpenAlex metadata.

Limitations

Limitations are not available in the OpenAlex metadata.

Applications

Application details are not available in the OpenAlex metadata.

Available abstract

Key concepts: Computer science, Parallel computing, Speedup, Multiprocessing, Shared memory, Data parallelism, Scheduling (production processes), Parallelism (grammar)