Social trust prediction using heterogeneous networks
Authors:
Open Access
- 1 November 2013
- journal article
- research article
- Published by Association for Computing Machinery (ACM) in ACM Transactions on Knowledge Discovery From Data
- Vol. 7 (4) , 1-21
Abstract
Along with increasing popularity of social websites, online users rely more on the trustworthiness information to make decisions, extract and filter information, and tag and build connections with other users. However, such social network data often suffer from severe data sparsity and are not able to provide users with enough information. Therefore, trust prediction has emerged as an important topic in social network research. Traditional approaches are primarily based on exploring trust graph topology itself. However, research in sociology and our life experience suggest that people who are in the same social circle often exhibit similar behaviors and tastes. To take advantage of the ancillary information for trust prediction, the challenge then becomes what to transfer and how to transfer. In this article, we address this problem by aggregating heterogeneous social networks and propose a novel joint social networks mining (JSNM) method. Our new joint learning model explores the user-group-level similarity between correlated graphs and simultaneously learns the individual graph structure; therefore, the shared structures and patterns from multiple social networks can be utilized to enhance the prediction tasks. As a result, we not only improve the trust prediction in the target graph but also facilitate other information retrieval tasks in the auxiliary graphs. To optimize the proposed objective function, we use the alternative technique to break down the objective function into several manageable subproblems. We further introduce the auxiliary function to solve the optimization problems with rigorously proved convergence. The extensive experiments have been conducted on both synthetic and real- world data. All empirical results demonstrate the effectiveness of our method.Keywords
This publication has 29 references indexed in Scilit:
- Exact matrix completion via convex optimizationCommunications of the ACM, 2012
- Non-negative Matrix Factorization on Manifold2008
- Convex and Semi-Nonnegative Matrix FactorizationsIEEE Transactions on Pattern Analysis and Machine Intelligence, 2008
- Feedback effects between similarity and social influence in online communities2008
- Semi-Supervised Learning2006
- The relationship between Precision-Recall and ROC curves2006
- Link miningACM SIGKDD Explorations Newsletter, 2005
- Propagation of trust and distrust2004
- Convex Optimization2004
- An algorithmic framework for performing collaborative filtering1999