An effective method to determine whether a point is within a convex hull and its generalized convex polyhedron classifier
From MaRDI portal
Publication:2225169
DOI10.1016/j.ins.2019.07.065zbMath1453.68154OpenAlexW2961603612WikidataQ127461820 ScholiaQ127461820MaRDI QIDQ2225169
Yujian Li, Qiangkui Leng, Shurui Wang, Yuping Qin
Publication date: 5 February 2021
Published in: Information Sciences (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ins.2019.07.065
pattern classificationconvex hullsupport vector machinepiecewise linear classifierconvex polyhedron learning
Classification and discrimination; cluster analysis (statistical aspects) (62H30) Computational aspects related to convexity (52B55) Learning and adaptive systems in artificial intelligence (68T05) Pattern recognition, speech recognition (68T10)
Related Items
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Clipping algorithms for solving the nearest point problem over reduced convex hulls
- Another efficient algorithm for convex hulls in two dimensions
- An optimal convex hull algorithm in any fixed dimension
- An iterative algorithm learning the maximal margin classifier.
- Alternating multiconlitron: a novel framework for piecewise linear classification
- Optimal output-sensitive convex hull algorithms in two and three dimensions
- Hierarchical mixing linear support vector machines for nonlinear classification
- Accurately learning from few examples with a polyhedral classifier
- A simple and fast multi-class piecewise linear pattern classifier
- An efficient algorithm for determining the convex hull of a finite planar set
- On the identification of the convex hull of a finite set of points in the plane
- Locally Trained Piecewise Linear Classifiers
- Finding the Point of a Polyhedron Closest to the Origin
- Max–min separability
- Polyhedral separability through successive LP
