Cargando…
Belief Entropy Tree and Random Forest: Learning from Data with Continuous Attributes and Evidential Labels
As well-known machine learning methods, decision trees are widely applied in classification and recognition areas. In this paper, with the uncertainty of labels handled by belief functions, a new decision tree method based on belief entropy is proposed and then extended to random forest. With the Ga...
Autores principales: | Gao, Kangkai, Wang, Yong, Ma, Liyao |
---|---|
Formato: | Online Artículo Texto |
Lenguaje: | English |
Publicado: |
MDPI
2022
|
Materias: | |
Acceso en línea: | https://www.ncbi.nlm.nih.gov/pmc/articles/PMC9141821/ https://www.ncbi.nlm.nih.gov/pubmed/35626490 http://dx.doi.org/10.3390/e24050605 |
Ejemplares similares
-
Evidential Decision Tree Based on Belief Entropy
por: Li, Mujin, et al.
Publicado: (2019) -
An Intuitionistic Evidential Method for Weight Determination in FMEA Based on Belief Entropy
por: Liu, Zeyi, et al.
Publicado: (2019) -
Compact Belief Rule Base Learning for Classification with Evidential Clustering †
por: Jiao, Lianmeng, et al.
Publicado: (2019) -
Landslides behavior spatial modeling by using evidential belief function model, Promethean II model, and index of entropy in Tabriz, Iran
por: Beheshti, Ziba, et al.
Publicado: (2021) -
Bayesian Smoothing of Decision Tree Soft Predictions and Evidential Evaluation
por: Sutton-Charani, Nicolas
Publicado: (2020)