|
Registro Completo |
|
Biblioteca(s): |
Embrapa Agricultura Digital. |
|
Data corrente: |
13/02/1998 |
|
Data da última atualização: |
05/12/2013 |
|
Autoria: |
JOSHI, A. V.; SAHASRABUDHE, S. C.; SHANKAR, K. |
|
Título: |
Sensitivity of combination schemes under conflicting conditions and a new method. |
|
Ano de publicação: |
1995 |
|
Fonte/Imprenta: |
In: BRAZILIAN SYMPOSIUM ON ARTIFICIAL INTELLIGENCE, 12., 1995, Campinas. Advances in artificial intelligence: proceedings. Berlin: Springer, 1995. |
|
Páginas: |
p. 39-48. |
|
Série: |
(Lecture notes in artificial intelligence, 991; Lecture notes in computer science). |
|
ISBN: |
3-540-60436-7 |
|
Idioma: |
Inglês |
|
Notas: |
SBIA'95. Ed. by Jacques Wainer and Ariadne Carvalho. |
|
Conteúdo: |
In the theory of evidential Dempster's rule is used for combining belief functions based on independent evidences. Three has been a lot of debate over the counter-intuitive nature of results obtained by rule [4, 8, 14, 15]. Dubois and Prade [1,3] have shown that Dempester's rule is not robust and is sensitive to inaccurate estimates of uncertainty values. Many authors have suggested modifications which overcome this drawback. In this paper, we first bring out the limitation of the combination rule introduced by Zhang [16]. Subsequently, we focus our study on two other rules. The first one was proposed by Dubois and Prade [2, 3] and is known as Disjunctive rule of combination. Incidentally, this rule also appeared in the Hau and Kashyap's work [5]. The other combination rule was due to Yager [13]. Even though these rules are robust, we show that in some cases these rules treat evidences asymmetrically and give counter-intuitive results. We then propose a combination rule which doesn't have these drawback. An intuitive justification for this rule is also provided. |
|
Palavras-Chave: |
Inteligência artificial. |
|
Thesaurus Nal: |
Artificial intelligence. |
|
Categoria do assunto: |
X Pesquisa, Tecnologia e Engenharia |
|
Marc: |
LEADER 01899naa a2200217 a 4500
001 1005943
005 2013-12-05
008 1995 bl uuuu u00u1 u #d
020 $a3-540-60436-7
100 1 $aJOSHI, A. V.
245 $aSensitivity of combination schemes under conflicting conditions and a new method.
260 $c1995
300 $ap. 39-48.
490 $a(Lecture notes in artificial intelligence, 991; Lecture notes in computer science).
500 $aSBIA'95. Ed. by Jacques Wainer and Ariadne Carvalho.
520 $aIn the theory of evidential Dempster's rule is used for combining belief functions based on independent evidences. Three has been a lot of debate over the counter-intuitive nature of results obtained by rule [4, 8, 14, 15]. Dubois and Prade [1,3] have shown that Dempester's rule is not robust and is sensitive to inaccurate estimates of uncertainty values. Many authors have suggested modifications which overcome this drawback. In this paper, we first bring out the limitation of the combination rule introduced by Zhang [16]. Subsequently, we focus our study on two other rules. The first one was proposed by Dubois and Prade [2, 3] and is known as Disjunctive rule of combination. Incidentally, this rule also appeared in the Hau and Kashyap's work [5]. The other combination rule was due to Yager [13]. Even though these rules are robust, we show that in some cases these rules treat evidences asymmetrically and give counter-intuitive results. We then propose a combination rule which doesn't have these drawback. An intuitive justification for this rule is also provided.
650 $aArtificial intelligence
653 $aInteligência artificial
700 1 $aSAHASRABUDHE, S. C.
700 1 $aSHANKAR, K.
773 $tIn: BRAZILIAN SYMPOSIUM ON ARTIFICIAL INTELLIGENCE, 12., 1995, Campinas. Advances in artificial intelligence: proceedings. Berlin: Springer, 1995.
Download
Esconder MarcMostrar Marc Completo |
|
Registro original: |
Embrapa Agricultura Digital (CNPTIA) |
|
