PSO-based method for SVM classification on skewed data sets

详细信息    查看全文

• 作者：Jair Cervantes^a ; ^{jcervantesc@uaemex.mx}Author Vitae ; Farid Garcia-Lamont^a ; ^{fglamont@gmail.com}Author Vitae ; Lisbeth Rodriguez^b ; ^{lisbethr08@gmail.com}Author Vitae ; Asdrú ; bal Ló ; pez^c ; ^{asdrubalchau@gmail.com}Author Vitae ; José ; Ruiz Castilla^a ; ^{jsergioruizc@gmail.com}Author Vitae ; Adrian Trueba^a ; ^{atruebae@hotmail.com}Author Vitae
• 关键词：Skew data sets ; SVM ; Hybrid algorithms
• 刊名：Neurocomputing
• 出版年：2017
• 出版时间：8 March 2017
• 年：2017
• 卷：228
• 期：Complete
• 页码：187-197
• 全文大小：864 K
• 卷排序：228

文摘

Over the last years, Support Vector Machines (SVMs) have become a successful approach in classification problems. However, the performance of SVMs is affected harshly by skewed data sets. An SVM learns a biased model that affects the performance of the classifier. Furthermore, SVMs are typically unsuccessful on data sets where the imbalanced ratio is very large. Lately, several techniques have been used to tackle this disadvantage by generating artificial instances. Artificial data instances attempt to add information to the minority class. However, the new instances could introduce noise and decrease the performance of the classifier. In this research, an alternative procedure is suggested, the algorithm finds systematically new instances, improving the performance of SVMs on skewed data sets. The proposed method starts obtaining the support vectors (SVs) from the skewed data set. These initial SVs are used to generate new instances and the PSO algorithm is used to evolve the artificial instances, eliminating noise instances. This research combines the best of optimization and classification techniques. To show the ability of the proposed method to improve the performance of SVMs on skewed data sets, we compare the performance of our method against some classical methods and show that our algorithm outperforms all of them on several data sets.