Number of the records: 1  

Plausibility in DSmT

  1. 1.
    0379834 - ÚI 2013 RIV DE eng C - Conference Paper (international conference)
    Daniel, Milan
    Plausibility in DSmT.
    Belief Functions: Theory and Applications. Heidelberg: Springer, 2012 - (Denoeux, T.; Masson, M.), s. 179-187. Advances in Intelligent and Soft Computing, 164. ISBN 978-3-642-29460-0. ISSN 1867-5662.
    [International Conference on Belief Functions /2./. Compiègne (FR), 09.05.2012-11.05.2012]
    R&D Projects: GA ČR GAP202/10/1826
    Institutional research plan: CEZ:AV0Z10300504
    Keywords : theory of belief functions * DSm Theory * belief function * plausibility * conflict of belief functions
    Subject RIV: IN - Informatics, Computer Science

    Preparing for generalization of results on conflicts of classic belief function to DSm approach, we need normalized plausibility of singletons also in DSmT. To enable this, plausibility of DSm generalized belief functions is analyzed and compared on entire spectrum of DSm models for various types of belief functions; from simple uniform distribution, through general classic belief function, to general generalized belief function in full generality. Both numeric and comparative variability with respect to particular DSm models has been observed and described. This comparative study enables deeper understanding of plausibility in DSm approach and also underlines the sensitivity to selection of particular DSm models. Figure of elements of DSm domain—DSm hyper-power set—and figures representing particular DSm models (the free DSm model, hybrid DSm models, and Shafer’s model) throughout the text enable better understanding of DSm principles. Further, a notion of non-conflicting DSm model is introduced and characterized towards the end of the study.
    Permanent Link: http://hdl.handle.net/11104/0210702

     
    FileDownloadSizeCommentaryVersionAccess
    a0379834.pdf01.1 MBPublisher’s postprintrequire
     
Number of the records: 1  

  This site uses cookies to make them easier to browse. Learn more about how we use cookies.