{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,10]],"date-time":"2024-09-10T19:40:49Z","timestamp":1725997249495},"publisher-location":"Cham","reference-count":27,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030027377"},{"type":"electronic","value":"9783030027384"}],"license":[{"start":{"date-parts":[[2018,1,1]],"date-time":"2018-01-01T00:00:00Z","timestamp":1514764800000},"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":[],"published-print":{"date-parts":[[2018]]},"DOI":"10.1007\/978-3-030-02738-4_9","type":"book-chapter","created":{"date-parts":[[2018,10,16]],"date-time":"2018-10-16T08:53:34Z","timestamp":1539680014000},"page":"100-108","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":3,"title":["Climbing Ranking Position via Long-Distance Backlinks"],"prefix":"10.1007","author":[{"given":"V.","family":"Carchiolo","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"M.","family":"Grassia","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"A.","family":"Longheu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"M.","family":"Malgeri","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"G.","family":"Mangioni","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2018,10,17]]},"reference":[{"key":"9_CR1","doi-asserted-by":"publisher","first-page":"47","DOI":"10.1103\/RevModPhys.74.47","volume":"74","author":"R Albert","year":"2002","unstructured":"Albert, R., Barabasi, A.L.: Statistical mechanics of complex networks. Rev. Mod. Phys. 74, 47 (2002). \nhttp:\/\/www.citebase.org\/cgi-bin\/citations?id=oai:arXiv.org:cond-mat\/0106096","journal-title":"Rev. Mod. Phys."},{"issue":"2","key":"9_CR2","doi-asserted-by":"publisher","first-page":"319","DOI":"10.1080\/15326340600649052","volume":"22","author":"K Avrachenkov","year":"2006","unstructured":"Avrachenkov, K., Litvak, N.: The effect of new links on Google PageRank. Stoch. Models 22(2), 319\u2013331 (2006). \nhttp:\/\/doc.utwente.nl\/63648\/","journal-title":"Stoch. Models"},{"key":"9_CR3","doi-asserted-by":"publisher","first-page":"509","DOI":"10.1126\/science.286.5439.509","volume":"286","author":"AL Barabasi","year":"1999","unstructured":"Barabasi, A.L., Albert, R.: Emergence of scaling in random networks. Science 286, 509 (1999). \nhttp:\/\/www.citebase.org\/abstract?id=oai:arXiv.org:cond-mat\/9910332","journal-title":"Science"},{"key":"9_CR4","unstructured":"Batagelj, V., Mrvar, A.: Pajek - program for large network analysis (1999)"},{"issue":"3","key":"9_CR5","doi-asserted-by":"publisher","first-page":"990","DOI":"10.1016\/j.ejor.2017.10.025","volume":"266","author":"CS Blas de","year":"2018","unstructured":"de Blas, C.S., Martin, J.S., Gonzalez, D.G.: Combined social networks and data envelopment analysis for ranking. Eur. J. Oper. Res. 266(3), 990\u2013999 (2018). \nhttps:\/\/doi.org\/10.1016\/j.ejor.2017.10.025\n\n. \nhttp:\/\/www.sciencedirect.com\/science\/article\/pii\/S0377221717309384","journal-title":"Eur. J. Oper. Res."},{"key":"9_CR6","series-title":"Studies in Computational Intelligence","doi-asserted-by":"publisher","first-page":"205","DOI":"10.1007\/978-3-319-48829-5_20","volume-title":"Intelligent Distributed Computing X","author":"M Buzzanca","year":"2017","unstructured":"Buzzanca, M., Carchiolo, V., Longheu, A., Malgeri, M., Mangioni, G.: Dealing with the best attachment problem via heuristics. In: Badica, C., et al. (eds.) IDC 2016. SCI, vol. 678, pp. 205\u2013214. Springer, Cham (2017). \nhttps:\/\/doi.org\/10.1007\/978-3-319-48829-5_20"},{"issue":"2","key":"9_CR7","doi-asserted-by":"publisher","first-page":"167","DOI":"10.1007\/s12652-016-0413-0","volume":"8","author":"M Buzzanca","year":"2017","unstructured":"Buzzanca, M., Carchiolo, V., Longheu, A., Malgeri, M., Mangioni, G.: Direct trust assignment using social reputation and aging. J. Ambient. Intell. Humaniz. Comput. 8(2), 167\u2013175 (2017). \nhttps:\/\/doi.org\/10.1007\/s12652-016-0413-0","journal-title":"J. Ambient. Intell. Humaniz. Comput."},{"key":"9_CR8","series-title":"Studies in Computational Intelligence","doi-asserted-by":"publisher","first-page":"213","DOI":"10.1007\/978-3-642-24013-3_21","volume-title":"Intelligent Distributed Computing V","author":"V Carchiolo","year":"2012","unstructured":"Carchiolo, V., Longheu, A., Malgeri, M., Mangioni, G.: Gain the best reputation in trust networks. In: Brazier, F., Nieuwenhuis, K., Pavlin, G., Warnier, M., Badica, C. (eds.) IDC 2011. SCI, vol. 382, pp. 213\u2013218. Springer, Berlin (2012). \nhttps:\/\/doi.org\/10.1007\/978-3-642-24013-3_21"},{"issue":"6","key":"9_CR9","doi-asserted-by":"publisher","first-page":"605","DOI":"10.1002\/cpe.1856","volume":"24","author":"V Carchiolo","year":"2012","unstructured":"Carchiolo, V., Longheu, A., Malgeri, M., Mangioni, G.: Trust assessment: a personalized, distributed, and secure approach. Concurr. Comput.: Pract. Exp. 24(6), 605\u2013617 (2012). \nhttps:\/\/doi.org\/10.1002\/cpe.1856","journal-title":"Concurr. Comput.: Pract. Exp."},{"issue":"4","key":"9_CR10","doi-asserted-by":"publisher","first-page":"199","DOI":"10.1504\/IJBIC.2013.055450","volume":"5","author":"V Carchiolo","year":"2013","unstructured":"Carchiolo, V., Longheu, A., Malgeri, M., Mangioni, G.: Users\u2019 attachment in trust networks: reputation vs. effort. Int. J. Bio-Inspired Comput. 5(4), 199\u2013209 (2013). \nhttps:\/\/doi.org\/10.1504\/IJBIC.2013.055450","journal-title":"Int. J. Bio-Inspired Comput."},{"key":"9_CR11","series-title":"Studies in Computational Intelligence","doi-asserted-by":"publisher","first-page":"67","DOI":"10.1007\/978-3-319-01571-2_9","volume-title":"Intelligent Distributed Computing VII","author":"V Carchiolo","year":"2014","unstructured":"Carchiolo, V., Longheu, A., Malgeri, M., Mangioni, G.: A heuristic to explore trust networks dynamics. In: Zavoral, F., Jung, J.J., Badica, C. (eds.) IDC 2013. SCI, vol. 511, pp. 67\u201376. Springer, Cham (2014). \nhttps:\/\/doi.org\/10.1007\/978-3-319-01571-2_9"},{"key":"9_CR12","first-page":"167","volume":"34","author":"V Carchiolo","year":"2015","unstructured":"Carchiolo, V., Longheu, A., Malgeri, M., Mangioni, G.: The cost of trust in the dynamics of best attachment. Comput. Inform. 34, 167\u2013184 (2015)","journal-title":"Comput. Inform."},{"issue":"2","key":"9_CR13","doi-asserted-by":"publisher","first-page":"119","DOI":"10.1504\/IJBIC.2017.10004323","volume":"10","author":"V Carchiolo","year":"2017","unstructured":"Carchiolo, V., Longheu, A., Malgeri, M., Mangioni, G.: Network size and topology impact on trust-based ranking. IJBIC 10(2), 119\u2013126 (2017). \nhttps:\/\/doi.org\/10.1504\/IJBIC.2017.10004323","journal-title":"IJBIC"},{"issue":"1","key":"9_CR14","doi-asserted-by":"publisher","first-page":"134","DOI":"10.1109\/TAC.2012.2226103","volume":"58","author":"O Fercoq","year":"2013","unstructured":"Fercoq, O., Akian, M., Bouhtou, M., Gaubert, S.: Ergodic control and polyhedral approaches to PageRank optimization. IEEE Trans. Automat. Contr. 58(1), 134\u2013148 (2013). \nhttp:\/\/dblp.uni-trier.de\/db\/journals\/tac\/tac58.html#FercoqABG13","journal-title":"IEEE Trans. Automat. Contr."},{"key":"9_CR15","unstructured":"Fung, R., Lee, M.: EC-Trust (trust in electronic commerce): exploring the antecedent factors. In: Proceedings of the 5th Americas Conference on Information Systems, pp. 517\u2013519 (1999). \nhttp:\/\/aisel.aisnet.org\/amcis1999\/179"},{"issue":"4","key":"9_CR16","doi-asserted-by":"publisher","first-page":"674","DOI":"10.1016\/j.joi.2012.07.001","volume":"6","author":"VP Guerrero-Bote","year":"2012","unstructured":"Guerrero-Bote, V.P., Moya-Aneg\u00f3n, F.: A further step forward in measuring journals scientific prestige: the SJR2 indicator. J. Informetr. 6(4), 674\u2013688 (2012). \nhttps:\/\/doi.org\/10.1016\/j.joi.2012.07.001\n\n. \nhttp:\/\/www.sciencedirect.com\/science\/article\/pii\/S1751157712000521","journal-title":"J. Informetr."},{"key":"9_CR17","doi-asserted-by":"publisher","unstructured":"Jiang, J.Y., Liu, J., Lin, C.Y., Cheng, P.J.: Improving ranking consistency for web search by leveraging a knowledge base and search logs. In: Proceedings of the 24th ACM International on Conference on Information and Knowledge Management, CIKM 2015, pp. 1441\u20131450. ACM, New York (2015). \nhttps:\/\/doi.org\/10.1145\/2806416.2806479","DOI":"10.1145\/2806416.2806479"},{"key":"9_CR18","unstructured":"de Kerchove, C., Ninove, L., Dooren, P.V.: Maximizing PageRank via outlinks. CoRR abs\/0711.2867 (2007)"},{"issue":"5","key":"9_CR19","doi-asserted-by":"publisher","first-page":"604","DOI":"10.1145\/324133.324140","volume":"46","author":"JM Kleinberg","year":"1999","unstructured":"Kleinberg, J.M.: Authoritative sources in a hyperlinked environment. J. ACM 46(5), 604\u2013632 (1999). \nhttps:\/\/doi.org\/10.1145\/324133.324140","journal-title":"J. ACM"},{"issue":"2","key":"9_CR20","doi-asserted-by":"publisher","first-page":"131","DOI":"10.1145\/382979.383041","volume":"19","author":"R Lempel","year":"2001","unstructured":"Lempel, R., Moran, S.: SALSA: the stochastic approach for link-structure analysis. ACM Trans. Inf. Syst. 19(2), 131\u2013160 (2001). \nhttps:\/\/doi.org\/10.1145\/382979.383041","journal-title":"ACM Trans. Inf. Syst."},{"key":"9_CR21","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"121","DOI":"10.1007\/978-3-642-41230-1_11","volume-title":"Web Information Systems Engineering \u2013 WISE 2013","author":"X Liu","year":"2013","unstructured":"Liu, X.: Towards context-aware social recommendation via trust networks. In: Lin, X., Manolopoulos, Y., Srivastava, D., Huang, G. (eds.) WISE 2013. LNCS, vol. 8180, pp. 121\u2013134. Springer, Heidelberg (2013). \nhttps:\/\/doi.org\/10.1007\/978-3-642-41230-1_11"},{"key":"9_CR22","unstructured":"Olsen, M., Viglas, A., Zvedeniouk, I.: An approximation algorithm for the link building problem. CoRR abs\/1204.1369 (2012). \nhttp:\/\/arxiv.org\/abs\/1204.1369"},{"key":"9_CR23","unstructured":"Page, L., Brin, S., Motwani, R., Winograd, T.: The PageRank citation ranking: bringing order to the web (1998). \nhttps:\/\/citeseer.ist.psu.edu\/article\/page98pagerank.html"},{"issue":"8","key":"9_CR24","doi-asserted-by":"publisher","first-page":"5207","DOI":"10.1073\/pnas.032085699","volume":"99","author":"DM Pennock","year":"2002","unstructured":"Pennock, D.M., Flake, G.W., Lawrence, S., Glover, E.J., Giles, C.L.: Winners don\u2019t take all: characterizing the competition for links on the web. Proc. Natl Acad. Sci. 99(8), 5207\u20135211 (2002). \nhttps:\/\/doi.org\/10.1073\/pnas.032085699\n\n. \nhttp:\/\/www.pnas.org\/content\/99\/8\/5207.abstract","journal-title":"Proc. Natl Acad. Sci."},{"key":"9_CR25","unstructured":"Kamvar, S.D., Schlosser, M.T., Garcia-Molina, H.: The EigenTrust algorithm for reputation management in P2P networks. In: 2003 Proceedings of the Twelfth International World Wide Web Conference (2003). \nhttps:\/\/citeseer.ist.psu.edu\/article\/kamvar03eigentrust.html"},{"key":"9_CR26","series-title":"Lecture Notes in Computer Science (Lecture Notes in Artificial Intelligence)","doi-asserted-by":"publisher","first-page":"408","DOI":"10.1007\/11495772_63","volume-title":"Advances in Web Intelligence","author":"M Sydow","year":"2005","unstructured":"Sydow, M.: Can one out-link change your pagerank? In: Szczepaniak, P.S., Kacprzyk, J., Niewiadomski, A. (eds.) AWIC 2005. LNCS (LNAI), vol. 3528, pp. 408\u2013414. Springer, Heidelberg (2005). \nhttps:\/\/doi.org\/10.1007\/11495772_63"},{"key":"9_CR27","doi-asserted-by":"publisher","unstructured":"Weng, J., Miao, C., Goh, A., Shen, Z., Gay, R.: Trust-based agent community for collaborative recommendation. In: AAMAS 2006: Proceedings of the Fifth International Joint Conference on Autonomous Agents and Multiagent Systems, pp. 1260\u20131262. ACM, New York (2006). \nhttps:\/\/doi.org\/10.1145\/1160633.1160860","DOI":"10.1145\/1160633.1160860"}],"container-title":["Lecture Notes in Computer Science","Internet and Distributed Computing Systems"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-02738-4_9","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2018,10,16]],"date-time":"2018-10-16T08:58:14Z","timestamp":1539680294000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-030-02738-4_9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018]]},"ISBN":["9783030027377","9783030027384"],"references-count":27,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-02738-4_9","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2018]]},"assertion":[{"value":"IDCS","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Internet and Distributed Computing Systems","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Tokyo","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Japan","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2018","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"11 October 2018","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"13 October 2018","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"11","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"idcs2018","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/www.idcs2018.net\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}