Title
An approach to growth delimitation of straight line segment classifiers based on a minimum bounding box
Date Issued
01 November 2021
Access level
open access
Resource Type
journal article
Publisher(s)
MDPI
Abstract
Several supervised machine learning algorithms focused on binary classification for solving daily problems can be found in the literature. The straight-line segment classifier stands out for its low complexity and competitiveness, compared to well-knownconventional classifiers. This binary classifier is based on distances between points and two labeled sets of straight-line segments. Its training phase consists of finding the placement of labeled straight-line segment extremities (and consequently, their lengths) which gives the minimum mean square error. However, during the training phase, the straight-line segment lengths can grow significantly, giving a negative impact on the classification rate. Therefore, this paper proposes an approach for adjusting the placements of labeled straight-line segment extremities to build reliable classifiers in a constrained search space (tuned by a scale factor parameter) in order to restrict their lengths. Ten artificial and eight datasets from the UCI Machine Learning Repository were used to prove that our approach shows promising results, compared to other classifiers. We conclude that this classifier can be used in industry for decision-making problems, due to the straightforward interpretation and classification rates.
Volume
23
Issue
11
Language
English
OCDE Knowledge area
Ciencias de la computación
Subjects
Scopus EID
2-s2.0-85119972066
Source
Entropy
ISSN of the container
10994300
Sponsor(s)
Fundação de Amparo à Pesquisa do Estado de São Paulo
Sources of information:
Directorio de Producción Científica
Scopus