Skip to main content

GESTION EFICIENTE DEL CONSUMO ELECTRICO MEDIANTE LA CLASIFICACION, PREDICCION Y AGRUPAMIENTO DE SERIES TEMPORALES

TIN2017-82626-R

•
Funding agency name Agencia Estatal de Investigación
Funding agency acronym AEI
Program Programa Estatal de I+D+i Orientado a los Retos de la Sociedad
Call Proyectos I+D+i Retos de Investigación
Call year 2017
State Plan 2017-2020 Plan Estatal de Investigación Científica y Técnica y de Innovación
Beneficiary centre ASOC BCAM - BASQUE CENTER FOR APPLIED MATHEMATICS

Resultados relacionados

Resultados totales (Incluyendo duplicados): 9
Encontrada(s) 1 página(s)

BIRD. BCAM's Institutional Repository Data
Publication Contribución de congreso (ConferenceOutput)

Are the artificially generated instances uniform in terms of difficulty?

  • Pérez, A.
  • Ceberio, J.
  • Lozano, J.A.
In the field of evolutionary computation, it is usual to generate artificial benchmarks of instances that are used as a test-bed to determine the performance of the algorithms at hand. In this context, a recent work on permutation problems analyzed the implications of generating instances uniformly at random (u.a.r.) when building those benchmarks. Particularly, the authors analyzed instances as rankings of the solutions of the search space sorted according to their objective function value. Thus, two instances are considered equivalent when their objective functions induce the same ranking over the search space. Based on the analysis, they suggested that, when some restrictions hold, the probability to create easy rankings is higher than creating difficult ones. In this paper, we continue on that research line by adopting the framework of local search algorithms with the best improvement criterion. Particularly, we empirically analyze, in terms of difficulty, the instances (rankings) created u.a.r. of three popular problems: Linear Ordering Problem, Quadratic Assignment Problem and Flowshop Scheduling Problem. As the neighborhood system is critical for the performance of local search algorithms three different neighborhood systems have been considered: swap, interchange and insert. Conducted experiments reveal that (1) by sampling the parameters uniformly at random we obtain instances with a non-uniform distribution in terms of difficulty, (2) the distribution of the difficulty strongly depends on the pair problem-neighborhood considered, and (3) given a problem, the distribution of the difficulty seems to depend on the smoothness of the landscape induced by the neighborhood and on its size., Research Groups 2013-2018 (IT-609-13) TIN2016-78365-R(Spanish Ministry of Economy, Industry and Competitiveness)
BIRD. BCAM's Institutional Repository Data
Publication Contribución de congreso (ConferenceOutput)

Optimal multi-impulse space rendezvous considering limited impulse using a discretized Lambert problem combined with evolutionary algorithms

  • Shirazi, A.
  • Ceberio, J.
  • Lozano, J.A.
In this paper, a direct approach is presented to tackle the multi-impulse rendezvous problem considering the impulse limit. Particularly, the standard Lambert problem is extended toward several consequential orbit transfers for the rendezvous problem. A number of different evolutionary algorithms are taken into consideration. It is shown that the proposed approach can lead to the optimal multi-impulse transfer maneuver that has the minimum amount of fuel similar to the traditional two-impulse transfer without violating the impulse limitation. Results also indicate that the approach is efficient even when the number of stages increases due to lower impulse limitations.
BIRD. BCAM's Institutional Repository Data
Publication Contribución de congreso (ConferenceOutput)

Sentiment analysis with genetically evolved Gaussian kernels

  • Roman, I.
  • Santana, R.
  • Mendiburu, A.
  • Lozano, J.A.
Sentiment analysis consists of evaluating opinions or statements based on text analysis. Among the methods used to estimate the degree to which a text expresses a certain sentiment are those based on Gaussian Processes. However, traditional Gaussian Processes methods use a prede- fined kernels with hyperparameters that can be tuned but whose structure can not be adapted. In this paper, we propose the application of Genetic Programming for the evolution of Gaussian Process kernels that are more precise for sentiment analysis. We use use a very flexible representation of kernels combined with a multi-objective approach that considers si- multaneously two quality metrics and the computational time required to evaluate those kernels. Our results show that the algorithm can outper- form Gaussian Processes with traditional kernels for some of the sentiment analysis tasks considered.
BIRD. BCAM's Institutional Repository Data
Publication Contribución de congreso (ConferenceOutput)

Approaching the Quadratic Assignment Problem with Kernels of Mallows Models under the Hamming Distance

  • Arza, E.
  • Ceberio, J.
  • Pérez, A.
  • Irurozki, E.
The Quadratic Assignment Problem (QAP) is a specially challenging permutation-based np-hard combinatorial optimization problem, since instances of size $n>40$ are seldom solved using exact methods. In this sense, many approximate methods have been published to tackle this problem, including Estimation of Distribution Algorithms (EDAs). In particular, EDAs have been used to solve permutation problems by introducing distance based exponential models, such as the Mallows Models. In this paper we approximate the QAP with a Hamming distance based kernels of Mallows Models. Based on the benchmark instances, we have observed that our approach is competitive, reaching the best-known solution in $71\%$ of the tested instances, especially on large instances ($n>125$), where it is able to outperform state of the art results in 43 out of 288 instances., TIN2016-78365-R SVP-2014-068574 SEV-2013-0323
BIRD. BCAM's Institutional Repository Data
Publication Contribución de congreso (ConferenceOutput)

An adaptive neuroevolution-based hyperheuristic

  • Arza, E.
  • Ceberio, J.
  • Pérez, A.
  • Irurozki, E.
According to the No-Free-Lunch theorem, an algorithm that performs efficiently on any type of problem does not exist. In this sense, algorithms that exploit problem-specific knowledge usually outperform more generic approaches, at the cost of a more complex design and parameter tuning process. Trying to combine the best of both worlds, the field of hyperheuristics investigates the automatized generation and hybridization of heuristic algorithms. In this paper, we propose a neuroevolution-based hyperheuristic approach. Particularly, we develop a population-based hyperheuristic algorithm that first trains a neural network on an instance of a problem and then uses the trained neural network to control how and which low-level operators are applied to each of the solutions when optimizing different problem instances. The trained neural network maps the state of the optimization process to the operations to be applied to the solutions in the population at each generation., TIN2016-78365R BERC 2014-2017 Research Groups 2013-2018 (IT-609-13).
BIRD. BCAM's Institutional Repository Data
Publication Contribución de congreso (ConferenceOutput)

General supervision via probabilistic transformations

  • Mazuelas, S.
  • Pérez, A.
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 paper presents a unifying framework for supervised classification with general ensembles of training samples, and proposes the learning methodology of generalized robust risk minimization (GRRM). The paper shows how current and novel supervision schemes can be addressed under the proposed framework by representing the relationship between examples at prediction and training via probabilistic transformations. The results show that GRRM can handle different types of training samples in a unified manner, and enable new supervision schemes that aggregate general ensembles of training samples., RYC-2016-19383
BIRD. BCAM's Institutional Repository Data
Publication Contribución de congreso (ConferenceOutput)

Minimax Classification with 0-1 Loss and Performance Guarantees

  • Mazuelas, S.
  • Zanoni, A.
  • Pérez, A.
Supervised classification techniques use training samples to find classification rules with small expected 0-1 loss. Conventional methods achieve efficient learning and out-of-sample generalization by minimizing surrogate losses over specific families of rules. This paper presents minimax risk classifiers (MRCs) that do not rely on a choice of surrogate loss and family of rules. MRCs achieve efficient learning and out-of-sample generalization by minimizing worst-case expected 0-1 loss w.r.t. uncertainty sets that are defined by linear constraints and include the true underlying distribution. In addition, MRCs’ learning stage provides performance guarantees as lower and upper tight bounds for expected 0-1 loss. We also present MRCs’ finite-sample generalization bounds in terms of training size and smallest minimax risk, and show their competitive classification performance w.r.t. state-of-the-art techniques using benchmark datasets., Ramon y Cajal Grant RYC-2016-19383
BIRD. BCAM's Institutional Repository Data
Publication Contribución de congreso (ConferenceOutput)

Rank aggregation for non-stationary data streams

  • Irurozki, E.
  • Pérez, A.
  • Lobo, J.L.
  • Del Ser, J.
The problem of learning over non-stationary ranking streams arises naturally, particularly in recommender systems. The rankings represent the preferences of a population, and the non-stationarity means that the distribution of preferences changes over time. We propose an algorithm that learns the current distribution of ranking in an online manner. The bottleneck of this process is a rank aggregation problem. We propose a generalization of the Borda algorithm for non-stationary ranking streams. As a main result, we bound the minimum number of samples required to output the ground truth with high probability. Besides, we show how the optimal parameters are set. Then, we generalize the whole family of weighted voting rules (the family to which Borda belongs) to situations in which some rankings are more reliable than others. We show that, under mild assumptions, this generalization can solve the problem of rank aggregation over non-stationary data streams.
DIGITAL.CSIC. Repositorio Institucional del CSIC
Publication Contribución de congreso (ConferenceOutput)

Approximating the maximum weighted decomposable graph problem with applications to probabilistic graphical models

  • Pérez, Aritz
  • Blum, Christian
  • Lozano, Jose A.
Trabajo presentado en International Conference on Probabilistic Graphical Models (PGM 2018), celebrada en Praga (República Checa), del 11 al 14 de septiembre de2018, In this work we deal with the problem of learning a maximum weighted (k+1)-order decomposable graph coarser than a given maximal k-order decomposable graph (also known as hypertree of treewidth k − 1). An Integer Linear Programming formulation for the problem has recently been proposed and used in order to solve instances of the problem with a moderate number of vertices. However, as the problem is known to be NP-hard, it is of practical interest to develop approximate algorithms able to work with a limited amount of computational resources. In this paper we propose an approximate Integer Linear Programming formulation for the problem using a threshold distance which discards the edges that, on average, have a low probability of being contained in the solution. Experiments have been carried out with weighted graphs and probabilistic graphical models. Using the proposed formulation we have obtained results close to the optimum, even when most of the candidate edges were discarded using the distance criterion. The obtained good results indicate that the approximate formulation has important applications for learning probabilistic graphical models using decomposable scores, e.g., BDe, This work has been partially supported by the Basque Government through the BERC 2014-2017 and the ELKARTEK programs, and by the Spanish Ministry of Economy and Competitiveness MINECO: BCAM Severo Ochoa excellence accreditation SVP-2014-068574 and SEV-2013-0323, and through the project TIN2017-82626-R funded by (AEI/FEDER, UE)., Peer reviewed