Approximations for efficient computation in the theory of evidence
Artificial Intelligence
Artificial Intelligence
From rough set theory to evidence theory
Advances in the Dempster-Shafer theory of evidence
Rough Sets: Theoretical Aspects of Reasoning about Data
Rough Sets: Theoretical Aspects of Reasoning about Data
Probabilistic Rough Induction: The GDT-RS Methodology and Algorithms
ISMIS '99 Proceedings of the 11th International Symposium on Foundations of Intelligent Systems
Pruning belief decision tree methods in averaging and conjunctive approaches
International Journal of Approximate Reasoning
Dynamic Reduct from Partially Uncertain Data Using Rough Sets
RSFDGrC '09 Proceedings of the 12th International Conference on Rough Sets, Fuzzy Sets, Data Mining and Granular Computing
An evidence-theoretic k-NN rule with parameter optimization
IEEE Transactions on Systems, Man, and Cybernetics, Part C: Applications and Reviews
Assessing sensor reliability for multisensor data fusion within the transferable belief model
IEEE Transactions on Systems, Man, and Cybernetics, Part B: Cybernetics
The modified Dempster-Shafer approach to classification
IEEE Transactions on Systems, Man, and Cybernetics, Part A: Systems and Humans
Classification with dynamic reducts and belief functions
Transactions on rough sets XIV
Classification systems based on rough sets under the belief function framework
International Journal of Approximate Reasoning
Hi-index | 0.00 |
In this paper, we deal with the problem of rule discovery process based on rough sets from partially uncertain data. The uncertainty exists only in decision attribute values and is handled by the Transferable Belief Model (TBM), one interpretation of the belief function theory. To solve this problem, we propose in this uncertain environment, a new method based on a soft hybrid induction system for discovering classification rules called GDT-RS which is a hybridization of the Generalization Distribution Table and the Rough Set methodology.