Enterprise Information Systems V pp 177-184
Mining Very Large Datasets with Support Vector Machine Algorithms
- Cite this paper as:
- Poulet F., Do TN. (2004) Mining Very Large Datasets with Support Vector Machine Algorithms. In: Camp O., Filipe J.B.L., Hammoudi S., Piattini M. (eds) Enterprise Information Systems V. Springer, Dordrecht
In this paper, we present new support vector machines (SVM) algorithms that can be used to classify very large datasets on standard personal computers. The algorithms have been extended from three recent SVMs algorithms: least squares SVM classification, finite Newton method for classification and incremental proximal SVM classification. The extension consists in building incremental, parallel and distributed SVMs for classification. Our three new algorithms are very fast and can handle very large datasets. An example of the effectiveness of these new algorithms is given with the classification into two classes of one billion points in 10-dimensional input space in some minutes on ten personal computers (800 MHz Pentium III, 256 MB RAM, Linux).
KeywordsData mining Parallel and distributed algorithms Classification Machine learning Support vector machines Least squares classifiers Newton method Proximal classifiers Incremental learning
Unable to display preview. Download preview PDF.