Buscar
Mostrando ítems 11-20 de 61
Artículo
Heuristic approaches for support vector machines with the ramp loss
(Springer, 2014-03)
Recently, Support Vector Machines with the ramp loss (RLM) have attracted attention from the computational point of view. In this technical note, we propose two heuristics, the first one based on solving the continuous relaxation ...
Artículo
Visualization of complex dynamic datasets by means of mathematical optimization
(PERGAMON-ELSEVIER SCIENCE LTD, 2019-07-01)
In this paper we propose an optimization model and a solution approach to visualize datasets which are made up of individuals observed along different time periods. These individuals have attached a time-dependent magnitude ...
Artículo
Kernel Penalized K-means: A feature selection method based on Kernel K-means
(ELSEVIER SCIENCE BV, 2015-11-20)
We present an unsupervised method that selects the most relevant features using an embedded strategy while maintaining the cluster structure found with the initial feature set. It is based on the idea of simultaneously ...
Artículo
Solving the median problem with continuous demand on a network
(Springer, 2013-12)
Where to locate one or several facilities on a network so as to minimize the expected users-closest facility transportation cost is a problem well studied in the OR literature under the name of median problem. In the median ...
Artículo
On Extreme Concentrations in Chemical Reaction Networks with Incomplete Measurements
(ACS, 2016-11-09)
A fundamental problem in the analysis of chemical reactions networks consists of identifying concentration values along time or in steady state which are coherent with the experimental concentration data available. When ...
Artículo
Supervised classification and mathematical optimization
(Elsevier, 2013-01)
Data Mining techniques often ask for the resolution of optimization problems. Supervised Classification, and, in particular, Support Vector Machines, can be seen as a paradigmatic instance. In this paper, some links between ...
Artículo
A computational study of a nonlinear minsum facility location problem
(PERGAMON-ELSEVIER SCIENCE LTD, 2012-01-31)
A discrete location problem with nonlinear objective is addressed. A set of p plants is to be open to serve a given set of clients. Together with the locations, the number p of facilities is also a decision variable. The ...
Artículo
Locating a competitive facility in the plane with a robustness criterion
(Elsevier, 2011-11-16)
A new continuous location model is presented and embedded in the literature on robustness in facility location. The multimodality of the model is investigated, and a branch and bound method based on dc optimization is ...
Artículo
Variable neighborhood search for minimum sum-of-squares clustering on networks
(ELSEVIER SCIENCE BV, 2013-10-13)
Euclidean Minimum Sum-of-Squares Clustering amounts to finding p prototypes by minimizing the sum of the squared Euclidean distances from a set of points to their closest prototype. In recent years related clustering ...
Artículo
Maximizing upgrading and downgrading margins for ordinal regression
(Springer, 2011-12-01)
In ordinal regression, a score function and threshold values are sought to classify a set of objects into a set of ranked classes. Classifying an individual in a class with higher (respectively lower) rank than its actual ...