SlideShare a Scribd company logo
1 of 10
Dempster-Shafer Combination Rule
Presented by
Md. Monir Ahammod
16CSE061
Department of Computer
Science and Engineering
BSMRSTU
Supervised by
Md. Nesarul Hoque
Assistant Professor,
Department of Computer
Science and Engineering
BSMRSTU
Contents
Dempster-Shafer theory
Basic Probability Assignments
A simplified diagnosis problem
Example 1
Example 2
Example 3
1
Dempster-Shafer theory
 Dempster-Shafer theory lets us handle interactions by manipulating
sets of hypotheses directly.
 Dempster-Shafer approach considers sets of propositions and assigns
to each of them an interval [Belief, Plausibility] in which the degree of
belief must lie.
 Belief (usually denoted Bel) measures the strength of the evidence in
favor of a set of propositions. It ranges from 0 (indicating no evidence)
to 1 (denoting certainty).
 The belief-plausibility interval we have just defined measures not only
our level of belief in some propositions, but also the amount of
information we have.
2
Dempster-Shafer theory (Cont..)
 In the D-S theory, full set of hypotheses is called a frame of
discernment, denoted Θ .
 Each element in Θ corresponds to a one-element subset (called a
singleton).
 By considering all possible subsets of Θ, denoted 2Θ .
 So, a set of size n has 2n
subsets. (The empty set, ∅, is one of these
subsets.
 The impact of each distinct piece of evidence on the subsets of Θ is
represented by a function called a basic probability assignment (bpa).
 A bpa is a generalization of a probability mass distribution; the latter
assigns a number in the range [0, 1] to every singleton of Θ such that
the numbers sum to 1.
3
Basic Probability Assignments
 bpa is denoted by ‘m’.
 For example, m(A) = is a measure of total belief on A,
where A is an element of 2Θ .
 So, m(Θ) = total belief on Θ.
 If m(A) = s and m assigns no belief to other subsets of Θ,
then, m(Θ) = 1 - s.
 Thus, the remaining belief is assigned to Θ and not to the negation of
the hypothesis.
4
A simplified diagnosis problem
 Diagnostic hypothesis set might well include two types of intrahepatic
cholestasis, hepatitis (Hep) and cirrhosis (Cirr), and two types of
extrahepatic cholestasis, gallstones (Gall) and pancreatic cancer (Pan).
 Theses are four causes of jaundice .
 So, Θ = {Hep, Cirr, Gall, Pan}.
 It is assumed that the hypotheses in θ are mutually exclusive and
exhaustive.
5
Example 1
 Suppose that the evidence supports, or confirms, the diagnosis of
intrahepatic cholestasis = {Hep, Cirr} to the degree 0.6, but does not
support a choice between cirrhosis and hepatitis.
 The remaining belief, 1-0.6 = 0.4, is assigned to Θ.
 The hypothesis corresponding to Θ is known to be true under the
assumption of exhaustiveness.
 Thus, m({Hep, Cirr}) = 0.6, m(Θ) = m({Hep, Cirr, Gall, Pan}) = 0.4
and the value of m for every other subset of Θ is 0.
 Bayesians might have assigned the remaining belief to extrahepatic
cholestasis= {Gall, Pan}, the negation (complement) of intrahepatic
cholestasis, rather than to Θ.
6
Example 2
 Suppose that the evidence disconfirms the diagnosis of {Hep} to the
degree 0.7 .
 This is equivalent to confirming that of {Cirr, Gall, Pan} to the degree 0.7.
 Thus, m({Cirr, Gall, Pan}) = 0.7, m(Θ) = 0.3 and the value of m for every
other subset of Θ is 0.
7
Example 3
 Suppose that the evidence confirms the diagnosis of {Hep} to the
degree 0.8.
 Then, m({Hep}) = 0.8, m(Θ) = 0.2, and m is 0 elsewhere.
8
Thanks All
9

More Related Content

What's hot

Security in mobile ad hoc networks
Security in mobile ad hoc networksSecurity in mobile ad hoc networks
Security in mobile ad hoc networks
Piyush Mittal
 

What's hot (20)

First order predicate logic (fopl)
First order predicate logic (fopl)First order predicate logic (fopl)
First order predicate logic (fopl)
 
Evaluating hypothesis
Evaluating  hypothesisEvaluating  hypothesis
Evaluating hypothesis
 
Specification-of-tokens
Specification-of-tokensSpecification-of-tokens
Specification-of-tokens
 
Routing in vanet
Routing in vanetRouting in vanet
Routing in vanet
 
The constrained application protocol (coap) part 2
The constrained application protocol (coap)  part 2The constrained application protocol (coap)  part 2
The constrained application protocol (coap) part 2
 
Routing and routing algorithms
Routing and routing algorithmsRouting and routing algorithms
Routing and routing algorithms
 
Lecture 6 web security
Lecture 6 web securityLecture 6 web security
Lecture 6 web security
 
18CS2005 Cryptography and Network Security
18CS2005 Cryptography and Network Security18CS2005 Cryptography and Network Security
18CS2005 Cryptography and Network Security
 
Types of parsers
Types of parsersTypes of parsers
Types of parsers
 
Security in mobile ad hoc networks
Security in mobile ad hoc networksSecurity in mobile ad hoc networks
Security in mobile ad hoc networks
 
Internet security association and key management protocol (isakmp)
Internet security association and key management protocol (isakmp)Internet security association and key management protocol (isakmp)
Internet security association and key management protocol (isakmp)
 
Machine Learning: Bias and Variance Trade-off
Machine Learning: Bias and Variance Trade-offMachine Learning: Bias and Variance Trade-off
Machine Learning: Bias and Variance Trade-off
 
Unit 3 Network Layer PPT
Unit 3 Network Layer PPTUnit 3 Network Layer PPT
Unit 3 Network Layer PPT
 
Chapter 1 Introduction of Cryptography and Network security
Chapter 1 Introduction of Cryptography and Network security Chapter 1 Introduction of Cryptography and Network security
Chapter 1 Introduction of Cryptography and Network security
 
NLP_KASHK:Finite-State Automata
NLP_KASHK:Finite-State AutomataNLP_KASHK:Finite-State Automata
NLP_KASHK:Finite-State Automata
 
Simple Mail Transfer Protocol
Simple Mail Transfer ProtocolSimple Mail Transfer Protocol
Simple Mail Transfer Protocol
 
HTTP/2 Changes Everything
HTTP/2 Changes EverythingHTTP/2 Changes Everything
HTTP/2 Changes Everything
 
IEEE 802 Standard for Computer Networks
IEEE 802 Standard for Computer NetworksIEEE 802 Standard for Computer Networks
IEEE 802 Standard for Computer Networks
 
SSL And TLS
SSL And TLS SSL And TLS
SSL And TLS
 
MULTICAST BY SAIKIRAN PANJALA
MULTICAST BY SAIKIRAN PANJALAMULTICAST BY SAIKIRAN PANJALA
MULTICAST BY SAIKIRAN PANJALA
 

Similar to 3. the dempster shafer combination rule

On Severity, the Weight of Evidence, and the Relationship Between the Two
On Severity, the Weight of Evidence, and the Relationship Between the TwoOn Severity, the Weight of Evidence, and the Relationship Between the Two
On Severity, the Weight of Evidence, and the Relationship Between the Two
jemille6
 
S5 w1 hypothesis testing & t test
S5 w1 hypothesis testing & t testS5 w1 hypothesis testing & t test
S5 w1 hypothesis testing & t test
Rachel Chung
 
Statistics 091208004734-phpapp01 (1)
Statistics 091208004734-phpapp01 (1)Statistics 091208004734-phpapp01 (1)
Statistics 091208004734-phpapp01 (1)
mandrewmartin
 
pydata_confernence_july_2016_modified_sunday_final
pydata_confernence_july_2016_modified_sunday_finalpydata_confernence_july_2016_modified_sunday_final
pydata_confernence_july_2016_modified_sunday_final
Austin Powell
 

Similar to 3. the dempster shafer combination rule (20)

Analysis on Data Fusion Techniques for Combining Conflicting Beliefs
Analysis on Data Fusion Techniques for Combining Conflicting BeliefsAnalysis on Data Fusion Techniques for Combining Conflicting Beliefs
Analysis on Data Fusion Techniques for Combining Conflicting Beliefs
 
On Severity, the Weight of Evidence, and the Relationship Between the Two
On Severity, the Weight of Evidence, and the Relationship Between the TwoOn Severity, the Weight of Evidence, and the Relationship Between the Two
On Severity, the Weight of Evidence, and the Relationship Between the Two
 
0hypothesis testing.pdf
0hypothesis testing.pdf0hypothesis testing.pdf
0hypothesis testing.pdf
 
ch 2 hypothesis
ch 2 hypothesisch 2 hypothesis
ch 2 hypothesis
 
Phil 6334 Mayo slides Day 1
Phil 6334 Mayo slides Day 1Phil 6334 Mayo slides Day 1
Phil 6334 Mayo slides Day 1
 
hypothesis testing overview
hypothesis testing overviewhypothesis testing overview
hypothesis testing overview
 
Hypothesis testing
Hypothesis testingHypothesis testing
Hypothesis testing
 
Chi square(hospital admin) A
Chi square(hospital admin) AChi square(hospital admin) A
Chi square(hospital admin) A
 
A Bayesian Networks Analysis of the Duhem-Quine Thesis.pdf
A Bayesian Networks Analysis of the Duhem-Quine Thesis.pdfA Bayesian Networks Analysis of the Duhem-Quine Thesis.pdf
A Bayesian Networks Analysis of the Duhem-Quine Thesis.pdf
 
Frequentist Statistics as a Theory of Inductive Inference (2/27/14)
Frequentist Statistics as a Theory of Inductive Inference (2/27/14)Frequentist Statistics as a Theory of Inductive Inference (2/27/14)
Frequentist Statistics as a Theory of Inductive Inference (2/27/14)
 
Belief function
Belief functionBelief function
Belief function
 
Excursion 3 Tour III, Capability and Severity: Deeper Concepts
Excursion 3 Tour III, Capability and Severity: Deeper ConceptsExcursion 3 Tour III, Capability and Severity: Deeper Concepts
Excursion 3 Tour III, Capability and Severity: Deeper Concepts
 
NULL AND ALTERNATIVE HYPOTHESIS.pptx
NULL AND ALTERNATIVE HYPOTHESIS.pptxNULL AND ALTERNATIVE HYPOTHESIS.pptx
NULL AND ALTERNATIVE HYPOTHESIS.pptx
 
S5 w1 hypothesis testing & t test
S5 w1 hypothesis testing & t testS5 w1 hypothesis testing & t test
S5 w1 hypothesis testing & t test
 
Mayo class #7 March 6 slides
Mayo class #7 March 6 slidesMayo class #7 March 6 slides
Mayo class #7 March 6 slides
 
Probability
ProbabilityProbability
Probability
 
Philosophy of Science and Philosophy of Statistics
Philosophy of Science and Philosophy of StatisticsPhilosophy of Science and Philosophy of Statistics
Philosophy of Science and Philosophy of Statistics
 
lecture no.7 computation.pptx
lecture no.7 computation.pptxlecture no.7 computation.pptx
lecture no.7 computation.pptx
 
Statistics 091208004734-phpapp01 (1)
Statistics 091208004734-phpapp01 (1)Statistics 091208004734-phpapp01 (1)
Statistics 091208004734-phpapp01 (1)
 
pydata_confernence_july_2016_modified_sunday_final
pydata_confernence_july_2016_modified_sunday_finalpydata_confernence_july_2016_modified_sunday_final
pydata_confernence_july_2016_modified_sunday_final
 

Recently uploaded

一比一原版(Griffith毕业证书)格里菲斯大学毕业证成绩单学位证书
一比一原版(Griffith毕业证书)格里菲斯大学毕业证成绩单学位证书一比一原版(Griffith毕业证书)格里菲斯大学毕业证成绩单学位证书
一比一原版(Griffith毕业证书)格里菲斯大学毕业证成绩单学位证书
c3384a92eb32
 
21P35A0312 Internship eccccccReport.docx
21P35A0312 Internship eccccccReport.docx21P35A0312 Internship eccccccReport.docx
21P35A0312 Internship eccccccReport.docx
rahulmanepalli02
 

Recently uploaded (20)

Presentation on Slab, Beam, Column, and Foundation/Footing
Presentation on Slab,  Beam, Column, and Foundation/FootingPresentation on Slab,  Beam, Column, and Foundation/Footing
Presentation on Slab, Beam, Column, and Foundation/Footing
 
analog-vs-digital-communication (concept of analog and digital).pptx
analog-vs-digital-communication (concept of analog and digital).pptxanalog-vs-digital-communication (concept of analog and digital).pptx
analog-vs-digital-communication (concept of analog and digital).pptx
 
Developing a smart system for infant incubators using the internet of things ...
Developing a smart system for infant incubators using the internet of things ...Developing a smart system for infant incubators using the internet of things ...
Developing a smart system for infant incubators using the internet of things ...
 
Databricks Generative AI FoundationCertified.pdf
Databricks Generative AI FoundationCertified.pdfDatabricks Generative AI FoundationCertified.pdf
Databricks Generative AI FoundationCertified.pdf
 
litvinenko_Henry_Intrusion_Hong-Kong_2024.pdf
litvinenko_Henry_Intrusion_Hong-Kong_2024.pdflitvinenko_Henry_Intrusion_Hong-Kong_2024.pdf
litvinenko_Henry_Intrusion_Hong-Kong_2024.pdf
 
Basics of Relay for Engineering Students
Basics of Relay for Engineering StudentsBasics of Relay for Engineering Students
Basics of Relay for Engineering Students
 
Raashid final report on Embedded Systems
Raashid final report on Embedded SystemsRaashid final report on Embedded Systems
Raashid final report on Embedded Systems
 
一比一原版(Griffith毕业证书)格里菲斯大学毕业证成绩单学位证书
一比一原版(Griffith毕业证书)格里菲斯大学毕业证成绩单学位证书一比一原版(Griffith毕业证书)格里菲斯大学毕业证成绩单学位证书
一比一原版(Griffith毕业证书)格里菲斯大学毕业证成绩单学位证书
 
Working Principle of Echo Sounder and Doppler Effect.pdf
Working Principle of Echo Sounder and Doppler Effect.pdfWorking Principle of Echo Sounder and Doppler Effect.pdf
Working Principle of Echo Sounder and Doppler Effect.pdf
 
Circuit Breakers for Engineering Students
Circuit Breakers for Engineering StudentsCircuit Breakers for Engineering Students
Circuit Breakers for Engineering Students
 
Geometric constructions Engineering Drawing.pdf
Geometric constructions Engineering Drawing.pdfGeometric constructions Engineering Drawing.pdf
Geometric constructions Engineering Drawing.pdf
 
Augmented Reality (AR) with Augin Software.pptx
Augmented Reality (AR) with Augin Software.pptxAugmented Reality (AR) with Augin Software.pptx
Augmented Reality (AR) with Augin Software.pptx
 
Theory of Time 2024 (Universal Theory for Everything)
Theory of Time 2024 (Universal Theory for Everything)Theory of Time 2024 (Universal Theory for Everything)
Theory of Time 2024 (Universal Theory for Everything)
 
CLOUD COMPUTING SERVICES - Cloud Reference Modal
CLOUD COMPUTING SERVICES - Cloud Reference ModalCLOUD COMPUTING SERVICES - Cloud Reference Modal
CLOUD COMPUTING SERVICES - Cloud Reference Modal
 
Independent Solar-Powered Electric Vehicle Charging Station
Independent Solar-Powered Electric Vehicle Charging StationIndependent Solar-Powered Electric Vehicle Charging Station
Independent Solar-Powered Electric Vehicle Charging Station
 
NEWLETTER FRANCE HELICES/ SDS SURFACE DRIVES - MAY 2024
NEWLETTER FRANCE HELICES/ SDS SURFACE DRIVES - MAY 2024NEWLETTER FRANCE HELICES/ SDS SURFACE DRIVES - MAY 2024
NEWLETTER FRANCE HELICES/ SDS SURFACE DRIVES - MAY 2024
 
Diploma Engineering Drawing Qp-2024 Ece .pdf
Diploma Engineering Drawing Qp-2024 Ece .pdfDiploma Engineering Drawing Qp-2024 Ece .pdf
Diploma Engineering Drawing Qp-2024 Ece .pdf
 
Passive Air Cooling System and Solar Water Heater.ppt
Passive Air Cooling System and Solar Water Heater.pptPassive Air Cooling System and Solar Water Heater.ppt
Passive Air Cooling System and Solar Water Heater.ppt
 
engineering chemistry power point presentation
engineering chemistry  power point presentationengineering chemistry  power point presentation
engineering chemistry power point presentation
 
21P35A0312 Internship eccccccReport.docx
21P35A0312 Internship eccccccReport.docx21P35A0312 Internship eccccccReport.docx
21P35A0312 Internship eccccccReport.docx
 

3. the dempster shafer combination rule

  • 1. Dempster-Shafer Combination Rule Presented by Md. Monir Ahammod 16CSE061 Department of Computer Science and Engineering BSMRSTU Supervised by Md. Nesarul Hoque Assistant Professor, Department of Computer Science and Engineering BSMRSTU
  • 2. Contents Dempster-Shafer theory Basic Probability Assignments A simplified diagnosis problem Example 1 Example 2 Example 3 1
  • 3. Dempster-Shafer theory  Dempster-Shafer theory lets us handle interactions by manipulating sets of hypotheses directly.  Dempster-Shafer approach considers sets of propositions and assigns to each of them an interval [Belief, Plausibility] in which the degree of belief must lie.  Belief (usually denoted Bel) measures the strength of the evidence in favor of a set of propositions. It ranges from 0 (indicating no evidence) to 1 (denoting certainty).  The belief-plausibility interval we have just defined measures not only our level of belief in some propositions, but also the amount of information we have. 2
  • 4. Dempster-Shafer theory (Cont..)  In the D-S theory, full set of hypotheses is called a frame of discernment, denoted Θ .  Each element in Θ corresponds to a one-element subset (called a singleton).  By considering all possible subsets of Θ, denoted 2Θ .  So, a set of size n has 2n subsets. (The empty set, ∅, is one of these subsets.  The impact of each distinct piece of evidence on the subsets of Θ is represented by a function called a basic probability assignment (bpa).  A bpa is a generalization of a probability mass distribution; the latter assigns a number in the range [0, 1] to every singleton of Θ such that the numbers sum to 1. 3
  • 5. Basic Probability Assignments  bpa is denoted by ‘m’.  For example, m(A) = is a measure of total belief on A, where A is an element of 2Θ .  So, m(Θ) = total belief on Θ.  If m(A) = s and m assigns no belief to other subsets of Θ, then, m(Θ) = 1 - s.  Thus, the remaining belief is assigned to Θ and not to the negation of the hypothesis. 4
  • 6. A simplified diagnosis problem  Diagnostic hypothesis set might well include two types of intrahepatic cholestasis, hepatitis (Hep) and cirrhosis (Cirr), and two types of extrahepatic cholestasis, gallstones (Gall) and pancreatic cancer (Pan).  Theses are four causes of jaundice .  So, Θ = {Hep, Cirr, Gall, Pan}.  It is assumed that the hypotheses in θ are mutually exclusive and exhaustive. 5
  • 7. Example 1  Suppose that the evidence supports, or confirms, the diagnosis of intrahepatic cholestasis = {Hep, Cirr} to the degree 0.6, but does not support a choice between cirrhosis and hepatitis.  The remaining belief, 1-0.6 = 0.4, is assigned to Θ.  The hypothesis corresponding to Θ is known to be true under the assumption of exhaustiveness.  Thus, m({Hep, Cirr}) = 0.6, m(Θ) = m({Hep, Cirr, Gall, Pan}) = 0.4 and the value of m for every other subset of Θ is 0.  Bayesians might have assigned the remaining belief to extrahepatic cholestasis= {Gall, Pan}, the negation (complement) of intrahepatic cholestasis, rather than to Θ. 6
  • 8. Example 2  Suppose that the evidence disconfirms the diagnosis of {Hep} to the degree 0.7 .  This is equivalent to confirming that of {Cirr, Gall, Pan} to the degree 0.7.  Thus, m({Cirr, Gall, Pan}) = 0.7, m(Θ) = 0.3 and the value of m for every other subset of Θ is 0. 7
  • 9. Example 3  Suppose that the evidence confirms the diagnosis of {Hep} to the degree 0.8.  Then, m({Hep}) = 0.8, m(Θ) = 0.2, and m is 0 elsewhere. 8