共查询到19条相似文献,搜索用时 203 毫秒
1.
2.
3.
4.
一种基于实体上下文和时间戳的信任预测模型 总被引:1,自引:0,他引:1
信任是网络计算模式下实体交互与协同的基础,如何准确地定量表示和评估信任是研究重点。该文提出以实体上下文和时间戳为条件的信任预测模型,建立了粒度为8的信任等级空间,引入了多维测量指标度量实体交互满意度,使得满意度计算更加精确。构建了具有时间衰减性的直接信任求解方法,克服了已有模型动态适应能力不足的问题。把推荐信任划分为直接推荐和间接推荐,在直接推荐信任求解中引入实体评分相似度因子,在间接推荐信任计算中提出了基于路径衰减的方法。提出了一种分布式树型存储机制DST(Distributed Storage Tree),提高了模型的稳定性和可扩展性。模拟实验表明,与已有同类型模型相比,该模型更有效和准确地提供决策依据,并且在抑制恶意实体方面具有明显作用。 相似文献
5.
构建一个基于上下文因素的多维度P2P信任模型,结合考虑时间衰减、交互重要性和交互次数度量实体交互信任,基于Dice相似度给出信任相似度算法,设计一种多链路反馈可信度融合算法,聚合直接交互、评价相似度和信任链传递计算实体的推荐信任,综合直接信任和推荐信任进行实体信任的评估,并提出一种新的信任更新和奖惩机制。实例分析表明,模型较好地体现了上下文因素对信任计算的影响,增强了模型在上下文因素的敏感性。 相似文献
6.
7.
8.
9.
10.
构建了一种基于交互感知的动态自适应信任评估模型,将历史交互窗口和可信推荐数引入到了总体信任评估中,克服了传统模型对交互证据感知能力不足的问题。提出了基于满意度迭代的直接信任积累方法,并采用实体稳定度实现了激励和惩罚2种迭代策略,有效抑制了恶意伪装实体的作弊行为。给出了一种基于直接和间接相结合的综合推荐信任聚合方法,通过引入实体熟悉度和评分相似度解决了传统模型推荐准确度低和不可靠的问题。实验结果表明,与已有模型相比,该模型有效地提高了信任评估的准确性,并具有更强的抵御串谋实体协同作弊的能力。 相似文献
11.
12.
信息评分预测和信任预测是社交评价网络中的两大基本问题.为应对在提高两类基本问题预测准确性过程中遇到的评分数据与信任关系数据稀疏问题,本文提出了一种基于协同矩阵分解的信息评分与信任预测联合模型.该模型在将评分矩阵与信任关系矩阵进行协同分解时,既能保证被分解的两个矩阵分解过程共享用户潜在变量,又能兼顾两个矩阵分解过程中能够各自获得反映本领域知识相关性的表达.使用分解得到的多个相关低维潜在变量矩阵乘积即可做出评分与信任两个问题的预测.两个真实网络数据集上的实验验证了提出模型有效性和先进性. 相似文献
13.
When dealing with the ratings from users, traditional collaborative filtering algorithms do not consider the credibility of rating data, which affects the accuracy of similarity. To address this issue, the paper proposes an improved algorithm based on classification and user trust. It firstly classifies all the ratings by the categories of items. And then, for each category, it evaluates the trustworthy degree of each user on the category and imposes the degree on the ratings of the user. Finally, the algorithm explores the similarities between users, finds the nearest neighbors, and makes recommendations within each category. Simulations show that the improved algorithm outperforms the traditional collaborative filtering algorithms and enhances the accuracy of recommendation. 相似文献
14.
基于k-近邻的协同过滤推荐算法对于邻居数量k的确定过于主观,并且推荐时以k-近邻均值加权推荐不够准确.针对这两个问题,本文首先引入并改进最大最小距离聚类算法,进而设计启发式聚类模型将用户进行不规定类别数的自由聚类划分,目标用户所在类的用户为邻居用户,客观确定邻居数量;然后在推荐时定义类别相似度,针对性地建立目标用户未评分和评分项目的潜在类别关系,改进k-近邻均值加权算法.实验结果表明,该算法提高了推荐准确度(约0.035MAE). 相似文献
15.
16.
17.
18.
即时通信(IM,Instant Messaging)网络已成为恶意代码传播的主要途径之一,本文提出了一种基于社会计算的IM恶意代码防御机制:利用用户与好友之间的社会信任关系,通过社会计算集成网络中多种反病毒软件的检测结果及用户的安全经验形成群体智慧,从而构成一个分布式协作防御机制.该机制利用即时通信网络平台,并依据好友间的交互行为计算动态信任,在IM客户端部署方案,用户之间实时相互协作抵御通过IM传播的恶意代码.实验结果表明,在大多数用户接受好友警告的情况下,即时通信网络中所有节点最终都被免疫,提高了整个社会网络防御IM恶意代码的能力. 相似文献
19.
Lu Weifeng Zhu Mingqi Xu Jia Chen Siguang Yang Lijun Xu Jian 《International Journal of Communication Systems》2020,33(9)
Content sharing via device‐to‐device (D2D) communications has become a promising method to increase system throughput and reduce traffic load. Due to the characteristic of spectrum sharing in D2D network, confidentiality is becoming a key issue in content transmission. Secure communication in D2D networks is generally guaranteed by a physical‐layer security mechanism. However, this method sacrifices the system transmission rate while ensuring security. Since mobile devices are carried by humans, we can leverage their trust relations to enhance the security of communications. As much, considering the psychology structure and social attributes of mobile users, we build a multidimensional trust evaluation mechanism to evaluate the trust relationship between users, and we pick out the trusted users based on the decision‐theoretic rough sets. By sharing content only between trust users, we can enhance the security of content transmissions without relying on physical‐layer security measures. Meanwhile, content caching is now widely used to improve accessing efficiency and reduce traffic load on cellular networks. However, caching content for other users incurs additional cost, which results in selfish and noncooperative behavior in users. Considering such selfishness, we introduce a cooperative caching game based on multidimensional trust relations to motivate users to cache contents for other devices. In this game, the trust relations and physical distance between two users are considered to formulate the cost function. Furthermore, we introduce an incentive caching algorithm based on social trust to minimize the total cost in the D2D network. 相似文献