|
|
|
@inproceedings{DBLP:conf/vldb/ShaferAM96,
author = {John C. Shafer and
Rakesh Agrawal and
Manish Mehta 0002},
editor = {T. M. Vijayaraman and
Alejandro P. Buchmann and
C. Mohan and
Nandlal L. Sarda},
title = {SPRINT: A Scalable Parallel Classifier for Data Mining},
booktitle = {VLDB'96, Proceedings of 22th International Conference on Very
Large Data Bases, September 3-6, 1996, Mumbai (Bombay), India},
publisher = {Morgan Kaufmann},
year = {1996},
isbn = {1-55860-382-4},
pages = {544-555},
ee = {db/conf/vldb/ShaferAM96.html},
crossref = {DBLP:conf/vldb/96},
bibsource = {DBLP, http://dblp.uni-trier.de}
}
Classification is an important data mining problem. Although classification is a well-studied problem, most of the current classification algorithms are designed only for memory-resident data, thus limiting their suitability for mining over large databases. The recently proposed SLIQ classification algorithm addressed several issues in building a fast scalable classifier. Unfortunately, SLIQ still requires some information to stay memory-resident. Furthermore, this information grows in direct proportion to the number of input records, putting a hard-limit on the size of data that can be classified.
We present for the first time a decision-tree-based classification algorithm that removes all of the memory restrictions, and is fast and scalable. The algorithm has also been designed to be easily parallelized. This parallelization, also presented here, represents the first scalable parallelization of a decision-tree classifier where all processors work together to build a single consistent model. The combination of these characteristics makes the proposed algorithm an ideal tool for data mining.
Copyright © 1996 by the VLDB Endowment. Permission to copy without fee all or part of this material is granted provided that the copies are not made or distributed for direct commercial advantage, the VLDB copyright notice and the title of the publication and its date appear, and notice is given that copying is by the permission of the Very Large Data Base Endowment. To copy otherwise, or to republish, requires a fee and/or special permission from the Endowment.
