By Topic

Optimize the Large Scale SVM Social Spam Detection Model via Bistratal Reduction Method

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)
Qin Xi ; Comput. Sci. Dept., Guangxi Univ., Nanning, China ; Su Yi-dan

Against the low efficiency of training on large-scale SVM, a reduction approach is proposed. This paper presents a new samples reduction method, called bistratal reduction method (BRM). BRM has two levels. The first level is coarse-grained reduction. It deletes the redundant clusters with KDC reduction. The second level is fine-grained reduction. It picks out the support vectors from the clusters remained and saves them as the final result set. In the traditional reduction method, the grain-size is single. There is still a contradiction between compression and accuracy, and can't be solved perfectly. Bistratal reduction method changes the reduced intensity according to the number of redundant points remained. The experiments show that bistratal reduction method gives a higher compression ratio and accuracy. Apply the new method to the large scale SVM social spam detection model. The detection model speed up obviously.

Published in:

E-Product E-Service and E-Entertainment (ICEEE), 2010 International Conference on

Date of Conference:

7-9 Nov. 2010