Reducing time complexity of SVM model by LVQ data compression

Abstract

The standard SVM classifier is not adjusted to processing large training set as the computational complexity can reach O(n3). To overcome this limitation we discuss the idea of reducing the size of the training data by initial preprocessing of the training set using Learning Vector Quantization (LVQ) neural network and then building the SVM model using prototypes returned by the LVQ network. As the LVQ network scales linearly with n, and in contrast to clustering algorithms utilizes label information it seems to be a good choice for initial data compression.