See this document in CiteSeerX!

Parallel Formulations of Decision-Tree Classification Algorithms (1998)  (Make Corrections)  (13 citations)
A. Srivastava E. Han V. Kumar V. Singh Information Technology Lab Dept. of...
Data Mining and Knowledge Discovery



  Home/Search   Context   Related

 
View or download:
umn.edu/dept/users/k...classparicpp.ps
Cached:  PS.gz  PS  PDF   Image  Update  Help

From:  umn.edu/dept/users/kumar...papers (more)
(Enter author homepages)

Rate this article: (best)
  Comment on this article  
(Enter summary)

Abstract: Classification decision tree algorithms are used extensively for data mining in many domains such as retail target marketing, fraud detection, etc. Highly parallel algorithms for constructing classification decision trees are desirable for dealing with large data sets in reasonable amount of time. Algorithms for building classification decision trees have a natural concurrency, but are difficult to parallelize due to the inherent dynamic nature of the computation. In this paper, we present... (Update)

Cited by:   More
Algorithms and Software for Collaborative.. - Caragea, Zhang..   (Correct)
Toward a Theoretical Framework for Analysis and - Synthesis Of Agents (2000)   (Correct)
Shared Memory Parallelization of Data Mining Algorithms.. - Jin, Yang, Agrawal (2004)   (Correct)

Similar documents (at the sentence level):   More
26.1%:   Dynamic Load Balancing of Unstructured Computations in .. - Srivastava, Han.. (1998)   (Correct)
17.4%:   Parallel Formulations of Inductive Classification Learning .. - Han, Srivastava, Kumar (1996)   (Correct)
14.8%:   Parallel Algorithms in Data Mining - Joshi, Han, Karypis, Kumar (2000)   (Correct)

Active bibliography (related documents):   More   All
1.1:   Parallel Formulations of Decision-Tree Classification.. - Anurag Srivastava Eui-Hong (1998)   (Correct)
0.8:   Methods to Reduce I/O for Decision Tree Classifiers - Vineet Singh   (Correct)
0.2:   PKDD'98 Tutorial on Scalable, High-Performance Data Mining with.. - Freitas (1998)   (Correct)

Similar documents based on text:   More   All
0.4:   Overcast: Reliable Multicasting with an Overlay Network - Jannotti, Gifford.. (2000)   (Correct)
0.2:   Developments in Japan - Hoffmann, SCHNEPF   (Correct)
0.2:   A One-Pass Algorithm for Accurately Estimating Quantiles.. - Alsabti, Ranka, Singh (1997)   (Correct)

Related documents from co-citation:   More   All
10:   Scalable parallel data mining for association rules - Han, Karypis et al. - 1997
7:   Parallel Classification for Data Mining on Shared-Memory Multiprocessors - Zaki, Ho et al. - 1998
6:   A data clustering algorithm on distributed memory machines - Dhillon, Modha

BibTeX entry:   (Update)

A. Srivastava, E.-H. Han, V. Kumar, and V. Singh. Parallel formulations of decision-tree classification algorithms. In Proc. 1998 International Conference on Parallel Processing, 1998. http://citeseer.ist.psu.edu/srivastava98parallel.html   More

@article{ srivastava99parallel,
    author = "Anurag Srivastava and Eui-Hong Han and Vipin Kumar and Vineet Singh",
    title = "Parallel Formulations of Decision-Tree Classification Algorithms",
    journal = "Data Mining and Knowledge Discovery",
    volume = "3",
    number = "3",
    pages = "237-261",
    year = "1999",
    url = "citeseer.ist.psu.edu/srivastava98parallel.html" }
Citations (may not include all citations):
1262   Classification and Regression Trees (context) - Breiman, Friedman et al. - 1984
1051   Optimizations and Machine Learning (context) - Goldberg, in - 1989
281   Programs for Machine Learning (context) - Quinlan - 1993
227   An introduction to computing with neural nets (context) - Lippmann - 1987
200   Neural and Statistical Classification (context) - Spiegelhalter, Michie et al. - 1994
145   SPRINT: A scalable parallel classifier for data mining - Shafer, Agrawal et al. - 1996
111   SLIQ: A fast scalable classifier for data mining - Mehta, Agrawal et al. - 1996
100   Database mining: A performance perspective - Agrawal, Imielinski et al. - 1993
62   Megainduction: Machine Learning on Very Large Databases (context) - Catlett - 1991
45   Experiments on multistrategy learning by metalearning - Chan, Stolfo - 1993
36   Unstructured tree search on simd parallel computers - Karypis, Kumar - 1994
27   ScalParC: A new scalable and efficient parallel classificati.. - Joshi, Karypis et al. - 1998
21   Introduction to Parallel Computing: Algorithm Design and Ana.. (context) - Kumar, Grama et al. - 1994
18   A one-pass algorithm for accurately estimating quantiles for.. - Alsabti, Ranka et al. - 1997
15   Use of contextual information for feature ranking and discre.. - Hong - 1997
14   Experiments on the costs and benefits of windowing in ID (context) - Wirth, Catlett - 1988
11   Many-to-many communication with bounded traffic (context) - Shankar, Alsabti et al. - 1995
7   CLOUDS: Classification for large or out-of-core datasets (context) - Alsabti, Ranka et al. - 1998
4   Metalearning for multistrategy learning and parallel learnin.. (context) - Chan, Stolfo - 1993
4   parallel classifier for data mining (context) - Srivastava, Singh et al. - 1997



The graph only includes citing articles where the year of publication is known.


Documents on the same site (ftp://ftp.cs.umn.edu/dept/users/kumar/WEB/papers.html):   More
A Performance Study of Diffusive vs. Remapped.. - Karypis, Kumar..   (Correct)
A Universal Formulation of Sequential Patterns - Mahesh Joshi (1999)   (Correct)
A New Algorithm for Multi-objective Graph Partitioning - Schloegel, Karypis, Kumar (1999)   (Correct)

Online articles have much greater impact   More about CiteSeer.IST   Add search form to your site   Submit documents   Feedback  

CiteSeer.IST - Copyright Penn State and NEC