Distributed stochastic gradient descent for link prediction in signed social networks

Distributed stochastic gradient descent for link prediction in signed social networks

Abstract This paper considers the link prediction problem defined over a signed social network, where the relationship between any two network users can be either positive (friends) or negative (foes). Given a portion of the relationships, the goal of link prediction is to identify the rest unknown...

Olles dieđut

Bibliográfalaš dieđut
Váldodahkkit: Han Zhang, Gang Wu, Qing Ling
Materiálatiipa: Artihkal
Giella:English
Almmustuhtton: SpringerOpen 2019-01-01
Ráidu:EURASIP Journal on Advances in Signal Processing
Fáttát:
Signed social network
Link prediction
Low-rank matrix completion
Asynchronous distributed optimization
Stochastic gradient descent
Liŋkkat:http://link.springer.com/article/10.1186/s13634-019-0601-0

Interneahtta

http://link.springer.com/article/10.1186/s13634-019-0601-0

Geahča maid