An evolutionary Pentagon Support Vector finder method

doi:10.1016/j.eswa.2020.113284

Return

An evolutionary Pentagon Support Vector finder method

2020-07-01

Seyed Muhammad Hossein Mousavi

Vincent Charles *

Tatiana Gherman

DOI：10.1016/j.eswa.2020.113284

Original

Save

View PDF

Abstract

En 中文

In dealing with big data, we need effective algorithms; effectiveness that depends, among others, on the ability to remove outliers from the data set, especially when dealing with classification problems. To this aim, support vector finder algorithms have been created to save just the most important data in the data pool. Nevertheless, existing classification algorithms, such as Fuzzy C-Means (FCM), suffer from the drawback of setting the initial cluster centers imprecisely. In this paper, we avoid existing shortcomings and aim to find and remove unnecessary data in order to speed up the final classification task without losing vital samples and without harming final accuracy; in this sense, we present a unique approach for finding support vectors, named evolutionary Pentagon Support Vector (PSV) finder method. The originality of the current research lies in using geometrical computations and evolutionary algorithms to make a more effective system, which has the advantage of higher accuracy on some data sets. The proposed method is subsequently tested with seven benchmark data sets and the results are compared to those obtained from performing classification on the original data (classification before and after PSV) under the same conditions. The testing returned promising results. (C) 2020 Elsevier Ltd. All rights reserved.

Keywords:

Big data

Data mining

Support vector

Artificial Bee Colony (ABC)

Evolutionary clustering

Fuzzy C means (FCM)

Pentagon Support Vector finder (PSV)

AI Summary

Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.