By Topic

Bisecting data partitioning methods for Min-Max Modular Support Vector Machine

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

2 Author(s)
Xiao-Min Xie ; Coll. of Comput., Nanjing Univ. of Posts & Telecommun., Nanjing, China ; Yun Li

Min-Max Modular Support Vector Machines (M3-SVM) is a well-known ensemble learning method. One of key problems for M3-SVM is to find a quick and effective method for data partition. This paper presents a new data partitioning method-BEK, which is based on the Bisecting K-means clustering with equalization function. BEK generally can get global optimal solution with low time complexity, and more importantly, it can obtain the relatively balanced partitions, which are very important for M3-SVM to deal with huge data. Experimental results on real-world data sets show that this bisecting partitioning method can effectively improve the classification performance of M3-SVM without increasing its time cost.

Published in:

Fuzzy Systems and Knowledge Discovery (FSKD), 2011 Eighth International Conference on  (Volume:2 )

Date of Conference:

26-28 July 2011