Belief decision trees: Theoretical foundations

From MaRDI portal
Publication:5955360

DOI10.1016/S0888-613X(01)00045-7zbMath0991.68088OpenAlexW1972243481MaRDI QIDQ5955360

Zied Elouedi, Philippe Smets, Khaled Mellouli

Publication date: 13 February 2002

Published in: International Journal of Approximate Reasoning (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0888-613x(01)00045-7




Related Items

Evidential calibration of binary SVM classifiersTS-Models from Evidential ClusteringConstructing consonant belief functions from sample data using confidence sets of pignistic probabilitiesPruning belief decision tree methods in averaging and conjunctive approachesOnline active learning of decision trees with evidential dataParametric classification with soft labels using the evidential EM algorithm: linear discriminant analysis versus logistic regressionGeneralised Max Entropy ClassifiersClassification systems based on rough sets under the belief function frameworkCombining Decision Trees Based on Imprecise Probabilities and Uncertainty MeasuresBelief Classification Approach Based on Generalized Credal EMTowards an Alarm for Opposition Conflict in a Conjunctive Combination of Belief FunctionsClassification with Dynamic Reducts and Belief FunctionsHeuristic method for attribute selection from partially uncertain data using rough setsBelief decision trees: Theoretical foundationsSIM-PDT: A Similarity Based Possibilistic Decision Tree ApproachLearning from partially supervised data using mixture models and belief functionsIn memoriam: Philippe Smets (1938--2005)Decision tree classifiers for evidential attribute values and class labelsA proof for the positive definiteness of the Jaccard index matrixDealing with external actions in belief causal networksIn memoriam: Philippe Smets (1938--2005)


Uses Software


Cites Work