Machine learning algorithm based on convex hull analysis

In this paper machine learning methods for automatic classification problems using computational geometry are considered. Classes are defined with convex hulls of points sets in a multidimensional feature space. Classification algorithms based on the estimation of the proximity of the test point to...

Full description

Saved in:
Bibliographic Details
Published in:Procedia computer science 2021, Vol.186, p.381-386
Main Authors: Nemirko, A.P., Dulá, J.H.
Format: Article
Language:English
Subjects:
automatic medical diagnostics
computational geometry
Intelligent systems
linear programming
nearest convex hull classification
pattern recognition
Citations: Items that this one cites
Items that cite this one
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:In this paper machine learning methods for automatic classification problems using computational geometry are considered. Classes are defined with convex hulls of points sets in a multidimensional feature space. Classification algorithms based on the estimation of the proximity of the test point to convex class shells are considered. Several ways of such estimation are suggested when the test point is located both outside the convex hull and inside it. A new method for estimating proximity based on linear programming is proposed, and the corresponding nearest convex hull classifier is described. The results of experimental studies on the real medical diagnostics problem are presented. An efficiency comparison of the proposed classifier and other types of classifiers, both based on convex hull analysis and not, has shown the high efficiency of the proposed method for estimating proximity based on linear programming.
ISSN:1877-0509
1877-0509
DOI:10.1016/j.procs.2021.04.160