2014
Impedovo, Sebastiano; Liu, Cheng-Lin; Impedovo, Donato; Pirlo, Giuseppe; Read, Jesse; Martino, Luca; Luengo, David
Efficient Monte Carlo Methods for Multi-Dimensional Learning with Classifier Chains Artículo de revista
En: Pattern Recognition, vol. 47, no 3, pp. 1535–1546, 2014.
Resumen | Enlaces | BibTeX | Etiquetas: Bayesian inference, Classifier chains, Monte Carlo methods, Multi-dimensional classification, Multi-label classification
@article{Impedovo2014b,
title = {Efficient Monte Carlo Methods for Multi-Dimensional Learning with Classifier Chains},
author = {Sebastiano Impedovo and Cheng-Lin Liu and Donato Impedovo and Giuseppe Pirlo and Jesse Read and Luca Martino and David Luengo},
url = {http://www.sciencedirect.com/science/article/pii/S0031320313004160},
year = {2014},
date = {2014-01-01},
journal = {Pattern Recognition},
volume = {47},
number = {3},
pages = {1535--1546},
abstract = {Multi-dimensional classification (MDC) is the supervised learning problem where an instance is associated with multiple classes, rather than with a single class, as in traditional classification problems. Since these classes are often strongly correlated, modeling the dependencies between them allows MDC methods to improve their performance \textendash at the expense of an increased computational cost. In this paper we focus on the classifier chains (CC) approach for modeling dependencies, one of the most popular and highest-performing methods for multi-label classification (MLC), a particular case of MDC which involves only binary classes (i.e., labels). The original CC algorithm makes a greedy approximation, and is fast but tends to propagate errors along the chain. Here we present novel Monte Carlo schemes, both for finding a good chain sequence and performing efficient inference. Our algorithms remain tractable for high-dimensional data sets and obtain the best predictive performance across several real data sets.},
keywords = {Bayesian inference, Classifier chains, Monte Carlo methods, Multi-dimensional classification, Multi-label classification},
pubstate = {published},
tppubtype = {article}
}
Multi-dimensional classification (MDC) is the supervised learning problem where an instance is associated with multiple classes, rather than with a single class, as in traditional classification problems. Since these classes are often strongly correlated, modeling the dependencies between them allows MDC methods to improve their performance – at the expense of an increased computational cost. In this paper we focus on the classifier chains (CC) approach for modeling dependencies, one of the most popular and highest-performing methods for multi-label classification (MLC), a particular case of MDC which involves only binary classes (i.e., labels). The original CC algorithm makes a greedy approximation, and is fast but tends to propagate errors along the chain. Here we present novel Monte Carlo schemes, both for finding a good chain sequence and performing efficient inference. Our algorithms remain tractable for high-dimensional data sets and obtain the best predictive performance across several real data sets.
Read, Jesse; Bielza, Concha; Larranaga, Pedro
Multi-Dimensional Classification with Super-Classes Artículo de revista
En: IEEE Transactions on Knowledge and Data Engineering, vol. 26, no 7, pp. 1720–1733, 2014, ISSN: 1041-4347.
Resumen | Enlaces | BibTeX | Etiquetas: Accuracy, Bayes methods, Classification, COMPRHENSION, conditional dependence, Context, core goals, data instance, evaluation metrics, Integrated circuit modeling, modeling class dependencies, multi-dimensional, Multi-dimensional classification, multidimensional classification problem, multidimensional datasets, multidimensional learners, multilabel classification, multilabel research, multiple class variables, ordinary class, pattern classification, problem transformation, recently-popularized task, super classes, super-class partitions, tractable running time, Training, Vectors
@article{Read2014bb,
title = {Multi-Dimensional Classification with Super-Classes},
author = {Jesse Read and Concha Bielza and Pedro Larranaga},
url = {http://ieeexplore.ieee.org/articleDetails.jsp?arnumber=6648319},
issn = {1041-4347},
year = {2014},
date = {2014-01-01},
journal = {IEEE Transactions on Knowledge and Data Engineering},
volume = {26},
number = {7},
pages = {1720--1733},
publisher = {IEEE},
abstract = {The multi-dimensional classification problem is a generalisation of the recently-popularised task of multi-label classification, where each data instance is associated with multiple class variables. There has been relatively little research carried out specific to multi-dimensional classification and, although one of the core goals is similar (modelling dependencies among classes), there are important differences; namely a higher number of possible classifications. In this paper we present method for multi-dimensional classification, drawing from the most relevant multi-label research, and combining it with important novel developments. Using a fast method to model the conditional dependence between class variables, we form super-class partitions and use them to build multi-dimensional learners, learning each super-class as an ordinary class, and thus explicitly modelling class dependencies. Additionally, we present a mechanism to deal with the many class values inherent to super-classes, and thus make learning efficient. To investigate the effectiveness of this approach we carry out an empirical evaluation on a range of multi-dimensional datasets, under different evaluation metrics, and in comparison with high-performing existing multi-dimensional approaches from the literature. Analysis of results shows that our approach offers important performance gains over competing methods, while also exhibiting tractable running time.},
keywords = {Accuracy, Bayes methods, Classification, COMPRHENSION, conditional dependence, Context, core goals, data instance, evaluation metrics, Integrated circuit modeling, modeling class dependencies, multi-dimensional, Multi-dimensional classification, multidimensional classification problem, multidimensional datasets, multidimensional learners, multilabel classification, multilabel research, multiple class variables, ordinary class, pattern classification, problem transformation, recently-popularized task, super classes, super-class partitions, tractable running time, Training, Vectors},
pubstate = {published},
tppubtype = {article}
}
The multi-dimensional classification problem is a generalisation of the recently-popularised task of multi-label classification, where each data instance is associated with multiple class variables. There has been relatively little research carried out specific to multi-dimensional classification and, although one of the core goals is similar (modelling dependencies among classes), there are important differences; namely a higher number of possible classifications. In this paper we present method for multi-dimensional classification, drawing from the most relevant multi-label research, and combining it with important novel developments. Using a fast method to model the conditional dependence between class variables, we form super-class partitions and use them to build multi-dimensional learners, learning each super-class as an ordinary class, and thus explicitly modelling class dependencies. Additionally, we present a mechanism to deal with the many class values inherent to super-classes, and thus make learning efficient. To investigate the effectiveness of this approach we carry out an empirical evaluation on a range of multi-dimensional datasets, under different evaluation metrics, and in comparison with high-performing existing multi-dimensional approaches from the literature. Analysis of results shows that our approach offers important performance gains over competing methods, while also exhibiting tractable running time.