Journal Article10.1007/S10107-010-0387-1
Minmax-distance approximation and separation problems: geometrical properties
Frank Plastria,Emilio Carrizosa +1 more
8
TL;DR: It is shown that a center hyperplane exists which is at (equal) maximum distance from at least d + 1 points of A, and it follows that solving such global optimization problems reduces to inspecting a finite set of candidate solutions.
read more
Abstract: A center hyperplane in the d-dimensional space minimizes the maximum of its distances from a finite set of points A with respect to possibly different gauges. In this note it is shown that a center hyperplane exists which is at (equal) maximum distance from at least d + 1 points of A. Moreover the projections of the points among these which lie above the center hyperplane cannot be separated by another hyperplane from the projections of those that are below it. When all gauges involved are smooth, all center hyperplanes satisfy these properties. This geometric property allows us to improve and generalize previously existing results, which were only known for the case in which all distances are measured using a common norm. The results also extend to the constrained case where for some points it is prespecified on which side of the hyperplane (above, below or on) they must lie. In this case the number of points lying on the hyperplane plus those at maximum distance is at least d + 1. It follows that solving such global optimization problems reduces to inspecting a finite set of candidate solutions. Extensions of these results to a separation problem are outlined.
read more
Chat with Paper
AI Agents for this Paper
Find similar papers on Google Scholar, PubMed and Arxiv
Write a critical review of this paper
Analyze citations of this paper to find unaddressed research gaps
Citations
Cost-sensitive Feature Selection for Support Vector Machines
TL;DR: A mathematical-optimization-based Feature Selection procedure embedded in one of the most popular classification procedures, namely, Support Vector Machines, accommodating asymmetric misclassification costs is proposed, to replace the traditional margin maximization by minimizing the number of features selected, but imposing upper bounds on the false positive and negative rates.
52
Locating Objects in the Plane Using Global Optimization Techniques
Pierre Hansen,Rafael Blanquero,Emilio Carrizosa +2 more
- 01 Sep 2009
TL;DR: This work addresses the problem of locating objects in the plane such as segments, arcs of circumferences, arbitrary convex sets, their complements or their boundaries, and yields a global optimization problem, whose resolution is dealt with using difference of convex (DC) techniques.
16
Mathematical optimization modelling for group counterfactual explanations
Emilio Carrizosa,Jasone Ramírez-Ayerbe,Dolores Romero Morales +2 more
TL;DR: This paper introduces mathematical optimization models for group counterfactual explanations in Explainable Artificial Intelligence, addressing the challenge of allocating multiple counterfactuals to a group of instances, and identifies research challenges for the Operations Research community.
16
Location of Dimensional Facilities in a Continuous Space
TL;DR: In many cases, the facilities to be located cannot be represented by isolated points, but may be modeled as dimensional structures as mentioned in this paper, such as lines and circles in the plane and hyperplanes and hyperspheres in higher dimensional spaces.
15
•Dissertation
Algorithms and Concepts for Robust Optimization
Marc Goerigk,Paul Scheidt +1 more
- 14 Jan 2013
TL;DR: The software library ROPI is presented as a framework for robust optimization with support for most established mixed-integer programming solvers with both theoretical and algorithmic aspects.
References
Support-Vector Networks
Corinna Cortes,Vladimir Vapnik +1 more
TL;DR: High generalization ability of support-vector networks utilizing polynomial input transformations is demonstrated and the performance of the support- vector network is compared to various classical learning algorithms that all took part in a benchmark study of Optical Character Recognition.
Statistical learning theory
Vladimir Vapnik
- 01 Jan 1998
TL;DR: Presenting a method for determining the necessary and sufficient conditions for consistency of learning process, the author covers function estimates from small data pools, applying these estimations to real-life problems, and much more.
30.4K
A Tutorial on Support Vector Machines for Pattern Recognition
TL;DR: There are several arguments which support the observed high accuracy of SVMs, which are reviewed and numerous examples and proofs of most of the key theorems are given.
Principles of neurodynamics. perceptrons and the theory of brain mechanisms
TL;DR: The background, basic sources of data, concepts, and methodology to be employed in the study of perceptrons are reviewed, and some of the notation to be used in later sections are presented.
2.5K
Principles of Neurodynamics. Perceptrons and the Theory of Brain Mechanisms.
TL;DR: This formidable book has offered a somewhat different program involving the design and testing of brain models described as perceptrons, concerned not with devices for artificial intelligence, but, rather, with "the physical structures and neurodynamics principles which underly "natural intelligence.
939