Parallel Out-of-Core Divide-and-Conquer Techniques with Application to Classification Trees

@inproceedings{Sreenivas1999ParallelOD,
  title={Parallel Out-of-Core Divide-and-Conquer Techniques with Application to Classification Trees},
  author={Mahesh K. Sreenivas and Khaled Alsabti and Sanjay Ranka},
  booktitle={IPPS/SPDP},
  year={1999}
}
Classification is an important problem in the field of data mining. Construction of good classifiers is computationally intensive and offers plenty of scope for parallelization. Divide-and-conquer paradigm can be used to efficiently construct decision tree classifiers. We discuss in detail various techniques for parallel divide-and-conquer and extend these techniques to handle efficiently disk-resident data. Furthermore, a generic technique for parallel out-ofcore divide-and-conquer problems is… CONTINUE READING

References

Publications referenced by this paper.
Showing 1-10 of 16 references

Parallel Out-of-Core Decision Tree Classifiers

  • M. K. Sreenivas
  • Master’s thesis,
  • 1998
Highly Influential
10 Excerpts

Efficient Algorithms for Data Mining

  • K. AlSabti
  • Ph.D. Thesis, Syracuse University,
  • 1998
2 Excerpts

Runtime Support for Unstructured Data Accesses on Coarse-Grained Distributed Memory Parallel Machines

  • S. Bae
  • PhD thesis,
  • 1997
1 Excerpt

Similar Papers

Loading similar papers…