Machine Learning
Browse by
Recent Submissions

Mutual information based feature subset selection in multivariate time series classification
(Pattern Recognition, 2020)This paper deals with supervised classification of multivariate time se ries. In particular, the goal is to propose a filter method to select a subset of time series. Consequently, we adopt the framework proposed by Brown ... 
indepth analysis of SVM kernel learning and its components
(Neural Computing and Applications, 2020)The performance of support vector machines in nonlinearlyseparable classification problems strongly relies on the kernel function. Towards an automatic machine learning approach for this technique, many research outputs ... 
General supervision via probabilistic transformations
(Proceedings of the 24th European Conference on Artificial IntelligenceECAI, 20200801)Different types of training data have led to numerous schemes for supervised classification. Current learning techniques are tailored to one specific scheme and cannot handle general ensembles of training samples. This ... 
Application of machine learning techniques to weather forecasting
(20181024)Weather forecasting is, still today, a human based activity. Although computer simulations play a major role in modelling the state and evolution of the atmosphere, there is a lack of methodologies to automate the ... 
Theoretical and Methodological Advances in Semisupervised Learning and the ClassImbalance Problem
(20181130)his paper focuses on the theoretical and practical generalization of two known and challenging situations from the field of machine learning to classification problems in which the assumption of having a single binary class ... 
Kernels of Mallows Models under the Hamming Distance for solving the Quadratic Assignment Problem
(Swarm and Evolutionary Computation, 202007)The Quadratic Assignment Problem (QAP) is a wellknown permutationbased combinatorial optimization problem with real applications in industrial and logistics environments. Motivated by the challenge that this NPhard ... 
An adaptive neuroevolutionbased hyperheuristic
(The Genetic and Evolutionary Computation Conference, 2020)According to the NoFreeLunch theorem, an algorithm that performs efficiently on any type of problem does not exist. In this sense, algorithms that exploit problemspecific knowledge usually outperform more generic ... 
Evolving Gaussian Process Kernels for Translation Editing Effort Estimation
(Learning and Intelligent Optimization, 2019)In many Natural Language Processing problems the combination of machine learning and optimization techniques is essential. One of these problems is estimating the effort required to improve, under direct human supervision, ... 
Bayesian Optimization Approaches for Massively Multimodal Problems
(Learning and Intelligent Optimization, 2019)The optimization of massively multimodal functions is a challenging task, particularly for problems where the search space can lead the op timization process to local optima. While evolutionary algorithms have been ... 
Advances on Time Series Analysis using Elastic Measures of Similarity
(20200723)A sequence is a collection of data instances arranged in a structured manner. When this arrangement is held in the time domain, sequences are instead referred to as time series. As such, each observation in a time series ... 
Optimization of deep learning precipitation models using categorical binary metrics
(Journal of Advances in Modeling Earth Systems, 2020)This work introduces a methodology for optimizing neural network models using a combination of continuous and categorical binary indices in the context of precipitation forecasting. Probability of detection or false alarm ... 
An efficient Kmeans clustering algorithm for tall data
(DATA MINING AND KNOWLEDGE DISCOVERY, 2020)The analysis of continously larger datasets is a task of major importance in a wide variety of scientific fields. Therefore, the development of efficient and parallel algorithms to perform such an analysis is a a crucial ... 
Supervised nonparametric discretization based on Kernel density estimation
(Pattern Recognition Letters, 20191219)Nowadays, machine learning algorithms can be found in many applications where the classifiers play a key role. In this context, discretizing continuous attributes is a common step previous to classification tasks, the main ... 
Online Elastic Similarity Measures for time series
(Pattern Recognition, 201904)The way similarity is measured among time series is of paramount importance in many data mining and machine learning tasks. For instance, Elastic Similarity Measures are widely used to determine whether two time series are ... 
An Experimental Study in Adaptive Kernel Selection for Bayesian Optimization
(IEEE Access, 2019)Bayesian Optimization has been widely used along with Gaussian Processes for solving expensivetoevaluate blackbox optimization problems. Overall, this approach has shown good results, and particularly for parameter ... 
Hybrid Heuristics for the Linear Ordering Problem
(2019 IEEE Congress on Evolutionary Computation, CEC 2019  Proceedings, 2019)The linear ordering problem (LOP) is one of the classical NPHard combinatorial optimization problems. Motivated by the difficulty of solving it up to optimality, in recent decades a great number of heuristic and metaheuristic ... 
Soft information for localizationofthings
(Proceeding of the IEEE, 20191101)Location awareness is vital for emerging Internetof Things applications and opens a new era for Localizationof Things. This paper first reviews the classical localization techniques based on singlevalue metrics, such ... 
Data generation approaches for topic classification in multilingual spoken dialog systems
(ACM International Conference Proceeding Series, 2019)The conception of spokendialog systems (SDS) usually faces the problem of extending or adapting the system to multiple languages. This implies the creation of modules specically for the new languages, which is a time ... 
Anatomy of the attraction basins: Breaking with the intuition
(Evolutionary Computation, 2019)olving combinatorial optimization problems efficiently requires the development of algorithms that consider the specific properties of the problems. In this sense, local search algorithms are designed over a neighborhood ... 
Characterising the rankings produced by combinatorial optimisation problems and finding their intersections
(GECCO '19 Proceedings of the Genetic and Evolutionary Computation Conference, 2019)The aim of this paper is to introduce the concept of intersection between combinatorial optimisation problems. We take into account that most algorithms, in their machinery, do not consider the exact objective function ...