A New Data Classification Algorithm for Data-Intensive Computing Environments

摘要

In order to solve the problem of how to improve the scalability of data processing capabilities and the data availability which encountered by data mining techniques for Dataintensive computing, a new method of tree learning is presented in this paper. By introducing the MapReduce, the tree learning method based on SPRINT can obtain a well scalability when address large datasets. Moreover, we define the process of split point as a series of distributed computations, which is implemented with the MapReduce model respectively. And a new data structure called class distribution table is introduced to assist the calculation of histogram. Experiments and results analysis shows that the algorithm has strong processing capabilities of data mining for dataintensive computing environments.