証拠推論の効率的計算法(一般講演,ライフサイエンスとソフトンピューティング)

• 丸尾 行亮

  大阪工業大学

• 和多田 淳三

  大阪工業大学

書誌事項

タイトル別名

• Efficient Computation of Evidential Reasoning

抄録

The objective of this paper is to employ Demster-Shafer theory into analyzing the hierarchical and logical structure with logical operations AND & OR such as a fault tree. One of main differences of the Dempster-Shafer theory from Baysian one is that it enables us to take the lack of knowledge or information into account in its analyses. The considered set of hypothesis must be mutual exclusive and exhaustive in the Dempster-Shafer theory. In this paper, we define state patterns in order to satisfy the mutual exclusiveness and exhaustiveness. The method using state patterns requires us much computational time to solve the evidential reasoning. In order to overcome this difficulty, we also propose the improved method in terms of logical relations of the events in the fault tree.

収録刊行物

• バイオメディカル・ファジィ・システム学会大会講演論文集

  バイオメディカル・ファジィ・システム学会大会講演論文集 15 (0), 83-88, 2002

  バイオメディカル・ファジィ・システム学会

キーワード

• Evidential reasoning
• Dempster-Shafer theory
• Hierarchical structure

詳細情報

• CRID: 1390001205229399296
• NII論文ID: 110008136214
• DOI: 10.24466/pacbfsa.15.0_83
• ISSN: 24242586
• ISSN: 13451510
• 本文言語コード: en
• データソース種別:
  • JaLC
  • CiNii Articles
• 抄録ライセンスフラグ: 使用不可