Optimal Trust Network Analysis with Subjective Logic

dc.contributor.author	Josang, Audun
dc.contributor.author	Bhuiyan, Touhid
dc.date.accessioned	2018-09-12T09:01:17Z
dc.date.accessioned	2019-05-27T09:59:33Z
dc.date.available	2018-09-12T09:01:17Z
dc.date.available	2019-05-27T09:59:33Z
dc.date.issued	2008-09-09
dc.identifier.uri	http://hdl.handle.net/20.500.11948/3190
dc.description.abstract	Trust network analysis with subjective logic (TNA-SL) simplifies complex trust graphs into series-parallel graphs by removing the most uncertain paths to obtain a canonical graph. This simplification could in theory cause loss of information and thereby lead to sub-optimal results. This paper describes a new method for trust network analysis which is considered optimal because it does not require trust graph simplification, but instead uses edge splitting to obtain a canonical graph. The new method is compared with TNA-SL, and our simulation shows that both methods produce equal results. This indicates that TNA-SL in fact also represents an optimal method for trust network analysis and that the trust graph simplification does not affect the result. Full Text Link: http://doi.org/10.1109/SECURWARE.2008.64	en_US
dc.language.iso	en	en_US
dc.publisher	IEEE Xplore	en_US
dc.subject	Uncertainty	en_US
dc.subject	Probability density function	en_US
dc.subject	Indexes	en_US
dc.subject	Ions	en_US
dc.subject	Bayesian methods	en_US
dc.subject	Connectors	en_US
dc.subject	Probability	en_US
dc.title	Optimal Trust Network Analysis with Subjective Logic	en_US
dc.type	Article	en_US