Knowledge Discovery Employing Grid Scheme Least Squares Support Vector Machines Based on an Orthogonal Design Bee Colony Algorithm

Publisher:
IEEE
Publication Type:
Journal Article
Citation:
IEEE Transactions on Systems, Man, and Cybernetics, Part B: Cybernetics, 2011, 41 (5), pp. 1198 - 1212
Issue Date:
2011-01
Full metadata record
Files in This Item:
Filename Description Size
Thumbnail2011001619OK.pdfPublished Version1.32 MB
Adobe PDF
This paper proposes a concept for machine learning that integrates a grid scheme (GS) into a least squares support vector machine (LSSVM) (called GS-LSSVM) with a mixed kernel in order to solve data classification problems. The purpose of GS-LSSVM is to execute feature selections, mixed kernel applications, and parameter optimization in a learning paradigm. The proposed learning paradigm includes three steps. First, an orthogonal design is utilized to initialize the number of input features and candidate parameters stored in GS. Then, the features are randomly selected according to the first grid acquired from the first step. These features and the candidate parameters are then passed to LSSVM. Finally, an artificial bee colony algorithm, the recently popular heuristic algorithm, is used to optimize parameters for LSSVM learning. For illustration and evaluation purposes, ten remarkable data sets from the University of California Irvine database are used as testing targets. The experimental results reveal that the proposed GS-LSSVM can produce a classification model more easily interpreted using a small number of features. In terms of accuracy (hit ratio), the GS-LSSVM can significantly outperform other methods listed in this paper. These findings imply that the GS-LSSVM is a promising approach to classification exploration.
Please use this identifier to cite or link to this item: