Efficient Latent Link Recommendation in Signed Networks
Authors:
Open Access
- 10 August 2015
- conference paper
- Published by Association for Computing Machinery (ACM)
- p. 1105-1114
Abstract
Signed networks, in which the relationship between two nodes can be either positive (indicating a relationship such as trust) or negative (indicating a relationship such as distrust), are becoming increasingly common. A plausible model for user behavior analytics in signed networks can be based upon the assumption that more extreme positive and negative relationships are explored and exploited before less extreme ones. Such a model implies that a personalized ranking list of latent links should place positive links on the top, negative links at the bottom, and unknown status links in between. Traditional ranking metrics, e.g., area under the receiver operating characteristic curve (AUC), are however not suitable for quantifying such a ranking list which includes positive, negative, and unknown status links. To address this issue, a generalized AUC (GAUC) which can measure both the head and tail of a ranking list has been introduced. Since GAUC weights each pairwise comparison equally and the calculation of GAUC requires quadratic time, we derive two lower bounds of GAUC which can be computed in linear time and put more emphasis on ranking positive links on the top and negative links at the bottom of a ranking list. Next, we develop two efficient latent link recommendation (ELLR) algorithms in order to recommend links by directly optimizing these two lower bounds, respectively. Finally, we compare these two ELLR algorithms with top-performing baseline methods over four benchmark datasets, among which the largest network has more than 100 thousand nodes and seven million entries. Thorough empirical studies demonstrate that the proposed ELLR algorithms outperform state-of-the-art approaches for link recommendation in signed networks at no cost in efficiency.Keywords
Funding Information
- Australian Research Council (FT-130101457, DP-140102164)
- National Science Foundation (1223137)
- U.S. Department of Defense Minerva Research Initiative (W911NF-09-1-0081)
This publication has 26 references indexed in Scilit:
- Cross-domain collaboration recommendation2012
- Low rank modeling of signed networks2012
- Link Prediction via Matrix Factorization2011
- Factorization meets the neighborhood2008
- Improving maximum margin matrix factorizationMachine Learning, 2008
- The link‐prediction problem for social networksJournal of the American Society for Information Science and Technology, 2007
- Ordered multiple‐class ROC analysis with continuous measurementsStatistics in Medicine, 2004
- Friends and neighbors on the WebSocial Networks, 2003
- The meaning and use of the area under a receiver operating characteristic (ROC) curve.Radiology, 1982
- A New Status Index Derived from Sociometric AnalysisPsychometrika, 1953