Buscar
Mostrando ítems 1-6 de 6
Artículo
Minmax-distance approximation and separation problems: geometrical properties
(Springer, 2010-04-01)
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 ...
Artículo
Alternating local search based VNS for linear classification
(Springer, 2010-02)
We consider the linear classification method consisting of separating two sets of points in d-space by a hyperplane. We wish to determine the hyperplane which minimises the sum of distances from all misclassified points ...
Artículo
Locating a semi-obnoxious covering facility with repelling polygonal regions
(ELSEVIER SCIENCE BV, 2013-11-01)
A facility is to be located in the Euclidean plane to serve certain sites by covering them closely. Simultaneously, a set of polygonal areas must be protected from the negative effects from that facility. The problem is ...
Artículo
Single-facility huff location problems on networks
(Springer, 2013-09-17)
Huff location problems have been extensively analyzed within the field of competitive continuous location. In this work, two Huff location models on networks are addressed, by considering that users go directly to the ...
Artículo
Multi-instance classification through spherical separation and VNS
(PERGAMON-ELSEVIER SCIENCE LTD, 2013-05-17)
A two-class classification problem is considered where the objects to be classified are bags of instances in d-space. The classification rule is defined in terms of an open d-ball. A bag is labeled positive if it meets the ...
Artículo
Linear separation and approximation by minimizing the sum of concave functions of distances
(Springer, 2014-03-01)
One recently proposed criterion to separate two data sets in Classification is to use a hyperplane that minimizes the sum of distances to it from all the misclassified data points, where misclassification means lying on ...