English  |  正體中文  |  简体中文  |  Post-Print筆數 : 27 |  Items with full text/Total items : 113648/144635 (79%)
Visitors : 51571111      Online Users : 527
RC Version 6.0 © Powered By DSPACE, MIT. Enhanced by NTU Library IR team.
Scope Tips:
  • please add "double quotation mark" for query phrases to get precise results
  • please goto advance search for comprehansive author search
  • Adv. Search
    HomeLoginUploadHelpAboutAdminister Goto mobile version
    政大機構典藏 > 資訊學院 > 資訊科學系 > 期刊論文 >  Item 140.119/75885
    Please use this identifier to cite or link to this item: https://nccur.lib.nccu.edu.tw/handle/140.119/75885


    Title: On state-space abstraction for anytime evaluation of Bayesian networks
    Authors: Liu, Chao-lin;Wellman, Michael P.
    劉昭麟
    Contributors: 資科系
    Date: 1996
    Issue Date: 2015-06-17 15:07:54 (UTC+8)
    Abstract: Despite the increasing popularity of Bayesian networks for representing and reasoning about uncertain situations, the complexity of inference in this formalism remains a significant concern. A viable approach to relieving the problem is trading off accuracy for computational efficiency. To this end, varying the granularity of state space of state variables appears to be a feasible strategy for controlling the evaluation process. We consider an anytime procedure for approximate evaluation of Bayesian networks based on this idea. On application to some simple networks, the procedure exhibits a smooth improvement in approximation quality as computation time increases. With the aim of developing principled control techniques, we also conduct a theoretical analysis of the quality of approximation. Our main result demonstrates that the error induced by state-space abstraction deceases with the distance from the abstracted nodes, where "distance" is defined in terms of d-separation. While the empirical results suggest that incremental state-space abstraction offers a viable performance profile, the theoretical results represent a starting point for the deliberation scheduling of our anytime approximation method.
    Relation: Intelligence/sigart Bulletin - SIGART , vol. 7, no. 2, pp. 50-57
    Data Type: article
    DOI 連結: http://dx.doi.org/10.1145/242587.242601
    DOI: 10.1145/242587.242601
    Appears in Collections:[資訊科學系] 期刊論文

    Files in This Item:

    File Description SizeFormat
    p50-liu.pdf818KbAdobe PDF2741View/Open


    All items in 政大典藏 are protected by copyright, with all rights reserved.


    社群 sharing

    著作權政策宣告 Copyright Announcement
    1.本網站之數位內容為國立政治大學所收錄之機構典藏,無償提供學術研究與公眾教育等公益性使用,惟仍請適度,合理使用本網站之內容,以尊重著作權人之權益。商業上之利用,則請先取得著作權人之授權。
    The digital content of this website is part of National Chengchi University Institutional Repository. It provides free access to academic research and public education for non-commercial use. Please utilize it in a proper and reasonable manner and respect the rights of copyright owners. For commercial use, please obtain authorization from the copyright owner in advance.

    2.本網站之製作,已盡力防止侵害著作權人之權益,如仍發現本網站之數位內容有侵害著作權人權益情事者,請權利人通知本網站維護人員(nccur@nccu.edu.tw),維護人員將立即採取移除該數位著作等補救措施。
    NCCU Institutional Repository is made to protect the interests of copyright owners. If you believe that any material on the website infringes copyright, please contact our staff(nccur@nccu.edu.tw). We will remove the work from the repository and investigate your claim.
    DSpace Software Copyright © 2002-2004  MIT &  Hewlett-Packard  /   Enhanced by   NTU Library IR team Copyright ©   - Feedback