By Topic

Granular Support Vector Machines Using Linear Decision Hyperplanes for Fast Medical Binary Classification

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$33 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

5 Author(s)
Yuchun Tang ; Dept. of Comput. Sci., Georgia State Univ., Atlanta, GA ; Bo Jin ; Yan-Qing Zhang ; Hao Fang
more authors

In many life science applications, due to the requirement of real time data processing and/or the very large size of the available dataset, a classifier with high efficiency is usually more preferable, or even necessary, with the prerequisite of not deteriorating effectiveness too much. That means a more desirable classifier in this context should run faster but still retain high accuracy. In this paper, we show a simple but fast method for modeling a linear granular support vector machine by splitting the feature space to two smaller subspaces and then building a SVM for each of them. The hyperplane used to halve the feature space is searched by applying the extended statistical margin maximization principle along the direction orthogonal to the first principle component. One public medical dataset is used to compare the resulting linear GSVM to one optimized SVM with the radial basis function (RBF) kernel in the whole feature space. The experimental results show that finding the splitting hyperplane is not a trivial task and the linear GSVM is even a little better than the optimized RBF-SVM in terms of testing accuracy, but the linear GSVM is more robust against noises, more stable to model parameters, and runs much faster. In general, GSVM provides an interesting new mechanism, which is competitive to kernel mapping methods, to address complex classification problems effectively and efficiently

Published in:

The 14th IEEE International Conference on Fuzzy Systems, 2005. FUZZ '05.

Date of Conference:

25-25 May 2005