In this paper a new algorithm for multi-class classification is presented. The algorithm, that is named Vertex Feature Classification (VFC), maps input data sets into an ad-hoc built space, called "simplex space" in order to perform geometric classification. More precisely, each class is first associated to a specific vertex of the polytope computed in the feature space. Successively, pattern classification is performed according to the geometric arrangement of patterns in a higher dimensional feature space. The experimental results, carried out on datasets of the UCI Machine Learning Repository, demonstrate the accuracy of the new algorithm is comparable with KNN, VDA and SVM, without or with a little training phase. An important aspect of this algorithm is its training time, which takes often a few milliseconds. Furthermore, the algorithm is robust and computationally efficient.

Vertex Feature Classification (VFC)

Massaro A
2020-01-01

Abstract

In this paper a new algorithm for multi-class classification is presented. The algorithm, that is named Vertex Feature Classification (VFC), maps input data sets into an ad-hoc built space, called "simplex space" in order to perform geometric classification. More precisely, each class is first associated to a specific vertex of the polytope computed in the feature space. Successively, pattern classification is performed according to the geometric arrangement of patterns in a higher dimensional feature space. The experimental results, carried out on datasets of the UCI Machine Learning Repository, demonstrate the accuracy of the new algorithm is comparable with KNN, VDA and SVM, without or with a little training phase. An important aspect of this algorithm is its training time, which takes often a few milliseconds. Furthermore, the algorithm is robust and computationally efficient.
2020
KNN
multi-class classification
SVM
File in questo prodotto:
Non ci sono file associati a questo prodotto.

I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.

Utilizza questo identificativo per citare o creare un link a questo documento: https://hdl.handle.net/20.500.12572/18306
Citazioni
  • ???jsp.display-item.citation.pmc??? ND
social impact