@article {781,
	title = {ClEnDAE: A classifier based on ensembles with built-in dimensionality reduction through denoising autoencoders},
	journal = {Information Sciences},
	volume = {565},
	year = {2021},
	note = {TIN2015-68454-R; PID2019-107793GB-I00 / AEI /10.13039/501100011033},
	pages = {146-176},
	abstract = {High dimensionality is an issue that affects most classification algorithms. This factor implies that the predictive performance of many traditional classifiers decreases considerably as the number of features increases. Therefore, there are numerous proposals that try to mitigate the effects of this issue. This study proposes ClEnDAE, a new classifier based on ensembles whose components incorporate denoising autoencoders (DAEs) to reduce the dimensionality of the input space. On the one hand, the use of ensembles improves the predictive performance by using several components that work jointly. On the other hand, the use of DAEs allows a new higher-level, smaller-sized feature space to be generated, reducing high dimensionality effects. Finally, an experimentation is conducted with the goal of evaluating the behavior of ClEnDAE. The first part of the test compares the performance of ClEnDAE to a model based on basic DAE and to the original untreated data. The second part analyzes the results of ClEnDAE and other traditional methods of dimensionality reduction in order to determine the improvement achieved with the proposed algorithm. In both parts of the experimentation, conclusions show that ClEnDAE offers better predictive performance than the other analyzed models. The main advantage of the ClEnDAE method is the combination of the potential of the ensemble-based methodology, where several components work in parallel, and DAEs, which generate new low-dimensional features that provide more relevant information. Therefore, the classification performance is better than with other classic proposals.},
	keywords = {classification, Deep learning, Denoising autoencoders, Dimensionality reduction, Ensembles feature fusion},
	doi = {https://doi.org/10.1016/j.ins.2021.02.060},
	author = {Pulgar, Francisco J. and Francisco Charte and A.J. Rivera-Rivas and M. J. del Jesus}
}
@article {774,
	title = {Choosing the proper autoencoder for feature fusion based on data complexity and classifiers: Analysis, tips and guidelines},
	journal = {Information Fusion},
	volume = {54},
	year = {2020},
	note = {TIN2015-68454-R},
	month = {02/2020},
	pages = {44-60},
	abstract = {Classifying data patterns is one of the most recurrent applications in machine learning. The number of input features influences the predictive performance of many classification models. Most classifiers work with high-dimensional spaces. Therefore, there is a great interest in facing the task of reducing the input space. Manifold learning has been shown to perform better than classical dimensionality reduction approaches, such as Principal Component Analysis and Linear Discriminant Analysis. In this sense, Autoencoders (AEs) provide an automated way of performing feature fusion, finding the best manifold to reconstruct the data. There are several models and architectures of AEs. For this reason, in this study an exhaustive analysis of the predictive performance of different AEs models with a large number of datasets is proposed, aiming to provide a set of useful guidelines. These will allow users to choose the appropriate AE model for each case, depending on data traits and the classifier to be used. A thorough empirical analysis is conducted including four AE models, four classification paradigms and a group of datasets with a variety of traits. A convenient set of rules to follow is obtained as a result.},
	keywords = {Autoencoders, classification, Deep learning, Dimensionality reduction, Feature fusion},
	doi = {https://doi.org/10.1016/j.inffus.2019.07.004},
	author = {Pulgar, Francisco J. and Francisco Charte and A.J. Rivera-Rivas and M. J. del Jesus}
}
@article {COUSO2016129,
	title = {Machine learning models, epistemic set-valued data and generalized loss functions: An encompassing approach},
	journal = {Information Sciences},
	volume = {358-359},
	year = {2016},
	pages = {129 - 150},
	abstract = {We study those problems where the goal is to find {\textquotedblleft}optimal{\textquotedblright} models with respect to some specific criterion, in regression and supervised classification problems. Alternatives to the usual expected loss minimization criterion are proposed, and a general framework where this criterion can be seen as a particular instance of a general family of criteria is provided. In the new setting, each model is formally identified with a random variable that associates a loss value to each individual in the population. Based on this identification, different stochastic orderings between random variables lead to different criteria to compare pairs of models. Our general setting encompasses the classical criterion based on the minimization of the expected loss, but also other criteria where a numerical loss function is not available, and therefore the computation of its expectation does not make sense. The presentation of the new framework is divided into two stages. First, we consider the new framework under standard situations about the sample information, where both the collection of attributes and the response variables are observed with precision. Then, we assume that just incomplete information about them (expressed in terms of set-valued data sets) is provided. We cast some comparison criteria from the recent literature on learning methods from low-quality data as particular instances of our general approach.},
	keywords = {classification, Generalized stochastic ordering, Loss function, Low-quality data, Regression, Set-valued data},
	issn = {0020-0255},
	doi = {https://doi.org/10.1016/j.ins.2016.04.016},
	url = {http://www.sciencedirect.com/science/article/pii/S0020025516302511},
	author = {In{\'e}s Couso and Luciano S{\'a}nchez}
}
@article {SANCHEZ20141583,
	title = {Comments on {\textquotedblleft}Learning from imprecise and fuzzy observations: Data disambiguation through generalized loss minimization{\textquotedblright} by Eyke H{\"u}llermeier},
	journal = {International Journal of Approximate Reasoning},
	volume = {55},
	number = {7},
	year = {2014},
	note = {Special issue: Harnessing the information contained in low-quality data sources},
	pages = {1583 - 1587},
	abstract = {The paper by Eyke H{\"u}llermeier introduces a new set of techniques for learning models from imprecise data. The removal of the uncertainty in the training instances through the input{\textendash}output relationship described by the model is also considered. This discussion addresses three points of the paper: extension principle-based models, precedence operators between fuzzy losses and possible connections between data disambiguation and data imputation.},
	keywords = {classification, fuzzy data, Imprecise data, Loss functions, machine learning, Regression},
	issn = {0888-613X},
	doi = {https://doi.org/10.1016/j.ijar.2014.04.008},
	url = {http://www.sciencedirect.com/science/article/pii/S0888613X14000607},
	author = {Luciano S{\'a}nchez}
}
@article {BERLANGA20101183,
	title = {GP-COACH: Genetic Programming-based learning of Compact and ACcurate fuzzy rule-based classification systems for High-dimensional problems},
	journal = {Information Sciences},
	volume = {180},
	number = {8},
	year = {2010},
	pages = {1183 - 1200},
	abstract = {In this paper we propose GP-COACH, a Genetic Programming-based method for the learning of COmpact and ACcurate fuzzy rule-based classification systems for High-dimensional problems. GP-COACH learns disjunctive normal form rules (generated by means of a context-free grammar) coded as one rule per tree. The population constitutes the rule base, so it is a genetic cooperative-competitive learning approach. GP-COACH uses a token competition mechanism to maintain the diversity of the population and this obliges the rules to compete and cooperate among themselves and allows the obtaining of a compact set of fuzzy rules. The results obtained have been validated by the use of non-parametric statistical tests, showing a good performance in terms of accuracy and interpretability.},
	keywords = {classification, Fuzzy rule-based systems, Genetic Fuzzy Systems, Genetic programming, High-dimensional problems, Interpretability-accuracy trade-off},
	issn = {0020-0255},
	doi = {https://doi.org/10.1016/j.ins.2009.12.020},
	url = {http://www.sciencedirect.com/science/article/pii/S0020025509005635},
	author = {F.J. Berlanga and A.J. Rivera-Rivas and M. J. del Jesus and F. Herrera}
}
@conference {4626687,
	title = {On the Use of Bagging, Mutual Information-Based Feature Selection and Multicriteria Genetic Algorithms to Design Fuzzy Rule-Based Classification Ensembles},
	booktitle = {2008 Eighth International Conference on Hybrid Intelligent Systems},
	year = {2008},
	month = {Sep.},
	pages = {549-554},
	abstract = {In this contribution we explore the combination of bagging with random subspace and two variants of Battiti{\textquoteright}s mutual information feature selection methods to design fuzzy rule-based classification system ensembles. Besides, we consider a multicriteria genetic algorithm guided by the training error to select the component classifiers, in order to look for appropriate accuracy-complexity trade-offs in the final multiclassifier.},
	keywords = {Bagging, classification, Classification algorithms, fuzzy rule-based classification ensembles, fuzzy set theory, Gallium, genetic algorithms, Glass, multicriteria genetic algorithms, mutual information-based feature selection, Sonar, Training, Vehicles},
	doi = {10.1109/HIS.2008.147},
	author = {O. Cord{\'o}n and A. Quirin and L. S{\'a}nchez}
}
@conference {4295638,
	title = {Niching genetic feature selection algorithms applied to the design of fuzzy rule-based classification systems},
	booktitle = {2007 IEEE International Fuzzy Systems Conference},
	year = {2007},
	month = {July},
	pages = {1-6},
	abstract = {In the design of fuzzy rule-based classification systems (FRBCSs) a feature selection process which determines the most relevant features is a crucial component in the majority of the classification problems. This simplification process increases the efficiency of the design process, improves the interpretability of the FRBCS obtained and its generalization capacity. Most of the feature selection algorithms provide a set of variables which are adequate for the induction process according to different quality measures. Nevertheless it can be useful for the induction process to determine not only a set of variables but also different set of variables. These sets of variables can be used for the design of a set of FRBCSs which can be combined in a multiclassifler system, improving the prediction capacity increasing its description capacity. In this work, different proposals of niching genetic algorithms for the feature selection process are analyzed. The different sets of features provided by them are used in a multiclassifier system designed by means of a genetic proposal. The experimentation shows the adaptation of this type of genetic algorithms to the FRBCS design.},
	keywords = {Algorithm design and analysis, classification, data mining, Databases, description capacity, Feature extraction, feature selection algorithms, Fuzzy reasoning, fuzzy rule-based classification systems, fuzzy set theory, Fuzzy sets, Fuzzy systems, genetic algorithms, induction process, Knowledge representation, multiclassifler system, niching genetic algorithms, prediction capacity, Process design, Proposals},
	issn = {1098-7584},
	doi = {10.1109/FUZZY.2007.4295638},
	author = {Jos{\'e} Aguilera and M. Chica and M. J. del Jesus and F. Herrera}
}
