Compară metode

	Bază de Reguli de Credință (RIMER)	Teoria Dempster-Shafer a Evidenței	Inducția regulilor (RIPPER)
Domeniu	Soft computing	Soft computing	Învățare automată
Familie	Machine learning	Machine learning	Machine learning
Anul apariției	2006	1976	1995
Autorul original	Jian-Bo Yang et al.	Arthur P. Dempster & Glenn Shafer	William W. Cohen
Tip	Expert-system inference with belief distributions	Uncertainty calculus for combining evidence	Supervised rule learning algorithm
Sursa seminală	Yang, J.-B., Liu, J., Wang, J., Sii, H.-S., & Wang, H.-W. (2006). Belief rule-base inference methodology using the evidential reasoning approach—RIMER. IEEE Transactions on Systems, Man, and Cybernetics—Part A, 36(2), 266–285.	Dempster, A. P. (1967). Upper and lower probabilities induced by a multivalued mapping. The Annals of Mathematical Statistics, 38(2), 325–339.	Cohen, W. W. (1995). Fast effective rule induction. Proceedings of the 12th International Conference on Machine Learning, 115–123.
Denumiri alternative	RIMER, Belief Rule-Based System, BRB System, İnanç Kural Tabanlı Çıkarım	evidence theory, belief functions, evidential reasoning, Dempster-Shafer kanıt teorisi	RIPPER, Propositional Rule Learning, Kural Tümevarımı, Inductive Rule Learning
Înrudite	3	4	2
Rezumat	Belief Rule Base (BRB), introduced by Yang et al. in 2006 under the RIMER framework, is an expert-system inference methodology that extends classical if-then rules by attaching belief degree distributions to rule consequents. It combines rule-based reasoning with the Evidential Reasoning (ER) approach, enabling the representation and propagation of uncertainty, incompleteness, and vagueness in complex decision problems across engineering, risk assessment, and management domains.	Dempster-Shafer theory is a mathematical framework for reasoning under uncertainty that generalizes Bayesian probability by representing ignorance explicitly. Instead of forcing a single probability on each hypothesis, it assigns belief mass to sets of hypotheses and derives a belief-plausibility interval, and it provides Dempster's rule for fusing evidence from multiple independent sources. Developed from Arthur Dempster's 1967 work and Glenn Shafer's 1976 monograph, it underpins evidential reasoning and sensor/decision fusion.	Rule Induction, and specifically the RIPPER (Repeated Incremental Pruning to Produce Error Reduction) algorithm, is a supervised machine learning method that learns a compact set of IF-THEN classification rules from labeled training data. Introduced by William W. Cohen in 1995, RIPPER applies a separate-and-conquer strategy combined with minimum description length (MDL) pruning to generate rules that are both accurate and interpretable, making it a landmark algorithm in the field of inductive rule learning.