检索规则说明:AND代表“并且”;OR代表“或者”;NOT代表“不包含”;(注意必须大写,运算符两边需空一格)
检 索 范 例 :范例一: (K=图书馆学 OR K=情报学) AND A=范并思 范例二:J=计算机应用与软件 AND (U=C++ OR U=Basic) NOT M=Visual
出 处:《计算机工程》2009年第1期138-139,143,共3页Computer Engineering
摘 要:提出基于聚类的P2P电子商务信誉评价算法。该算法根据节点行为的相似性将节点聚类成若干集合,将每个节点集合视为一个节点进行迭代信誉计算。诚实节点行为相似性较高,通常聚类为最大的节点集合,在迭代计算中占主导地位。实验结果表明,与基于社会网络和概率估计的信誉评价体系算法相比,该算法误差较小。This paper presents an aggregation-based reputation evaluation algorithm for P2P e-commerce. The main feature of this algorithm is aggregating peers into several peers groups according to their behavior similarities, and the reputation of these groups is calculated iteratively. The group with the largest amount of peers has priority in the calculation of reputation. The honest peers will aggregate into one group because of their behavior similarity. Experimental results show that this algorithm has less variance compared with the algorithms of social networks or probabilistic estimation based reputation evaluation system.
分 类 号:TP301.6[自动化与计算机技术—计算机系统结构]
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在链接到云南高校图书馆文献保障联盟下载...
云南高校图书馆联盟文献共享服务平台 版权所有©
您的IP:216.73.216.186