max-minimum algorithm for trust transitivity in trustworthy networks

《max-minimum algorithm for trust transitivity in trustworthy networks》由会员上传分享，免费在线阅读，更多相关内容在工程资料-天天文库。

1、2009IEEE/WIC/ACMInternationalConferenceonWebIntelligenceandIntelligentAgentTechnology-Workshops2009IEEE/WIC/ACMInternationalJointConferencesonWebIntelligenceandIntelligentAgentTechnologies2009IEEE/WIC/ACMInternationalJointConferenceonWebIntelligenceandIntelligentAgentTechnologyMax-MinimumAlgorith

2、mforTrustTransitivityinTrustworthyNetworksYixiangChen,Tian-MingBu,MinZhang,HongZhuShanghaiKeyLaboratoryofTrustworthyComputingEastChinaNormalUniversityShanghai200062,ChinaEmails:fyxchen,tmbu,mzhang,hzhug@sei.ecnu.edu.cnAbstract—Inthispaper,wepresentanewmeasuringmethodthetrustareequallyimportant.Th

3、ebelowistheinducedofcomputingthetransitivetrustworthydegreebetweentwotrustworthydigraph-(3=4;1=4)fromFigure1.differentnodes.Inthismeasuringmethod,thetransitivetrustdegreeofuandvalongapathismeasuredintermsoftheminimumweightofalledgesonthepath.Forparallelpathsbetweenuandv,thetransitivetrustdegreeis

4、definedasthemaximumamongthetransitivedegreesofallthesepaths.Weprovethatthemeasuringmethodcanbedoneinpolynomialtime.Keywords-trustworthydegree;max-minalgorithm;I.INTRODUCTIONWein[2]introducethenotionoftrustworthynetworkswhichcanberepresentedasweighteddigraphsG(V;E; ;")whereistheweightfunctionofnode

5、sand"istheweightfunctionofedges.WeightsonnodesrepresentthereputationFigure2:Theinducedweightdigraph-(3=4;1=4)valuesofthesenodesandweightsonedgesrepresenttheIn[2],weintroduceanewmeasuringmethodforsomedirectlytrustvalue(seeDefinition1,[2]).Figure1belowiscircumstances,calledMax-Meanalgorithm,tocalcul

6、atetheasimpleexampleofthetrustworthynetwork.transitivetrustdegreebetweentwodifferentnodesinatrustworthydigraph.Themeanoperatorisdefinedasthetransitivetrustdegreealongapathbycomputingtheaveragevalueofweightsofalledgesonthepath.Itisdifferentfrompreviousalgorithms(e.g.,[1],[9]).Themaximumoperationisu

7、sedtochoosethemaximumvalueifthereareparallelpathsbetweentwodifferentnodes.Abasicproblemistofindthesimplepathwhichhasmaximumaveragetransitivetrustworthydegreeonaweightdigraph,sincecyclesareofnouseincomputingtransitivetru