Serafín Moral-García

Dr. Serafín Moral-García


Research Focus & Metrics

Academic Career Length

9Years (2018-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
3 April 2019 in Entropy
Verified
Journal Article
Open access
PDF file
SMSerafín Moral-García
Serafín Moral-García
JCJavier G. Castellano
Javier G. Castellano
CMCarlos J. Mantas
Carlos J. Mantas
Alfonso MontellaAlfonso Montella
Alfonso Montella
JOAQUIN ABELLANJOAQUIN ABELLAN
JOAQUIN ABELLAN
Presently, there is a critical need to analyze traffic accidents in order to mitigate their terrible economic and human impact. Most accidents occur in urban areas. Furthermore, driving experience has an important effect on accident analysis, since inexperienced drivers are more likely to suffer fatal injuries. This work studies the injury severity produced by accidents that involve inexperienced drivers in urban areas. The analysis was based on data provided by the Spanish General Traffic Directorate. The information root node variation (IRNV) method (based on decision trees) was used to get a rule set that provides useful information about the most probable causes of fatalities in accidents involving inexperienced drivers in urban areas. This may prove useful knowledge in preventing this kind of accidents and/or mitigating their consequences.

6 May 2021 in International Journal of Intelligent Systems
Verified
Journal Article
Open access
PDF file
SMSerafín Moral-García
Serafín Moral-García
JOAQUIN ABELLANJOAQUIN ABELLAN
JOAQUIN ABELLAN
The Dempster–Shafer theory of evidence (DST) has been widely used to handle uncertainty‐based information. It is based on the concept of basic probability assignment (BPA). Belief intervals are easier to manage than a BPA to represent uncertainty‐based information. For this reason, several uncertainty measures for DST recently proposed are based on belief intervals. In this study, we carry out a study about the crucial mathematical properties and behavioral requirements that must be verified by every uncertainty measure on belief intervals. We base on the study previously carried out for uncertainty measures on BPAs. Furthermore, we analyze which of these properties are satisfied by each one of the uncertainty measures on belief intervals proposed so far. Such a comparative analysis shows that, among these measures, the maximum of entropy on the belief intervals is the most suitable one to be employed in practical applications since it is the only one that satisfies all the required mathematical properties and behaviors.

19 June 2020 in IEEE Access
Verified
Journal Article
Open access
SMSerafín Moral-García
Serafín Moral-García
JOAQUIN ABELLANJOAQUIN ABELLAN
JOAQUIN ABELLAN
The Dempster-Shafer Theory (DST) or Evidence Theory has been commonly used to deal with uncertainty. It is based on the basic probability assignment concept (BPA). The upper entropy on the credal set associated with a BPA is the only uncertainty measure in DST that verifies all the necessary mathematical properties and behaviors. Nonetheless, its computation is notably complex. For this reason, many alternatives to this measure have been recently proposed, but they do not satisfy most of the mathematical requirements and present some undesirable behaviors. Belief intervals have been frequently employed to quantify uncertainty in DST in the last years, and they can represent the uncertainty-based-information better than a BPA. In this research, we develop a new uncertainty measure that consists of the maximum of entropy on the credal set corresponding to belief intervals for singletons. It verifies all the crucial mathematical requirements and presents good behavior, solving most of the shortcomings found in uncertainty measures proposed recently. Moreover, its calculation is notably easier than the upper entropy on the credal set associated with the BPA. Therefore, our proposed uncertainty measure is more suitable to be used in practical applications.

30 October 2018 in Journal of Intelligent & Fuzzy Systems: Applications in Engineering and Technology
Verified
Journal Article
Closed access
PDF file
SMSerafín Moral-García
Serafín Moral-García
CMCarlos J. Mantas
Carlos J. Mantas
JCJavier G. Castellano
Javier G. Castellano
JOAQUIN ABELLANJOAQUIN ABELLAN
JOAQUIN ABELLAN
Binary Relevance (BR) is a simple and direct approach to the Multi-Label Classification (MLC). It decomposes the multi-label problem into several binary problems, one per label. It uses an algorithm of traditional supervised classification in order to solve these binary problems. On the other hand, Credal C4.5 (CC4.5) is a modification of the classical C4.5. CC4.5 estimates the probability of the class variable by using imprecise probabilities. In the literature, this new classification algorithm has obtained better results than C4.5 when both have been applied on datasets with class noise. In MLC, since there are not just a class, but multiple labels are disposed, it is more probable that there is intrinsic noise than in traditional classification. From the previous reasons, in this work it is studied the performance of BR using Credal C4.5 as base classifier versus BR with C4.5. It is carried out an experimental study with several muti-label datasets and a considerable number of measures for MLC. This study shows that the performance of BR is improved when it uses CC4.5 as base classifier versus BR with C4.5. In consequence, it is probably suitable to apply imprecise probabilities in Decision Trees within the MLC field too.

8 June 2023 in IEEE Access
Verified
Journal Article
Open access
SMSerafín Moral-García
Serafín Moral-García
JOAQUIN ABELLANJOAQUIN ABELLAN
JOAQUIN ABELLAN
The ensembles of classifiers are techniques that have obtained excellent results in the credit scoring domain. It is known that Decision Trees (DTs) are suitable for ensembles because they encourage diversity, the key point for the success of an ensemble scheme. Ensembles of DTs have obtained good performance in a wide range of areas, including credit scoring. Some works have highlighted that DTs that employ imprecise probability models, called Credal Decision Trees (CDTs), improve the results of ensembles in credit scoring. The performance of CDT is strongly influenced by a hyperparameter. In fact, it was shown that different values of the hyperparameter might yield different models. Hence, the diversity in ensemble schemes can be increased by randomly selecting the value of the hyperparameter in each CDT, instead of fixing one. In this work, it is shown that increasing the diversity of the ensembles that use CDT by varying the value of the hyperparameter in each base classifier improves the results in credit scoring. Thereby, the use of CDT randomly selecting the value of the hyperparameter would suppose notable economic benefits for banks and financial institutions. Few gains in accuracy might imply huge gains in economic benefits.

29 May 2023 in Entropy
Verified
Journal Article
Open access
PDF file
JOAQUIN ABELLANJOAQUIN ABELLAN
JOAQUIN ABELLAN
ALAlejandro Pérez Lara
Alejandro Pérez Lara
SMSerafín Moral-García
Serafín Moral-García
Evidence theory (TE), based on imprecise probabilities, is often more appropriate than the classical theory of probability (PT) to apply in situations with inaccurate or incomplete information. The quantification of the information that a piece of evidence involves is a key issue in TE. Shannon’s entropy is an excellent measure in the PT for such purposes, being easy to calculate and fulfilling a wide set of properties that make it axiomatically the best one in PT. In TE, a similar role is played by the maximum of entropy (ME), verifying a similar set of properties. The ME is the unique measure in TE that has such axiomatic behavior. The problem of the ME in TE is its complex computational calculus, which makes its use problematic in some situations. There exists only one algorithm for the calculus of the ME in TE with a high computational cost, and this problem has been the principal drawback found with this measure. In this work, a variation of the original algorithm is presented. It is shown that with this modification, a reduction in the necessary steps to attain the ME can be obtained because, in each step, the power set of possibilities is reduced with respect to the original algorithm, which is the key point of the complexity found. This solution can provide greater applicability of this measure.