.png){kind=icon}
Return
Intent-Based Trust Evaluation
.png){kind=icon}
PRE
AI
DOI：10.1109/TKDE.2025.3624874.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
Trust relationships play a crucial role in various domains, such as social spam detection, retweet behavior analytics, and recommendation systems. Trust is often implicit and difficult to observe directly in the real world, as it is driven by people’s underlying intentions and motivations. Therefore, when evaluating trust, it is critical to analyze not only user behavior data but also the intentions behind these behaviors that lead to trust. Existing trust evaluation methods often neglect the underlying reasons behind connections, such as shared hobbies or belonging to the same community. Therefore, these methods cannot differentiate the genuine intentions that lead to trust, resulting in an inaccurate evaluation of hidden trust relationships. To address this issue, we propose a novel Intent-based model for Trust Evaluation (INTRUST). This model can distinguish the intent behind high-order information in social communities using hypergraphs. Initially, we used hyperedges to represent high-order correlations between user-to-item and user-to-user interactions. Then, we construct $K$ intent prototypes, which serve as foundational elements to build trust. Furthermore, we distinguish $K$-independent intent subgraphs from these high-order correlations. To enhance the generalization and robustness of the model, we employ self-supervised learning and construct contrastive views at the node-level, hyperedge-level, and node-hyperedge-level. Extensive experiments on real-world datasets demonstrate that our model outperforms state-of-the-art approaches in terms of trust evaluation accuracy and efficiency.
Keywords:
Trust evaluation
hypergraph
intent distanglement
contrastive learning
Journal
IF:
10.4
Papers:
6.9K
Citations:
3.2W
Organization
Cited Papers
eTrust.png)
Proceedings of the 18th ACM SIGKDD international conference on Knowledge discovery and data mining
Proceedings of the 18th ACM SIGKDD international conference on Knowledge discovery and data miningIF0
PREAI
ShareSaveShareSaveShareSaveThe analysis and implementation of degree centrality in weighted graph in Social Network Analysis
PREAI
ShareSave
View more