{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,9,30]],"date-time":"2026-09-30T16:06:07Z","timestamp":1790784367470,"version":"4.1.0"},"reference-count":44,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2019,5,6]],"date-time":"2019-05-06T00:00:00Z","timestamp":1557100800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Knowl Inf Syst"],"published-print":{"date-parts":[[2020,2]]},"DOI":"10.1007\/s10115-019-01364-z","type":"journal-article","created":{"date-parts":[[2019,5,6]],"date-time":"2019-05-06T16:32:55Z","timestamp":1557160375000},"page":"571-610","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":21,"title":["Random walk-based ranking in signed social networks: model and algorithms"],"prefix":"10.1007","volume":"62","author":[{"given":"Jinhong","family":"Jung","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Woojeong","family":"Jin","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"U","family":"Kang","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2019,5,6]]},"reference":[{"key":"1364_CR1","doi-asserted-by":"crossref","unstructured":"Backstrom L, Leskovec J (2011) Supervised random walks: predicting and recommending links in social networks. In: Proceedings of the fourth ACM international conference on Web search and data mining. ACM, pp 635\u2013644","DOI":"10.1145\/1935826.1935914"},{"issue":"3","key":"1364_CR2","doi-asserted-by":"publisher","first-page":"173","DOI":"10.14778\/1929861.1929864","volume":"4","author":"B Bahmani","year":"2010","unstructured":"Bahmani B, Chowdhury A, Goel A (2010) Fast incremental and personalized pagerank. Proc VLDB Endow 4(3):173\u2013184","journal-title":"Proc VLDB Endow"},{"issue":"5439","key":"1364_CR3","doi-asserted-by":"publisher","first-page":"509","DOI":"10.1126\/science.286.5439.509","volume":"286","author":"A-L Barab\u00e1si","year":"1999","unstructured":"Barab\u00e1si A-L, Albert R (1999) Emergence of scaling in random networks. Science 286(5439):509\u2013512","journal-title":"Science"},{"key":"1364_CR4","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511804441","volume-title":"Convex optimization","author":"S Boyd","year":"2004","unstructured":"Boyd S, Vandenberghe L (2004) Convex optimization. Cambridge University Press, Cambridge"},{"issue":"5","key":"1364_CR5","doi-asserted-by":"publisher","first-page":"277","DOI":"10.1037\/h0046049","volume":"63","author":"D Cartwright","year":"1956","unstructured":"Cartwright D, Harary F (1956) Structural balance: a generalization of heider\u2019s theory. Psychol Rev 63(5):277","journal-title":"Psychol Rev"},{"issue":"2","key":"1364_CR6","doi-asserted-by":"publisher","first-page":"181","DOI":"10.1177\/001872676702000206","volume":"20","author":"JA Davis","year":"1967","unstructured":"Davis JA (1967) Clustering and structural balance in graphs. Hum Relat 20(2):181\u2013187","journal-title":"Hum Relat"},{"issue":"1","key":"1364_CR7","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/62038.62043","volume":"15","author":"IS Duff","year":"1989","unstructured":"Duff IS, Grimes RG, Lewis JG (1989) Sparse matrix test problems. ACM Trans Math Softw (TOMS) 15(1):1\u201314","journal-title":"ACM Trans Math Softw (TOMS)"},{"key":"1364_CR8","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511761942","volume-title":"Networks, crowds, and markets: reasoning about a highly connected world","author":"D Easley","year":"2010","unstructured":"Easley D, Kleinberg J (2010) Networks, crowds, and markets: reasoning about a highly connected world. Cambridge University Press, Cambridge"},{"issue":"5","key":"1364_CR9","doi-asserted-by":"publisher","first-page":"442","DOI":"10.14778\/2140436.2140441","volume":"5","author":"Y Fujiwara","year":"2012","unstructured":"Fujiwara Y, Nakatsuji M, Onizuka M, Kitsuregawa M (2012) Fast and exact top-k search for random walk with restart. Proc VLDB Endow 5(5):442\u2013453","journal-title":"Proc VLDB Endow"},{"key":"1364_CR10","unstructured":"Gleich DF, Seshadhri C (2012) Vertex neighborhoods, low conductance cuts, and good seeds for local community methods. In: Proceedings of the 18th ACM SIGKDD international conference on knowledge discovery and data mining. ACM, pp 597\u2013605"},{"key":"1364_CR11","doi-asserted-by":"crossref","unstructured":"Golub GH, Van Loan CF (2012) Matrix computations, vol 3. JHU press","DOI":"10.56021\/9781421407944"},{"key":"1364_CR12","doi-asserted-by":"crossref","unstructured":"Guha R, Kumar R, Raghavan P, Tomkins A (2004) Propagation of trust and distrust. In: Proceedings of the 13th international conference on World Wide Web. ACM, pp 403\u2013412","DOI":"10.1145\/988672.988727"},{"key":"1364_CR13","doi-asserted-by":"crossref","unstructured":"Haveliwala TH (2002) Topic-sensitive pagerank. In: Proceedings of the 11th international conference on World Wide Web. ACM, pp 517\u2013526","DOI":"10.1145\/511446.511513"},{"issue":"1","key":"1364_CR14","doi-asserted-by":"publisher","first-page":"107","DOI":"10.1080\/00223980.1946.9917275","volume":"21","author":"F Heider","year":"1946","unstructured":"Heider F (1946) Attitudes and cognitive organization. J Psychol 21(1):107\u2013112","journal-title":"J Psychol"},{"issue":"3","key":"1364_CR15","doi-asserted-by":"publisher","first-page":"e0213857","DOI":"10.1371\/journal.pone.0213857","volume":"14","author":"W Jin","year":"2019","unstructured":"Jin W, Jung J, Kang U (2019) Supervised and extended restart in random walks for ranking and link prediction in networks. PLoS ONE 14(3):e0213857","journal-title":"PLoS ONE"},{"key":"1364_CR16","doi-asserted-by":"crossref","unstructured":"Jung J, Jin W, Sael L, Kang U (2016) Personalized ranking in signed networks using signed random walk with restart. In: IEEE 16th international conference on data mining, ICDM 2016, December 12\u201315, 2016, Barcelona, Spain, pp\u00a0973\u2013978. http:\/\/dx.doi.org\/10.1109\/ICDM.2016.0122","DOI":"10.1109\/ICDM.2016.0122"},{"key":"1364_CR17","doi-asserted-by":"crossref","unstructured":"Jung J, Park N, Sael L, Kang U (2017) Bepi: Fast and memory-efficient method for billion-scale random walk with restart. In: Proceedings of the 2017 ACM international conference on management of data, SIGMOD conference 2017, Chicago, IL, USA, May 14\u201319, 2017, pp\u00a0789\u2013804","DOI":"10.1145\/3035918.3035950"},{"issue":"2","key":"1364_CR18","doi-asserted-by":"publisher","first-page":"12","DOI":"10.1145\/2901736","volume":"41","author":"J Jung","year":"2016","unstructured":"Jung J, Shin K, Sael L, Kang U (2016) Random walk with restart on large graphs using block elimination. ACM Trans Database Syst 41(2):12. https:\/\/doi.org\/10.1145\/2901736","journal-title":"ACM Trans Database Syst"},{"key":"1364_CR19","doi-asserted-by":"crossref","unstructured":"Kang U, Faloutsos C (2011) Beyond \u2018caveman communities\u2019: hubs and spokes for graph compression and mining, in \u2018ICDM\u2019","DOI":"10.1109\/ICDM.2011.26"},{"key":"1364_CR20","doi-asserted-by":"crossref","unstructured":"Kang U, Tong H, Sun J (2012) Fast random walk graph kernel. In: Proceedings of the twelfth SIAM international conference on data mining, Anaheim, California, USA, April 26-28, 2012, pp\u00a0828\u2013838","DOI":"10.1137\/1.9781611972825.71"},{"issue":"5","key":"1364_CR21","doi-asserted-by":"publisher","first-page":"604","DOI":"10.1145\/324133.324140","volume":"46","author":"JM Kleinberg","year":"1999","unstructured":"Kleinberg JM (1999) Authoritative sources in a hyperlinked environment. J ACM (JACM) 46(5):604\u2013632","journal-title":"J ACM (JACM)"},{"key":"1364_CR22","doi-asserted-by":"crossref","unstructured":"Kleinberg JM (1999) Hubs, authorities, and communities. ACM Comput Surveys (CSUR) f31(4es):5","DOI":"10.1145\/345966.345982"},{"key":"1364_CR23","doi-asserted-by":"crossref","unstructured":"Kunegis J, Lommatzsch A, Bauckhage C (2009) The slashdot zoo: mining a social network with negative edges. In: Proceedings of the 18th international conference on World wide web. ACM, pp 741\u2013750","DOI":"10.1145\/1526709.1526809"},{"issue":"1","key":"1364_CR24","doi-asserted-by":"publisher","first-page":"68","DOI":"10.1007\/BF02985759","volume":"30","author":"AN Langville","year":"2008","unstructured":"Langville AN, Meyer CD, Fern\u00e1ndez P (2008) Googles pagerank and beyond: the science of search engine rankings. Math Intell 30(1):68\u201369","journal-title":"Math Intell"},{"issue":"2","key":"1364_CR25","doi-asserted-by":"publisher","first-page":"131","DOI":"10.1145\/382979.383041","volume":"19","author":"R Lempel","year":"2001","unstructured":"Lempel R, Moran S (2001) Salsa: the stochastic approach for link-structure analysis. ACM Trans Inf Syst (TOIS) 19(2):131\u2013160","journal-title":"ACM Trans Inf Syst (TOIS)"},{"key":"1364_CR26","doi-asserted-by":"crossref","unstructured":"Leskovec J, Huttenlocher D, Kleinberg J (2010) Predicting positive and negative links in online social networks. In: Proceedings of the 19th international conference on World Wide Web. ACM, pp 641\u2013650","DOI":"10.1145\/1772690.1772756"},{"key":"1364_CR27","doi-asserted-by":"crossref","unstructured":"Leskovec J, Huttenlocher D, Kleinberg J (2010) Signed networks in social media. In: Proceedings of the SIGCHI conference on human factors in computing systems. ACM, pp 1361\u20131370","DOI":"10.1145\/1753326.1753532"},{"issue":"12","key":"1364_CR28","doi-asserted-by":"publisher","first-page":"3077","DOI":"10.1109\/TKDE.2014.2320716","volume":"26","author":"Y Lim","year":"2014","unstructured":"Lim Y, Kang U, Faloutsos C (2014) Slashburn: graph compression and mining beyond caveman communities. IEEE Trans Knowl Data Eng 26(12):3077\u20133089","journal-title":"IEEE Trans Knowl Data Eng"},{"key":"1364_CR29","doi-asserted-by":"crossref","unstructured":"Mishra A, Bhattacharya A (2011) Finding the bias and prestige of nodes in networks based on trust scores. In: Proceedings of the 20th international conference on World Wide Web. ACM, pp 567\u2013576","DOI":"10.1145\/1963405.1963485"},{"key":"1364_CR30","unstructured":"Ng AY, Zheng AX, Jordan MI (2001) Stable algorithms for link analysis. In: Proceedings of the 24th annual international ACM SIGIR conference on research and development in information retrieval. ACM, pp 258\u2013266"},{"key":"1364_CR31","unstructured":"Page L, Brin S, Motwani R, Winograd T (1999) The pagerank citation ranking: bringing order to the Web"},{"key":"1364_CR32","doi-asserted-by":"crossref","unstructured":"Saad Y (2003) Iterative methods for sparse linear systems, vol\u00a082. SIAM","DOI":"10.1137\/1.9780898718003"},{"issue":"1","key":"1364_CR33","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/s13278-014-0172-x","volume":"4","author":"M Shahriari","year":"2014","unstructured":"Shahriari M, Jalili M (2014) Ranking nodes in signed social networks. Soc Netw Anal Min 4(1):1\u201312","journal-title":"Soc Netw Anal Min"},{"key":"1364_CR34","doi-asserted-by":"crossref","unstructured":"Shin K, Jung J, Lee S, Kang U (2015) Bear: Block elimination approach for random walk with restart on large graphs. In: Proceedings of the 2015 ACM SIGMOD international conference on management of data. ACM, pp\u00a01571\u20131585","DOI":"10.1145\/2723372.2723716"},{"key":"1364_CR35","doi-asserted-by":"crossref","unstructured":"Song D, Meyer DA (2015) Recommending positive links in signed social networks by optimizing a generalized auc. In: AAAI, pp\u00a0290\u2013296","DOI":"10.1609\/aaai.v29i1.9167"},{"key":"1364_CR36","unstructured":"Strang G (2006) Linear algebra and its applications. Thomson, Brooks\/Cole. https:\/\/books.google.ie\/books?id=q9CaAAAACAAJ"},{"issue":"31","key":"1364_CR37","doi-asserted-by":"publisher","first-page":"13636","DOI":"10.1073\/pnas.1004008107","volume":"107","author":"M Szell","year":"2010","unstructured":"Szell M, Lambiotte R, Thurner S (2010) Multirelational organization of large-scale social networks in an online world. Proc Nat Acad Sci 107(31):13636\u201313641","journal-title":"Proc Nat Acad Sci"},{"key":"1364_CR38","volume-title":"Measure theory and integration","author":"ME Taylor","year":"2006","unstructured":"Taylor ME (2006) Measure theory and integration. American Mathematical Soc, Providence"},{"key":"1364_CR39","doi-asserted-by":"crossref","unstructured":"Tong H, Faloutsos C, Gallagher B, Eliassi-Rad T (2007) Fast best-effort pattern matching in large attributed graphs. In: Proceedings of the 13th ACM SIGKDD international conference on Knowledge discovery and data mining. ACM, pp 737\u2013746","DOI":"10.1145\/1281192.1281271"},{"issue":"3","key":"1364_CR40","doi-asserted-by":"publisher","first-page":"327","DOI":"10.1007\/s10115-007-0094-2","volume":"14","author":"H Tong","year":"2008","unstructured":"Tong H, Faloutsos C, Pan J-Y (2008) Random walk with restart: fast solutions and applications. Knowl Inf Syst 14(3):327\u2013346","journal-title":"Knowl Inf Syst"},{"key":"1364_CR41","doi-asserted-by":"crossref","unstructured":"Wu Z, Aggarwal CC, Sun J (2016) The troll-trust model for ranking in signed networks. In: Proceedings of the ninth ACM international conference on Web search and data mining. ACM, pp\u00a0447\u2013456","DOI":"10.1145\/2835776.2835816"},{"issue":"10","key":"1364_CR42","doi-asserted-by":"publisher","first-page":"1333","DOI":"10.1109\/TKDE.2007.1061","volume":"19","author":"B Yang","year":"2007","unstructured":"Yang B, Cheung WK, Liu J (2007) Community mining from signed social networks. IEEE Trans Knowl Data Eng 19(10):1333\u20131348","journal-title":"IEEE Trans Knowl Data Eng"},{"key":"1364_CR43","doi-asserted-by":"crossref","unstructured":"Yoon M, Jin W, Kang U (2018) Fast and accurate random walk with restart on dynamic graphs with guarantees. In: Proceedings of the 2018 World Wide Web conference on World Wide Web, WWW 2018, Lyon, France, April 23\u201327, 2018, pp\u00a0409\u2013418","DOI":"10.1145\/3178876.3186107"},{"key":"1364_CR44","doi-asserted-by":"crossref","unstructured":"Yoon M, Jung J, Kang U (2018) Tpa: Fast, scalable, and accurate method for approximate random walk with restart on billion scale graphs. In: 34th IEEE international conference on data engineering, ICDE 2018, Paris, France, April 16\u201319, 2018","DOI":"10.1109\/ICDE.2018.00105"}],"container-title":["Knowledge and Information Systems"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10115-019-01364-z.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10115-019-01364-z\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10115-019-01364-z.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,9,16]],"date-time":"2023-09-16T08:40:41Z","timestamp":1694853641000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10115-019-01364-z"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019,5,6]]},"references-count":44,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2020,2]]}},"alternative-id":["1364"],"URL":"https:\/\/doi.org\/10.1007\/s10115-019-01364-z","relation":{},"ISSN":["0219-1377","0219-3116"],"issn-type":[{"value":"0219-1377","type":"print"},{"value":"0219-3116","type":"electronic"}],"subject":[],"published":{"date-parts":[[2019,5,6]]},"assertion":[{"value":"15 June 2017","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"6 April 2019","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"12 April 2019","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"6 May 2019","order":4,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}