Cookies Policy
We use cookies to improve our site and your experience. By continuing to browse our site you accept our cookie policy. Find out More
Close
  • Menu
Interest
Topics
Details

Details

002
Publications

2018

Metalearning and Recommender Systems: A literature review and empirical study on the algorithm selection problem for Collaborative Filtering

Authors
Cunha, T; Soares, C; de Carvalho, ACPLF;

Publication
INFORMATION SCIENCES

Abstract
The 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.

2018

Preference rules for label ranking: Mining patterns in multi-target relations

Authors
de Sa, CR; Azevedo, P; Soares, C; Jorge, AM; Knobbe, A;

Publication
INFORMATION FUSION

Abstract
In this paper, we investigate two variants of association rules for preference data, Label Ranking Association Rules and Pairwise Association Rules. Label Ranking Association Rules (LRAR) are the equivalent of Class Association Rules (CAR) for the Label Ranking task. In CAR, the consequent is a single class, to which the example is expected to belong to. In LRAR, the consequent is a ranking of the labels. The generation of LRAR requires special support and confidence measures to assess the similarity of rankings. In this work, we carry out a sensitivity analysis of these similarity-based measures. We want to understand which datasets benefit more from such measures and which parameters have more influence in the accuracy of the model. Furthermore, we propose an alternative type of rules, the Pairwise Association Rules (PAR), which are defined as association rules with a set of pairwise preferences in the consequent. While PAR can be used both as descriptive and predictive models, they are essentially descriptive models. Experimental results show the potential of both approaches.

2018

Using metalearning for parameter tuning in neural networks

Authors
Felix, C; Soares, C; Jorge, A; Ferreira, H;

Publication
Lecture Notes in Computational Vision and Biomechanics

Abstract
Neural 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.

2018

A label ranking approach for selecting rankings of collaborative filtering algorithms

Authors
Cunha, T; Soares, C; de Carvalho, ACPLF;

Publication
Proceedings of the 33rd Annual ACM Symposium on Applied Computing, SAC 2018, Pau, France, April 09-13, 2018

Abstract
The large amount of Recommender System algorithms makes the selection of the most suitable algorithm for a new dataset a difficult task. Metalearning has been successfully used to deal with this problem. It works by mapping dataset characteristics with the predictive performance obtained by a set of algorithms. The models built on this data are capable of predicting the best algorithm for a new dataset. However, typical approaches try only to predict the best algorithm, overlooking the performance of others. This study focus on the use of Metalearning to select the best ranking of CF algorithms for a new recommendation dataset. The contribution lies in the formalization and experimental validation of using Label Ranking to select a ranked list of algorithms. The experimental procedure proves the superior performance of the proposed approach regarding both ranking accuracy and impact on the baselevel performance. Furthermore, it draws and compares the knowledge regarding metafeature importance for both classification and Label Ranking tasks in order to provide guidelines for the design of algorithms in the Recommender System community. © Copyright held by the owner/author(s).

2018

Discovering a taste for the unusual: exceptional models for preference mining

Authors
de Sa, CR; Duivesteijn, W; Azevedo, P; Jorge, AM; Soares, C; Knobbe, A;

Publication
Machine Learning

Abstract
Exceptional preferences mining (EPM) is a crossover between two subfields of data mining: local pattern mining and preference learning. EPM can be seen as a local pattern mining task that finds subsets of observations where some preference relations between labels significantly deviate from the norm. It is a variant of subgroup discovery, with rankings of labels as the target concept. We employ several quality measures that highlight subgroups featuring exceptional preferences, where the focus of what constitutes ‘exceptional’ varies with the quality measure: two measures look for exceptional overall ranking behavior, one measure indicates whether a particular label stands out from the rest, and a fourth measure highlights subgroups with unusual pairwise label ranking behavior. We explore a few datasets and compare with existing techniques. The results confirm that the new task EPM can deliver interesting knowledge. © 2018 The Author(s)

Supervised
thesis

2017

Entity Retrieval and Text Mining for Online Reputation Monitoring

Author
Pedro dos Santos Saleiro da Cruz

Institution
UP-FEUP

2017

Sequence Mining Analysis on Shopping Data

Author
João Miguel da Rocha Ribeiro

Institution
UP-FEUP

2017

Predicting the rankings of financial analysts using machine learning methods.

Author
Artur Aleksandrovich Aiguzhinov

Institution
UP-FEUP

2017

Automatic Recommendation of Machine Learning Workflows

Author
Miguel Alexandre Viana Cachada

Institution
UP-FEP

2017

Leveraging Metalearning for Bagging Classifiers

Author
Fábio Hernâni dos Santos Costa Pinto

Institution
UP-FEUP