This paper describes the development of an algorithm for training large data sets.
The algorithm uses a first stage of SVM with a small data set.
The algorithm uses decision trees to find best data points in the entire data set.
DT is trained using SV and non-SV found in the first SVM stage.
In the second SVM stage the training data represent all data points found by the DT.