1 March 2014 in Pattern Recognition
1 October 2001 in Trends in Food Science & Technology
In this paper we advocate the application of Artificial Intelligence techniques to quality assessment of food products. Machine Learning algorithms can help us to: (a) extract operative human knowledge from a set of examples; (b) conclude interpretable rules for classifying samples regardless of the non-linearity of the human behaviour or process; and (c) help us to ascertain the degree of influence of each objective attribute of the assessed food on the final decision of an expert. We illustrate these topics with an example of how it is possible to clone the behaviour of bovine carcass classifiers, leading to possible further industrial applications.
1 February 2015 in Pattern Recognition
27 November 2016 in Limnology and Oceanography: Methods
In recent decades, the automatic study and analysis of plankton communities using imaging techniques has advanced significantly. The effectiveness of these automated systems appears to have improved, reaching acceptable levels of accuracy. However, plankton ecologists often find that classification systems do not work as well as expected when applied to new samples. This paper proposes a methodology to assess the efficacy of learned models which takes into account the fact that the data distribution (the plankton composition of the sample) can vary between the model building phase and the production phase. As opposed to most validation methods that consider the individual organism as the unit of validation, our approach uses a validation‐by‐sample, which is more appropriate when the objective is to estimate the abundance of different morphological groups. We argue that, in these cases, the base unit to correctly estimate the error is the sample, not the individual. Thus, model assessment processes require groups of samples with sufficient variability in order to provide precise error estimates.
1 March 2017 in Information Fusion
Our hypothesis: ensembles are well suited for problems with distribution changes.If those changes are characterizable, ensembles can be designed to tackle them.Idea: to generate different samples based on the expected distribution changes.Case study: we present ensembles versions of two binary quantification algorithms.Ensembles outperform original counterpart algorithms using trivial aggregation rules. Display Omitted Ensemble methods are widely applied to supervised learning tasks. Based on a simple strategy they often achieve good performance, especially when the single models comprising the ensemble are diverse. Diversity can be introduced into the ensemble by creating different training samples for each model. In that case, each model is trained with a data distribution that may be different from the original training set distribution. Following that idea, this paper analyzes the hypothesis that ensembles can be especially appropriate in problems that: (i) suffer from distribution changes, (ii) it is possible to characterize those changes beforehand. The idea consists in generating different training samples based on the expected distribution changes, and to train one model with each of them. As a case study, we shall focus on binary quantification problems, introducing ensembles versions for two well-known quantification algorithms. Experimental results show that these ensemble adaptations outperform the original counterpart algorithms, even when trivial aggregation rules are used.
30 September 2016 in Progress in Artificial Intelligence