论文标题
在线社交网络中有时间感知的环境感知的深层信任预测
Towards Time-Aware Context-Aware Deep Trust Prediction in Online Social Networks
论文作者
论文摘要
信任可以定义为确定哪种信息来源可靠以及我们应该分享的信息或我们应该接受信息的措施。在线社交网络(OSN)中有多种信任应用程序,包括社交垃圾邮件发送者检测,假新闻检测,转发行为检测和推荐系统。信任预测是预测当前未连接的两个用户之间建立新的信任关系的过程。在信任的应用中,需要预测用户之间的信任关系。该过程面临许多挑战,例如用户指定信任关系的稀疏性,对信任的上下文意识以及随着时间的推移信任价值的变化。在本文中,我们在OSN中分析了配对信任预测模型中的最先进。我们讨论了该领域中的三个主要挑战,并提出了新颖的信任预测方法来解决它们。我们首先专注于提出用户的低排名表示,将用户的性格特质作为其他信息。然后,我们建议一组上下文感知信任预测模型。最后,通过考虑信任关系的时间依赖性,我们提出了一种动态的深层信任预测方法。我们设计并实施了五种合适的信任预测方法,并使用从OSN收集的现实世界数据集对其进行评估。实验结果证明了与其他最先进的成对信任预测模型相比,我们的方法的有效性。
Trust can be defined as a measure to determine which source of information is reliable and with whom we should share or from whom we should accept information. There are several applications for trust in Online Social Networks (OSNs), including social spammer detection, fake news detection, retweet behaviour detection and recommender systems. Trust prediction is the process of predicting a new trust relation between two users who are not currently connected. In applications of trust, trust relations among users need to be predicted. This process faces many challenges, such as the sparsity of user-specified trust relations, the context-awareness of trust and changes in trust values over time. In this dissertation, we analyse the state-of-the-art in pair-wise trust prediction models in OSNs. We discuss three main challenges in this domain and present novel trust prediction approaches to address them. We first focus on proposing a low-rank representation of users that incorporates users' personality traits as additional information. Then, we propose a set of context-aware trust prediction models. Finally, by considering the time-dependency of trust relations, we propose a dynamic deep trust prediction approach. We design and implement five pair-wise trust prediction approaches and evaluate them with real-world datasets collected from OSNs. The experimental results demonstrate the effectiveness of our approaches compared to other state-of-the-art pair-wise trust prediction models.