{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,29]],"date-time":"2025-09-29T08:26:44Z","timestamp":1759134404369},"reference-count":26,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2019,1,18]],"date-time":"2019-01-18T00:00:00Z","timestamp":1547769600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"}],"funder":[{"name":"China NSF","award":["61573331"],"award-info":[{"award-number":["61573331"]}]},{"name":"Anhui NSF","award":["1608085QF130"],"award-info":[{"award-number":["1608085QF130"]}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["EURASIP J. Adv. Signal Process."],"published-print":{"date-parts":[[2019,12]]},"DOI":"10.1186\/s13634-019-0601-0","type":"journal-article","created":{"date-parts":[[2019,1,18]],"date-time":"2019-01-18T13:02:56Z","timestamp":1547816576000},"update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":6,"title":["Distributed stochastic gradient descent for link prediction in signed social networks"],"prefix":"10.1186","volume":"2019","author":[{"given":"Han","family":"Zhang","sequence":"first","affiliation":[]},{"given":"Gang","family":"Wu","sequence":"additional","affiliation":[]},{"given":"Qing","family":"Ling","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2019,1,18]]},"reference":[{"key":"601_CR1","unstructured":"J. Leskovec, D. Huttenlocher, J. Kleinberg, in Proceedings of the SIGCHI Conference on Human Factors in Computing Systems. Signed networks in social media, (2010), pp. 1361\u20131370."},{"issue":"5","key":"601_CR2","doi-asserted-by":"publisher","first-page":"277","DOI":"10.1037\/h0046049","volume":"63","author":"D. Cartwright","year":"1956","unstructured":"D. Cartwright, F. Harary, Structural balance: a generalization of Heider\u2019s theory. Psychol. Rev.63(5), 277\u2013293 (1956).","journal-title":"Psychol. Rev."},{"key":"601_CR3","unstructured":"R. Guha, R. Kumar, P. Raghavan, A. Tomkins, in Proceedings of the 13th International Conference on World Wide Web. Propagation of trust and distrust, (2004), pp. 403\u2013412."},{"key":"601_CR4","unstructured":"J. Leskovec, D. Huttenlocher, J. Kleinberg, in Proceedings of the 19th International Conference on World Wide Web. Predicting positive and negative links in online social networks, (2010), pp. 641\u2013650."},{"key":"601_CR5","unstructured":"K. -Y. Chiang, N. Natarajan, A. Tewari, I. S. Dhillon, in Proceedings of the 20th ACM International Conference on Information and Knowledge Management. Exploiting longer cycles for link prediction in signed networks, (2011), pp. 1157\u20131162."},{"issue":"1","key":"601_CR6","first-page":"1177","volume":"15","author":"K. -Y. Chiang","year":"2014","unstructured":"K. -Y. Chiang, C. -J. Hsieh, N. Natarajan, I. S. Dhillon, A. Tewari, Prediction and clustering in signed networks: a local to global perspective. J. Mach. Learn. Res.15(1), 1177\u20131213 (2014).","journal-title":"J. Mach. Learn. Res."},{"issue":"2","key":"601_CR7","doi-asserted-by":"publisher","first-page":"24","DOI":"10.1145\/2501977","volume":"5","author":"A. Javari","year":"2014","unstructured":"A. Javari, M. Jalili, Cluster-based collaborative filtering for sign prediction in social networks with positive and negative links. ACM Trans. Intell. Syst. Technol.5(2), 24 (2014).","journal-title":"ACM Trans. Intell. Syst. Technol."},{"issue":"2","key":"601_CR8","doi-asserted-by":"publisher","first-page":"181","DOI":"10.1177\/001872676702000206","volume":"20","author":"J. A. Davis","year":"1967","unstructured":"J. A. Davis, Clustering and structural balance in graphs. Hum. Relat.20(2), 181\u2013187 (1967).","journal-title":"Hum. Relat."},{"key":"601_CR9","unstructured":"C. -J. Hsieh, K. -Y. Chiang, I. S. Dhillon, in Proceedings of the 18th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining. Low rank modeling of signed networks, (2012), pp. 507\u2013515."},{"issue":"3","key":"601_CR10","doi-asserted-by":"publisher","first-page":"471","DOI":"10.1137\/070697835","volume":"52","author":"B. Recht","year":"2010","unstructured":"B. Recht, M. Fazel, P. A. Parrilo, Guaranteed minimum-rank solutions of linear matrix equations via nuclear norm minimization. SIAM Rev.52(3), 471\u2013501 (2010).","journal-title":"SIAM Rev."},{"issue":"2","key":"601_CR11","doi-asserted-by":"publisher","first-page":"183","DOI":"10.1007\/s10208-011-9084-6","volume":"11","author":"D. Goldfarb","year":"2011","unstructured":"D. Goldfarb, S. Ma, Convergence of fixed-point continuation algorithms for matrix rank minimization. Found. Comput. Math.11(2), 183\u2013210 (2011).","journal-title":"Found. Comput. Math."},{"issue":"4","key":"601_CR12","doi-asserted-by":"publisher","first-page":"1956","DOI":"10.1137\/080738970","volume":"20","author":"J. Cai","year":"2010","unstructured":"J. Cai, E. J. Candes, Z. Shen, A singular value thresholding algorithm for matrix completion. SIAM J. Optim.20(4), 1956\u20131982 (2010).","journal-title":"SIAM J. Optim."},{"issue":"8","key":"601_CR13","doi-asserted-by":"publisher","first-page":"30","DOI":"10.1109\/MC.2009.263","volume":"42","author":"Y. Koren","year":"2009","unstructured":"Y. Koren, R. M. Bell, C. Volinsky, Matrix factorization techniques for recommender systems. IEEE Comput.42(8), 30\u201337 (2009).","journal-title":"IEEE Comput."},{"key":"601_CR14","unstructured":"R. Ge, F. Huang, C. Jin, Y. Yuan, in Conference on Learning Theory. Escaping from saddle points\u2013online stochastic gradient for tensor decomposition, (2015), pp. 797\u2013842."},{"key":"601_CR15","unstructured":"Q. You, O. Wu, G. Luo, W. Hu, in Machine Learning and Data Mining in Pattern Recognition. A probabilistic matrix factorization method for link sign prediction in social networks, (2016), pp. 15\u2013420."},{"issue":"1","key":"601_CR16","doi-asserted-by":"publisher","first-page":"91","DOI":"10.1007\/s13278-016-0401-6","volume":"6","author":"M. Shahriari","year":"2016","unstructured":"M. Shahriari, O. A. Sichani, J. Gharibshah, M. Jalili, Sign prediction in social networks based on users reputation and optimism. Soc. Network Anal. Min.6(1), 91 (2016).","journal-title":"Soc. Network Anal. Min."},{"key":"601_CR17","unstructured":"A. Javari, H. Qiu, E. Barzegaran, M. Jalili, K. C. -C. Chang, in Proceedings of the 17th IEEE International Conference on Data Mining. Statistical link label modeling for sign prediction: smoothing sparsity by joining local and global information, (2017), pp. 1039\u20131044."},{"key":"601_CR18","unstructured":"R. Gemulla, E. Nijkamp, P. J. Haas, Y. Sismanis, in Proceedings of the 17th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining. Large-scale matrix factorization with distributed stochastic gradient descent, (2011), pp. 69\u201377."},{"issue":"1","key":"601_CR19","doi-asserted-by":"publisher","first-page":"2","DOI":"10.1145\/2668133","volume":"6","author":"W. Chin","year":"2015","unstructured":"W. Chin, Y. Zhuang, Y. Juan, C. Lin, A fast parallel stochastic gradient method for matrix factorization in shared memory systems. ACM Trans. Intell. Syst. Technol.6(1), 2 (2015).","journal-title":"ACM Trans. Intell. Syst. Technol."},{"key":"601_CR20","doi-asserted-by":"crossref","unstructured":"A. Mokhtari, A. Koppel, A. Ribeiro, A class of parallel doubly stochastic algorithms for large-scale learning. arXiv preprint arXiv:1606.04991 (2016).","DOI":"10.1109\/ACC.2016.7526120"},{"key":"601_CR21","unstructured":"H. Zhang, C. -J. Hsieh, V. Akella, in Proceedings of the 16th IEEE International Conference on Data Mining. Hogwild++: a new mechanism for decentralized asynchronous stochastic gradient descent, (2016), pp. 629\u2013638."},{"key":"601_CR22","unstructured":"R. Hannah, W. Yin, More iterations per second, same quality\u2013why asynchronous algorithms may drastically outperform traditional ones. arXiv preprint arXiv:1708.05136 (2017)."},{"key":"601_CR23","unstructured":"S. Dutta, G. Joshi, S. Ghosh, P. Dube, P. Nagpurkar, Slow and stale gradients can win the race: error-runtime trade-offs in distributed sgd. arXiv preprint arXiv:1803.01113 (2018)."},{"key":"601_CR24","first-page":"400","volume":"22","author":"H. Robbins","year":"1951","unstructured":"H. Robbins, S. Monro, aa stochastic approximation method, \u2218 annals math. Statistics. 22:, 400\u2013407 (1951).","journal-title":"Statistics"},{"key":"601_CR25","unstructured":"L. Bottou, in Proceedings of 19th International Conference on Computational Statistics. Large-scale machine learning with stochastic gradient descent, (2010), pp. 177\u2013186."},{"key":"601_CR26","unstructured":"B. Recht, C. Re, S. Wright, F. Niu, in Advances in Neural Information Processing Systems. Hogwild!: a lock-free approach to parallelizing stochastic gradient descent, (2011), pp. 693\u2013701."}],"container-title":["EURASIP Journal on Advances in Signal Processing"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1186\/s13634-019-0601-0.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1186\/s13634-019-0601-0\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1186\/s13634-019-0601-0.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,1,18]],"date-time":"2020-01-18T00:06:59Z","timestamp":1579306019000},"score":1,"resource":{"primary":{"URL":"https:\/\/asp-eurasipjournals.springeropen.com\/articles\/10.1186\/s13634-019-0601-0"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019,1,18]]},"references-count":26,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2019,12]]}},"alternative-id":["601"],"URL":"https:\/\/doi.org\/10.1186\/s13634-019-0601-0","relation":{},"ISSN":["1687-6180"],"issn-type":[{"value":"1687-6180","type":"electronic"}],"subject":[],"published":{"date-parts":[[2019,1,18]]},"assertion":[{"value":"4 April 2018","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"3 January 2019","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"18 January 2019","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"The authors declare that they have no competing interests.","order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Competing interests"}},{"value":"Springer Nature remains neutral with regard to jurisdictional claims in published maps and institutional affiliations.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Publisher\u2019s Note"}}],"article-number":"3"}}