Cart (Loading....) | Create Account
Close category search window
 

A New Model of Multi-class Support Vector Machine with Parameter v

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
$31 $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

2 Author(s)
Xin Xue ; Dept. of Math. & Syst. Sci., Taishan Univ., Tai''an, China ; Taian Liu

A new model of multi-class support vector machine with parameter v (v-MC-SVM) is proposed firstly based on v-SVM. Existence of optimal solutions and dual problem of v-MC-SVM are also given. Because the constraints of v-MC-SVM are too complicated, one-class SVM problem is given by adding bm to the objective function of v-MC-SVM and employing the Kesler's construction which simplify the original problem. The optimal solutions of one-class SVM problem are unchanged when its constraint eT ¿ ¿ v is replaced with eT¿ = v. Numerical testing results show that the speed of v-MC-SVM algorithm is faster than that of QP-MC-SVM algorithm under the same accuracy rate.

Published in:

Fuzzy Systems and Knowledge Discovery, 2009. FSKD '09. Sixth International Conference on  (Volume:1 )

Date of Conference:

14-16 Aug. 2009

Need Help?


IEEE Advancing Technology for Humanity About IEEE Xplore | Contact | Help | Terms of Use | Nondiscrimination Policy | Site Map | Privacy & Opting Out of Cookies

A not-for-profit organization, IEEE is the world's largest professional association for the advancement of technology.
© Copyright 2014 IEEE - All rights reserved. Use of this web site signifies your agreement to the terms and conditions.