This paper presents a new algorithm for Support Vector Machine (SVM) training, which trains a machine based on the cluster centers of errors caused by the current machine. Experiments with various training sets show that the computation time of this new algorithm scales almost linear with training set size and thus may be applied to much larger training sets, in comparison to standard quadratic programming (QP) techniques. This paper presents a new algorithm for Support Vector Machine (SVM) training, which trains a machine based on the cluster centers of errors caused by the current machine. Experiments with various training sets show that the computation time of this new algorithm scales almost linear with training set size and thus may be applied to much larger training sets, in comparison to standard quadratic programming (QP) techniques.