2005
DOI: 10.1016/j.ins.2004.09.002
|View full text |Cite
|
Sign up to set email alerts
|

Knowledge reduction in random information systems via Dempster–Shafer theory of evidence

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1

Citation Types

0
80
0

Year Published

2006
2006
2023
2023

Publication Types

Select...
6
3
1

Relationship

0
10

Authors

Journals

citations
Cited by 203 publications
(80 citation statements)
references
References 16 publications
0
80
0
Order By: Relevance
“…More detailed explanation of ERA is available in wide scientific literature about this subject with many examples for technical systems state analysis [30][31][32], organizational decision making [33][34][35] and rarely for the evaluation of humans properties [14,36,37].…”
Section: Evidential Reasoning Algorithmmentioning
confidence: 99%
“…More detailed explanation of ERA is available in wide scientific literature about this subject with many examples for technical systems state analysis [30][31][32], organizational decision making [33][34][35] and rarely for the evaluation of humans properties [14,36,37].…”
Section: Evidential Reasoning Algorithmmentioning
confidence: 99%
“…5 It is one of the powerful tools to deal with uncertainty and has been applied in many fields. [30][31][32][33][34] In the D-S evidence theory, a sample space is called the frame of discernment which is denoted by  . A basic hypothesis in  is represented…”
Section: Dempster-shafer's Evidence Theorymentioning
confidence: 99%
“…This algorithm has proven to be useful in many practical cases of analysis of different technical systems, both static and dynamic states, comparison between or with referent values [6][7][8][9][10][11][12]. In this work the user is considered to be a constitutive part of the ICT system which implies that the chosen algorithm for system state evaluation could be appropriate.…”
Section: Introductionmentioning
confidence: 99%