Aleatoric and epistemic uncertainty in machine learning: An introduction to concepts and methods

E Hüllermeier, W Waegeman - Machine learning, 2021 - Springer
The notion of uncertainty is of major importance in machine learning and constitutes a key
element of machine learning methodology. In line with the statistical tradition, uncertainty …

A comparative study on base classifiers in ensemble methods for credit scoring

J Abellán, JG Castellano - Expert systems with applications, 2017 - Elsevier
In the last years, the application of artificial intelligence methods on credit risk assessment
has meant an improvement over classic methods. Small improvements in the systems about …

Improving experimental studies about ensembles of classifiers for bankruptcy prediction and credit scoring

J Abellán, CJ Mantas - Expert Systems with Applications, 2014 - Elsevier
Previous studies about ensembles of classifiers for bankruptcy prediction and credit scoring
have been presented. In these studies, different ensemble schemes for complex classifiers …

[HTML][HTML] A new definition of entropy of belief functions in the Dempster–Shafer theory

R Jiroušek, PP Shenoy - International Journal of Approximate Reasoning, 2018 - Elsevier
We propose a new definition of entropy of basic probability assignments (BPAs) in the
Dempster–Shafer (DS) theory of belief functions, which is interpreted as a measure of total …

Credal-C4. 5: Decision tree based on imprecise probabilities to classify noisy data

CJ Mantas, J Abellan - Expert Systems with Applications, 2014 - Elsevier
In the area of classification, C4. 5 is a known algorithm widely used to design decision trees.
In this algorithm, a pruning process is carried out to solve the problem of the over-fitting. A …

Quantification of credal uncertainty in machine learning: A critical analysis and empirical comparison

E Hüllermeier, S Destercke… - Uncertainty in Artificial …, 2022 - proceedings.mlr.press
The representation and quantification of uncertainty has received increasing attention in
machine learning in the recent past. The formalism of credal sets provides an interesting …

Analyzing properties of Deng entropy in the theory of evidence

J Abellán - Chaos, Solitons & Fractals, 2017 - Elsevier
The theory of Evidence, or Shafer-Dempster theory (DST), has been widely used in
applications. The DST is based on the concept of a basic probability assignment. An …

Conflict management in Dempster–Shafer theory using the degree of falsity

J Schubert - International Journal of Approximate Reasoning, 2011 - Elsevier
In this article we develop a method for conflict management within Dempster–Shafer theory.
The idea is that each piece of evidence is discounted in proportion to the degree that it …

A random forest approach using imprecise probabilities

J Abellán, CJ Mantas, JG Castellano - Knowledge-Based Systems, 2017 - Elsevier
Abstract The Random Forest classifier has been considered as an important reference in the
data mining area. The building procedure of its base classifier (a decision tree) is principally …

Imprecise Bayesian neural networks

M Caprio, S Dutta, KJ Jang, V Lin, R Ivanov… - arXiv preprint arXiv …, 2023 - arxiv.org
Uncertainty quantification and robustness to distribution shifts are important goals in
machine learning and artificial intelligence. Although Bayesian Neural Networks (BNNs) …