Support vector machines based on K-means clustering for real-time business intelligence systems

Publication Type:
Journal Article
Citation:
International Journal of Business Intelligence and Data Mining, 2005, 1 (1), pp. 54 - 64
Issue Date:
2005-12-01
Full metadata record
Files in This Item:
Filename Description Size
Thumbnail2005003337.pdf1.19 MB
Adobe PDF
Support vector machines (SVM) have been applied to build classifiers, which can help users make well-informed business decisions. Despite their high generalisation accuracy, the response time of SVM classifiers is still a concern when applied into real-time business intelligence systems, such as stock market surveillance and network intrusion detection. This paper speeds up the response of SVM classifiers by reducing the number of support vectors. This is done by the K-means SVM (KMSVM) algorithm proposed in this paper. The KMSVM algorithm combines the K-means clustering technique with SVM and requires one more input parameter to be determined: the number of clusters. The criterion and strategy to determine the input parameters in the KMSVM algorithm are given in this paper. Experiments compare the KMSVM algorithm with SVM on real-world databases, and the results show that the KMSVM algorithm can speed up the response time of classifiers by both reducing support vectors and maintaining a similar testing accuracy to SVM. Copyright © 2005 Inderscience Enterprises Ltd.
Please use this identifier to cite or link to this item: