Pages that link to "Item:Q5291283"
From MaRDI portal
The following pages link to AN ALGORITHM TO COMPUTE THE UPPER ENTROPY FOR ORDER-2 CAPACITIES (Q5291283):
Displaying 12 items.
- Maximising entropy on the nonparametric predictive inference model for multinomial data (Q421497) (← links)
- Classification with decision trees from a nonparametric predictive inference perspective (Q1621360) (← links)
- Analyzing properties of Deng entropy in the theory of evidence (Q1674302) (← links)
- A new definition of entropy of belief functions in the Dempster-Shafer theory (Q1687270) (← links)
- Conservative independence-based causal structure learning in absence of adjacency faithfulness (Q2375328) (← links)
- Combining nonspecificity measures in Dempster–Shafer theory of evidence (Q3168388) (← links)
- Uncertainty measures on probability intervals from the imprecise Dirichlet model (Q3426360) (← links)
- Application of uncertainty measures on credal sets on the naive Bayesian classifier (Q3438812) (← links)
- Split Criterions for Variable Selection Using Decision Trees (Q3524957) (← links)
- Combining Decision Trees Based on Imprecise Probabilities and Uncertainty Measures (Q3524959) (← links)
- Requirements for total uncertainty measures in Dempster–Shafer theory of evidence (Q3549310) (← links)
- Estimating information amount under uncertainty: algorithmic solvability and computational complexity (Q3577034) (← links)
