{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,23]],"date-time":"2026-06-23T22:04:51Z","timestamp":1782252291955,"version":"3.54.5"},"reference-count":33,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[2013,6,2]],"date-time":"2013-06-02T00:00:00Z","timestamp":1370131200000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["World Wide Web"],"published-print":{"date-parts":[[2014,7]]},"DOI":"10.1007\/s11280-013-0228-2","type":"journal-article","created":{"date-parts":[[2013,6,1]],"date-time":"2013-06-01T08:16:21Z","timestamp":1370074581000},"page":"743-776","source":"Crossref","is-referenced-by-count":47,"title":["Transitive node similarity: predicting and recommending links in signed social networks"],"prefix":"10.1007","volume":"17","author":[{"given":"Panagiotis","family":"Symeonidis","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Eleftherios","family":"Tiakas","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2013,6,2]]},"reference":[{"issue":"3","key":"228_CR1","doi-asserted-by":"crossref","first-page":"187","DOI":"10.1016\/j.socnet.2005.01.007","volume":"27","author":"L Adamic","year":"2005","unstructured":"Adamic, L., Adar, E.: How to search a social network. Social Netw. 27(3):187\u2013203 (2005)","journal-title":"Social Netw."},{"key":"228_CR2","doi-asserted-by":"crossref","unstructured":"Auber, D.: Tulip: a huge graph visualization framework. In: Graph Drawing Softwares, Mathematics and Visualization, pp.\u00a0105\u2013126 (2003)","DOI":"10.1007\/978-3-642-18638-7_5"},{"issue":"2","key":"228_CR3","doi-asserted-by":"crossref","first-page":"213","DOI":"10.1007\/s11280-011-0143-3","volume":"15","author":"H Bisgin","year":"2012","unstructured":"Bisgin, H., Agarwal, N., Xu, X.: A study of homophily on social media. World Wide Web 15(2), 213\u2013232 (2012)","journal-title":"World Wide Web"},{"key":"228_CR4","unstructured":"Blog, F.: http:\/\/blog.facebook.com\/blog.php?post=15610312130"},{"issue":"4","key":"228_CR5","doi-asserted-by":"crossref","first-page":"647","DOI":"10.1137\/S0036144502415960","volume":"46","author":"VD Blondel","year":"2004","unstructured":"Blondel, V.D., Gajardo, A., Heymans, M., Senellart, P., Van\u00a0Dooren, P.: A measure of similarity between graph vertices: applications to synonym extraction and web searching. SIAM Rev. 46(4), 647\u2013666 (2004)","journal-title":"SIAM Rev."},{"key":"228_CR6","doi-asserted-by":"crossref","unstructured":"Chen, J., Geyer, W., Dugan, C., Muller, M., Guy, I.: Make new friends, but keep the old: recommending people on social networking sites. In: Proceedings 27th International Conference on Human Factors in Computing Systems (CHI), pp. 201\u2013210 (2009)","DOI":"10.1145\/1518701.1518735"},{"issue":"7191","key":"228_CR7","doi-asserted-by":"crossref","first-page":"98","DOI":"10.1038\/nature06830","volume":"453","author":"A Clauset","year":"2008","unstructured":"Clauset, A., Moore, C., Newman, M.E.J.: Hierarchical structure and the prediction of missing links in networks. Nature 453(7191), 98\u2013101 (2008)","journal-title":"Nature"},{"key":"228_CR8","volume-title":"Introduction to Algorithms","author":"T Cormen","year":"2001","unstructured":"Cormen, T., Leiserson, C., Rivest, R., Stein, S.: Introduction to Algorithms, 3rd edn. MIT, Cambridge (2001)","edition":"3"},{"issue":"1","key":"228_CR9","doi-asserted-by":"crossref","first-page":"167","DOI":"10.1080\/00018730601170527","volume":"56","author":"L Costa","year":"2007","unstructured":"Costa, L., Rodrigues, F., Travieso, G., Boas, P.: Characterization of complex networks: a survey of measurements. Adv. Phys. 56(1), 167\u2013242 (2007)","journal-title":"Adv. Phys."},{"issue":"3","key":"228_CR10","doi-asserted-by":"crossref","first-page":"355","DOI":"10.1109\/TKDE.2007.46","volume":"19","author":"F Fouss","year":"2007","unstructured":"Fouss, F., Pirotte, A., Renders, J.M., Saerens, M.: Random-walk computation of similarities between nodes of a graph with application to collaborative recommendation. IEEE Trans. Knowl. Data Eng. 19(3), 355\u2013369 (2007)","journal-title":"IEEE Trans. Knowl. Data Eng."},{"key":"228_CR11","doi-asserted-by":"crossref","first-page":"596","DOI":"10.1145\/28869.28874","volume":"34","author":"M Fredman","year":"1987","unstructured":"Fredman, M., Tarjan, R.: Fibonacci heaps and their uses in improved network optimization algorithms. J. ACM 34, 596\u2013615 (1987)","journal-title":"J. ACM"},{"key":"228_CR12","doi-asserted-by":"crossref","unstructured":"Goel, S., Muhamad, R., Watts, D.: Social search in \u2018small-world\u2019 experiments. In: Proceedings 18th International World Wide Web Conference (WWW), pp. 701\u2013710. Madrid, Spain (2009)","DOI":"10.1145\/1526709.1526804"},{"key":"228_CR13","unstructured":"Golbeck, J.: Personalizing applications through integration of inferred trust values in semantic web-based social networks. In: Semantic Network Analysis Workshop at the 4th International Semantic Web Conference (2005)"},{"key":"228_CR14","doi-asserted-by":"crossref","unstructured":"Guy, I., Ronen, I., Wilcox, E.: Do you know?: recommending people to invite into your social network. In: Proceedings of 13th International Conference on Intelligent User Interfaces (IUI), pp. 77\u201386 (2009)","DOI":"10.1145\/1502650.1502664"},{"key":"228_CR15","volume-title":"Structural Models in Anthropology, vol. 1983","author":"P Hage","year":"1983","unstructured":"Hage, P., Harary, F.: Structural Models in Anthropology, vol. 1983. Cambridge University Press, Cambridge (1983)"},{"key":"228_CR16","doi-asserted-by":"crossref","unstructured":"Jeh, G., Widom, J.: Simrank: a measure of structural-context similarity. In: Proceedings of the Eighth ACM SIGKDD International Conference on Knowledge Discovery and Data Mining (KDD), pp. 538\u2013543 (2002)","DOI":"10.1145\/775047.775126"},{"key":"228_CR17","doi-asserted-by":"crossref","unstructured":"Kleinberg, J.: The small-world phenomenon: an algorithmic perspective. In: Proceedings 32nd ACM Symposium on Theory of Computing (STOC), pp. 163\u2013170. Portland, OR (2000)","DOI":"10.1145\/335305.335325"},{"key":"228_CR18","doi-asserted-by":"crossref","unstructured":"Leskovec, J., Huttenlocher, D., Kleinberg, J.: Predicting positive and negative links in online social networks. In: Proceedings of the 19th International Conference on World Wide Web (WWW), pp. 641\u2013650 (2010)","DOI":"10.1145\/1772690.1772756"},{"key":"228_CR19","doi-asserted-by":"crossref","unstructured":"Leskovec, J., Huttenlocher, D., Kleinberg, J.: Signed networks in social media. In: Proceedings of the 28th International Conference on Human Factors in Computing Systems (CHI), pp. 1361\u20131370 (2010)","DOI":"10.1145\/1753326.1753532"},{"key":"228_CR20","doi-asserted-by":"crossref","unstructured":"Liben-Nowell, D., Kleinberg, J.: The link prediction problem for social networks. In: Proceedings of the 12th International Conference on Information and Knowledge Management (CIKM) (2003)","DOI":"10.1145\/956863.956972"},{"issue":"33","key":"228_CR21","doi-asserted-by":"crossref","first-page":"11623","DOI":"10.1073\/pnas.0503018102","volume":"102","author":"L Liben-Nowell","year":"2005","unstructured":"Liben-Nowell, L., Novak, J., Kumar, R., Raghavan, P., Tomkins, A.: Geographic routing in social networks. Proc. Natl. Acad. Sci. (PNAS) 102(33), 11623\u201311628 (2005)","journal-title":"Proc. Natl. Acad. Sci. (PNAS)"},{"key":"228_CR22","doi-asserted-by":"crossref","unstructured":"Lo, S., Lin, C.: WMR: a graph-based algorithm for friend recommendation. In: Proceedings of IEEE\/ACM International Conference on Web Intelligence (WIC), pp. 121\u2013128. Hong Kong, China (2006)","DOI":"10.1109\/WI.2006.202"},{"issue":"4","key":"228_CR23","doi-asserted-by":"crossref","first-page":"46122","DOI":"10.1103\/PhysRevE.80.046122","volume":"80","author":"L L\u00fc","year":"2009","unstructured":"L\u00fc, L., Jin, C.-H., Zhou, T.: Similarity index based on local paths for link prediction of complex networks. Phys. Rev. E 80(4), 046122 (2009)","journal-title":"Phys. Rev. E"},{"key":"228_CR24","doi-asserted-by":"crossref","unstructured":"Massa, P., Avesani, P.: Trust-aware collaborative filtering for recommender systems. In: Proceedings of International\/Federated Conference On The Move to Meaningful Internet: CoopIS, DOA, ODBASE, pp. 492\u2013508 (2004)","DOI":"10.1007\/978-3-540-30468-5_31"},{"key":"228_CR25","first-page":"61","volume":"22","author":"S Milgram","year":"1967","unstructured":"Milgram, S.: The small world problem. Psychol. Today 22, 61\u201367 (1967)","journal-title":"Psychol. Today"},{"issue":"1","key":"228_CR26","doi-asserted-by":"crossref","first-page":"31","DOI":"10.1007\/s11280-011-0155-z","volume":"16","author":"K Musia\u0142","year":"2013","unstructured":"Musia\u0142, K., Kazienko, P.: Social networks on the internet. World Wide Web 16(1), 31\u201372 (2013)","journal-title":"World Wide Web"},{"key":"228_CR27","doi-asserted-by":"crossref","unstructured":"Pan, J., Yang, H., Faloutsos, C., Duygulu, P.: Automatic multimedia cross-modal correlation discovery. In: Proceedings 10th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining (KDD), pp. 653\u2013658. Seattle, WA (2004)","DOI":"10.1145\/1014052.1014135"},{"issue":"2","key":"228_CR28","doi-asserted-by":"crossref","first-page":"41","DOI":"10.1145\/1117454.1117460","volume":"7","author":"M Rattigan","year":"2005","unstructured":"Rattigan, M., Jensen, D.: The case for anomalous link discovery. SIGKDD Explorations 7(2), 41\u201347 (2005)","journal-title":"SIGKDD Explorations"},{"key":"228_CR29","unstructured":"Simsek, O., Jensen, D.: Decentralized search in networks using homophily and degree disparity. In: Proceedings of the 19th International Joint Conference on Artificial Intelligence (IJCAI), pp. 304\u2013310. Edinburgh, Scotland (2005)"},{"key":"228_CR30","unstructured":"Tanimoto, T.: IBM Internal Technical Report (1957)"},{"key":"228_CR31","doi-asserted-by":"crossref","DOI":"10.1017\/CBO9780511815478","volume-title":"Social Network Analysis: Methods and Applications, vol.\u00a08","author":"S Wasserman","year":"1994","unstructured":"Wasserman, S., Faust, K.: Social Network Analysis: Methods and Applications, vol.\u00a08. Cambridge University Press, Cambridge (1994)"},{"issue":"5571","key":"228_CR32","first-page":"1302","volume":"296","author":"D Watts","year":"2002","unstructured":"Watts, D., Dodds, P., Newman, M.: Identity and search in social networks. Sci. Mag. 296(5571), 1302\u20131305 (2002)","journal-title":"Sci. Mag."},{"issue":"3","key":"228_CR33","doi-asserted-by":"crossref","first-page":"327","DOI":"10.1007\/s11280-010-0100-6","volume":"15","author":"W Yu","year":"2012","unstructured":"Yu, W., Zhang, W., Lin, X., Zhang, Q., Le, J.: A space and time efficient algorithm for simrank computation. World Wide Web 15(3), 327\u2013353 (2012)","journal-title":"World Wide Web"}],"container-title":["World Wide Web"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11280-013-0228-2.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s11280-013-0228-2\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11280-013-0228-2","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,7,14]],"date-time":"2019-07-14T10:08:25Z","timestamp":1563098905000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s11280-013-0228-2"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013,6,2]]},"references-count":33,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2014,7]]}},"alternative-id":["228"],"URL":"https:\/\/doi.org\/10.1007\/s11280-013-0228-2","relation":{},"ISSN":["1386-145X","1573-1413"],"issn-type":[{"value":"1386-145X","type":"print"},{"value":"1573-1413","type":"electronic"}],"subject":[],"published":{"date-parts":[[2013,6,2]]}}}