信任网络中的信任实体重要性发现方法  

Important Nodes Discovery in Trust Network

作　　者：郭伟鹏[1] 龚卫华[1] 

机构地区：[1]浙江工业大学计算机科学与技术学院,杭州310023

出　　处：《计算机系统应用》2014年第5期213-217,共5页Computer Systems & Applications

基　　金：国家自然科学基金(61070042);浙江省自然科学基金(LY13F020026;Y1080102)

摘　　要：信任网络是开放网络环境下抵御恶意欺诈、降低用户交互风险的有效手段,现有关于信任网络的研究集中于信任评价的传播和计算策略,对信任网络中实体重要性没有足够的重视.本文提出一种信任序列模式挖掘算法T-Seq,将信任传播过程作为信任序列,通过序列挖掘方法有效找出信任网络中的重要信任节点.实验表明了T-Seq算法在信任序列模式挖掘和重要节点发现上的有效性.Trust network is an effective means of resisting malicious fraud and reducing the risk of interactions between users. Most of existing researches focus on trust propagation and aggregation strategies, while pay little attention to the importance of agents. This paper presents a sequential pattern mining algorithm which called T-Seq, in which trust propagation process is regarded as trust sequences. It is effective in important nodes discovery through sequences mining. Experiments showed the effectiveness of T-Seq in sequential pattern mining and important nodes discovery.

关 键 词：信任网络 节点重要性 信任传播 信任路径 序列挖掘 

分 类 号：TP393.08[自动化与计算机技术—计算机应用技术]