Skip to main content
SpringerLink
Log in

Climbing Ranking Position via Long-Distance Backlinks

  • Conference paper
  • First Online:
Internet and Distributed Computing Systems (IDCS 2018)

Part of the book series: Lecture Notes in Computer Science ((LNISA,volume 11226))

Included in the following conference series:

Abstract

The best attachment consists in finding a good strategy that allows a node inside a network to achieve a high rank. This is an open issue due to its intrinsic computational complexity and to the giant dimension of the involved networks. The ranking of a node has an important impact both in economics and structural term e.g., a higher rank could leverage the number of contacts or the trusting of the node. This paper presents a heuristics aiming at finding a good solution whose complexity is \(N\log {N}\). The results show that better rank improvement comes by acquiring long distance in-links whilst human intuition would suggest to select neighbours. The paper discusses the algorithm and simulation on random and scale-free networks.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

References

  1. Albert, R., Barabasi, A.L.: Statistical mechanics of complex networks. Rev. Mod. Phys. 74, 47 (2002). http://www.citebase.org/cgi-bin/citations?id=oai:arXiv.org:cond-mat/0106096

    Article  MathSciNet  Google Scholar 

  2. Avrachenkov, K., Litvak, N.: The effect of new links on Google PageRank. Stoch. Models 22(2), 319–331 (2006). http://doc.utwente.nl/63648/

    Article  MathSciNet  Google Scholar 

  3. Barabasi, A.L., Albert, R.: Emergence of scaling in random networks. Science 286, 509 (1999). http://www.citebase.org/abstract?id=oai:arXiv.org:cond-mat/9910332

    Article  MathSciNet  Google Scholar 

  4. Batagelj, V., Mrvar, A.: Pajek - program for large network analysis (1999)

    Google Scholar 

  5. 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–999 (2018). https://doi.org/10.1016/j.ejor.2017.10.025. http://www.sciencedirect.com/science/article/pii/S0377221717309384

    Article  MathSciNet  MATH  Google Scholar 

  6. 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–214. Springer, Cham (2017). https://doi.org/10.1007/978-3-319-48829-5_20

    Chapter  Google Scholar 

  7. 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–175 (2017). https://doi.org/10.1007/s12652-016-0413-0

    Article  Google Scholar 

  8. 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–218. Springer, Berlin (2012). https://doi.org/10.1007/978-3-642-24013-3_21

    Chapter  MATH  Google Scholar 

  9. Carchiolo, V., Longheu, A., Malgeri, M., Mangioni, G.: Trust assessment: a personalized, distributed, and secure approach. Concurr. Comput.: Pract. Exp. 24(6), 605–617 (2012). https://doi.org/10.1002/cpe.1856

    Article  MATH  Google Scholar 

  10. Carchiolo, V., Longheu, A., Malgeri, M., Mangioni, G.: Users’ attachment in trust networks: reputation vs. effort. Int. J. Bio-Inspired Comput. 5(4), 199–209 (2013). https://doi.org/10.1504/IJBIC.2013.055450

    Article  Google Scholar 

  11. 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–76. Springer, Cham (2014). https://doi.org/10.1007/978-3-319-01571-2_9

    Chapter  MATH  Google Scholar 

  12. Carchiolo, V., Longheu, A., Malgeri, M., Mangioni, G.: The cost of trust in the dynamics of best attachment. Comput. Inform. 34, 167–184 (2015)

    MATH  Google Scholar 

  13. Carchiolo, V., Longheu, A., Malgeri, M., Mangioni, G.: Network size and topology impact on trust-based ranking. IJBIC 10(2), 119–126 (2017). https://doi.org/10.1504/IJBIC.2017.10004323

    Article  MATH  Google Scholar 

  14. Fercoq, O., Akian, M., Bouhtou, M., Gaubert, S.: Ergodic control and polyhedral approaches to PageRank optimization. IEEE Trans. Automat. Contr. 58(1), 134–148 (2013). http://dblp.uni-trier.de/db/journals/tac/tac58.html#FercoqABG13

    Article  MathSciNet  Google Scholar 

  15. 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–519 (1999). http://aisel.aisnet.org/amcis1999/179

  16. Guerrero-Bote, V.P., Moya-Anegón, F.: A further step forward in measuring journals scientific prestige: the SJR2 indicator. J. Informetr. 6(4), 674–688 (2012). https://doi.org/10.1016/j.joi.2012.07.001. http://www.sciencedirect.com/science/article/pii/S1751157712000521

    Article  Google Scholar 

  17. 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–1450. ACM, New York (2015). https://doi.org/10.1145/2806416.2806479

  18. de Kerchove, C., Ninove, L., Dooren, P.V.: Maximizing PageRank via outlinks. CoRR abs/0711.2867 (2007)

    Google Scholar 

  19. Kleinberg, J.M.: Authoritative sources in a hyperlinked environment. J. ACM 46(5), 604–632 (1999). https://doi.org/10.1145/324133.324140

    Article  MathSciNet  MATH  Google Scholar 

  20. Lempel, R., Moran, S.: SALSA: the stochastic approach for link-structure analysis. ACM Trans. Inf. Syst. 19(2), 131–160 (2001). https://doi.org/10.1145/382979.383041

    Article  Google Scholar 

  21. 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–134. Springer, Heidelberg (2013). https://doi.org/10.1007/978-3-642-41230-1_11

    Chapter  Google Scholar 

  22. Olsen, M., Viglas, A., Zvedeniouk, I.: An approximation algorithm for the link building problem. CoRR abs/1204.1369 (2012). http://arxiv.org/abs/1204.1369

  23. Page, L., Brin, S., Motwani, R., Winograd, T.: The PageRank citation ranking: bringing order to the web (1998). https://citeseer.ist.psu.edu/article/page98pagerank.html

  24. Pennock, D.M., Flake, G.W., Lawrence, S., Glover, E.J., Giles, C.L.: Winners don’t take all: characterizing the competition for links on the web. Proc. Natl Acad. Sci. 99(8), 5207–5211 (2002). https://doi.org/10.1073/pnas.032085699. http://www.pnas.org/content/99/8/5207.abstract

    Article  MATH  Google Scholar 

  25. 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). https://citeseer.ist.psu.edu/article/kamvar03eigentrust.html

  26. 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–414. Springer, Heidelberg (2005). https://doi.org/10.1007/11495772_63

    Chapter  Google Scholar 

  27. 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–1262. ACM, New York (2006). https://doi.org/10.1145/1160633.1160860

Download references

Author information

Authors and Affiliations

  1. Dip. Ingegneria Elettrica, Elettronica e Informatica, Università degli Studi di Catania, Catania, Italy

    V. Carchiolo, M. Grassia, A. Longheu, M. Malgeri & G. Mangioni

Authors
  1. V. Carchiolo
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. M. Grassia
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. A. Longheu
    View author publications

    You can also search for this author in PubMed Google Scholar

  4. M. Malgeri
    View author publications

    You can also search for this author in PubMed Google Scholar

  5. G. Mangioni
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to A. Longheu .

Editor information

Editors and Affiliations

  1. Swinburne University of Technology, Hawthorn, VIC, Australia

    Yang Xiang

  2. National Institute of Informatics, Tokyo, Japan

    Jingtao Sun

  3. University of Calabria, Rende (CS), Italy

    Giancarlo Fortino

  4. ICAR-CNR, Rende (CS), Italy

    Antonio Guerrieri

  5. Chung-Ang University, Seoul, Korea (Republic of)

    Jason J. Jung

Rights and permissions

Reprints and permissions

Copyright information

© 2018 Springer Nature Switzerland AG

About this paper

Check for updates. Verify currency and authenticity via CrossMark

Cite this paper

Carchiolo, V., Grassia, M., Longheu, A., Malgeri, M., Mangioni, G. (2018). Climbing Ranking Position via Long-Distance Backlinks. In: Xiang, Y., Sun, J., Fortino, G., Guerrieri, A., Jung, J. (eds) Internet and Distributed Computing Systems. IDCS 2018. Lecture Notes in Computer Science(), vol 11226. Springer, Cham. https://doi.org/10.1007/978-3-030-02738-4_9

Download citation

  • DOI: https://doi.org/10.1007/978-3-030-02738-4_9

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-030-02737-7

  • Online ISBN: 978-3-030-02738-4

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation