277 results on '"Abellán, Joaquín"'
Search Results
2. Lazy Multi-Label Classification algorithms based on Non-Parametric Predictive Inference
3. Using Credal C4.5 for Calibrated Label Ranking in Multi-Label Classification
4. A cost-sensitive Imprecise Credal Decision Tree based on Nonparametric Predictive Inference
5. A new label ordering method in Classifier Chains based on imprecise probabilities
6. Using extreme prior probabilities on the Naive Credal Classifier
7. Imprecise Classification with Non-parametric Predictive Inference
8. Combination in the theory of evidence via a new measurement of the conflict between evidences
9. A Decision Support Tool for Credit Domains: Bayesian Network with a Variable Selector Based on Imprecise Probabilities
10. Credal sets representable by reachable probability intervals and belief functions
11. Basic Properties for Total Uncertainty Measures in the Theory of Evidence
12. Combination in Dempster-Shafer Theory Based on a Disagreement Factor Between Evidences
13. Critique of modified Deng entropies under the evidence theory
14. Non-parametric predictive inference for solving multi-label classification
15. Bagging of credal decision trees for imprecise classification
16. Credal C4.5 with Refinement of Parameters
17. Imprecise Classification with Non-parametric Predictive Inference
18. Increasing diversity in random forest learning algorithm via imprecise probabilities
19. Remarks on “A new non-specificity measure in evidence theory based on belief intervals”
20. AdaptativeCC4.5: Credal C4.5 with a rough class noise estimator
21. A comparison of random forest based algorithms: random credal random forest versus oblique random forest
22. Ensemble of classifier chains and Credal C4.5 for solving multi-label classification
23. Upgrading the Fusion of Imprecise Classifiers
24. A comparative study on base classifiers in ensemble methods for credit scoring
25. Analyzing properties of Deng entropy in the theory of evidence
26. Martin Lutero sobre la autoridad secular
27. A Variation of the Algorithm to Achieve the Maximum Entropy for Belief Functions
28. El concepto de democracia plebiscitaria en Max Weber (1919-1920)
29. Analysis of Credal-C4.5 for classification in noisy domains
30. Using Imprecise Probabilities to Extract Decision Rules via Decision Trees for Analysis of Traffic Accidents
31. Credal Decision Trees to Classify Noisy Data Sets
32. Improving the Results in Credit Scoring by Increasing Diversity in Ensembles of Classifiers
33. Bagging Decision Trees on Data Sets with Classification Noise
34. Credal-C4.5: Decision tree based on imprecise probabilities to classify noisy data
35. Improving experimental studies about ensembles of classifiers for bankruptcy prediction and credit scoring
36. Analysis and extension of decision trees based on imprecise probabilities: Application on noisy data
37. Classification with decision trees from a nonparametric predictive inference perspective
38. An Experimental Study about Simple Decision Trees for Bagging Ensemble on Datasets with Classification Noise
39. A Semi-naive Bayes Classifier with Grouping of Cases
40. Combining Decision Trees Based on Imprecise Probabilities and Uncertainty Measures
41. Split Criterions for Variable Selection Using Decision Trees
42. Varying Parameter in Classification Based on Imprecise Probabilities
43. Range of Entropy for Credal Sets
44. Analysis of traffic accident severity using Decision Rules via Decision Trees
45. Ensembles of decision trees based on imprecise probabilities and uncertainty measures
46. An application of Non-Parametric Predictive Inference on multi-class classification high-level-noise problems
47. Extracting decision rules from police accident reports through decision trees
48. Bagging schemes on the presence of class noise in classification
49. Maximising entropy on the nonparametric predictive inference model for multinomial data
50. An ensemble method using credal decision trees
Catalog
Books, media, physical & digital resources
Discovery Service for Jio Institute Digital Library
For full access to our library's resources, please sign in.