关键词: 数据挖掘, SPRINT决策树分类, 并行性

Abstract: One of the greatest problems with the decision tree technique is that the computational complexities are normally proportional to the size of training data set, so the computing time of constructing decision tree on large data sets is prohibitive. Parallelism is one effective solution to this problem. In this paper, parallel formulation of SPRINT decision tree algorithm based on synchronous tree construction approach was presented and a proposal of further study was given.

Key words: data mining, SPRINT decision tree classification, parallelism