Logical computation of evidential reasoning in a hierarchical structure

Junzo Watada

    研究成果: Conference contribution

    2 被引用数 (Scopus)

    抄録

    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 he 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.

    本文言語English
    ホスト出版物のタイトル2003 IEEE International Symposium on Intelligent Signal Processing: From Classical Measurement to Computing with Perceptions, WISP 2003 - Proceedings
    出版社Institute of Electrical and Electronics Engineers Inc.
    ページ167-172
    ページ数6
    ISBN(印刷版)0780378644, 9780780378643
    DOI
    出版ステータスPublished - 2003
    イベント3rd IEEE International Symposium on Intelligent Signal Processing, WISP 2003 - Budapest, Hungary
    継続期間: 2003 9 6 → …

    Other

    Other3rd IEEE International Symposium on Intelligent Signal Processing, WISP 2003
    国/地域Hungary
    CityBudapest
    Period03/9/6 → …

    ASJC Scopus subject areas

    • 信号処理
    • 電子工学および電気工学
    • 数学 (全般)
    • ソフトウェア
    • コンピュータ サイエンスの応用

    フィンガープリント

    「Logical computation of evidential reasoning in a hierarchical structure」の研究トピックを掘り下げます。これらがまとまってユニークなフィンガープリントを構成します。

    引用スタイル