INESC TEC Repository
Not a member yet
2130 research outputs found
Sort by
A computational study of the general lot-sizing and scheduling model under demand uncertainty via robust and stochastic approaches
No full textThis paper presents an empirical assessment of the General Lot-Sizing and Scheduling Problem (GLSP) under demand uncertainty by means of a budget-uncertainty set robust optimization and a two-stage stochastic programming with recourse model. We have also developed a systematic procedure based on Monte Carlo simulation to compare both models in terms of protection against uncertainty and computational tractability. The extensive computational experiments cover different instances characteristics, a considerable number of combinations between budgets of uncertainty and variability levels for the robust optimization model, as well as an increasing number of scenarios and probability distribution functions for the stochastic programming model. Furthermore, we have devised some guidelines for decision-makers to evaluate a priori the most suitable uncertainty modeling approach according to their preferences
Metalearning and Recommender Systems: A literature review and empirical study on the algorithm selection problem for Collaborative Filtering
Get PDFThe problem of information overload motivated the appearance of Recommender Systems. From the several open problems in this area, the decision of which is the best recommendation algorithm for a specific problem is one of the most important and less studied. The current trend to solve this problem is the experimental evaluation of several recommendation algorithms in a handful of datasets. However, these studies require an extensive amount of computational resources, particularly processing time. To avoid these drawbacks, researchers have investigated the use of Metalearning to select the best recommendation algorithms in different scopes. Such studies allow to understand the relationships between data characteristics and the relative performance of recommendation algorithms, which can be used to select the best algorithm(s) for a new problem. The contributions of this study are two-fold: 1) to identify and discuss the key concepts of algorithm selection for recommendation algorithms via a systematic literature review and 2) to perform an experimental study on the Metalearning approaches reviewed in order to identify the most promising concepts for automatic selection of recommendation algorithms
Using metalearning for parameter tuning in neural networks
Get PDFNeural networks have been applied as a machine learning tool in many different areas. Recently, they have gained increased attention with what is now called deep learning. Neural networks algorithms have several parameters that need to be tuned in order to maximize performance. The definition of these parameters can be a difficult, extensive and time consuming task, even for expert users. One approach that has been successfully used for algorithm and parameter selection is metalearning. Metalearning consists in using machine learning algorithm on (meta)data from machine learning experiments to map the characteristics of the data with the performance of the algorithms. In this paper we study how a metalearning approach can be used to obtain a good set of parameters to learn a neural network for a given new dataset. Our results indicate that with metalearning we can successfully learn classifiers from past learning tasks that are able to define appropriate parameters. © 2018, Springer International Publishing AG
Examining social capital and individual motivators to explain the adoption of online citizen participation
Get PDF
Delta State replicated data types
Get PDFConflict-free Replicated Data Types (CRDTs) are distributed data types that make eventual consistency of a distributed object possible and non ad-hoc. Specifically, state-based CRDTs ensure convergence through disseminating the entire state, that may be large, and merging it to other replicas. We introduce Delta State Conflict-Free Replicated Data Types (delta-CRDT) that can achieve the best of both operation-based and state-based CRDTs: small messages with an incremental nature, as in operation-based CRDTs, disseminated over unreliable communication channels, as in traditional state-based CRDTs. This is achieved by defining delta-mutators to return a delta-state, typically with a much smaller size than the full state, that to be joined with both local and remote states. We introduce the delta-CRDT framework, and we explain it through establishing a correspondence to current state-based CRDTs. In addition, we present an anti-entropy algorithm for eventual convergence, and another one that ensures causal consistency. Finally, we introduce several delta-CRDT specifications of both well-known replicated datatypes and novel datatypes, including a generic map composition