Skip to main content
Fachgebiete
Automobil + Motoren Bauwesen + Immobilien Business IT + Informatik Elektrotechnik + Elektronik Energie + Nachhaltigkeit Finance + Banking Management + Führung Marketing + Vertrieb Maschinenbau + Werkstoffe Versicherung + Risiko
DE
EN
Themenseiten
Organisationspsychologie Projektmanagement Marketing Smart Manufacturing
Bücher
Zeitschriften
Weitere Formate
Podcasts Webinare Technik Webinare Wirtschaft Kongresse Veranstaltungskalender Awards
Jetzt Einzelzugang starten
Zugang für Unternehmen
Referenzkunden
MTZ-Fachkongress

Antriebe und Energiesysteme von morgen


Austausch von Automobil- und Energiewirtschaft

Am 14./15. Mai geht es in Chemnitz um die Mobilitätswende durch Elektro- und Wasserstofffahrzeuge.
Erweiterte Suche
Anmelden
nach oben
Erschienen in:
A Fair-Cost Analysis of the Random Neighbor Sampling Method Kapitel lesen Erstes Kapitel lesen

2022 | OriginalPaper | Buchkapitel

Retrieval of Redundant Hyperlinks After Attack Based on Hyperbolic Geometry of Web Complex Networks

verfasst von : Mahdi Moshiri, Farshad Safaei

Erschienen in: Complex Networks & Their Applications X

Verlag: Springer International Publishing

Einloggen

Aktivieren Sie unsere intelligente Suche, um passende Fachinhalte oder Patente zu finden.

search-config
loading …

Abstract

The Internet and the Web can be described as huge networks of connected computers, connected web pages, or connected users. Analyzing link retrieval methods on the Internet and the Web as examples of complex networks is of particular importance. The recovery of complex networks is an important issue that has been extensively used in various fields. Much work has been done to measure and improve the stability of complex networks during attacks. Recently, many studies have focused on the network recovery strategies after the attack. Predicting the appropriate redundant links in a way that the network can be recovered at the lowest cost and fastest time after attacks or interruptions will be critical in a disaster. In addition, real-world networks such as the World Wide Web are no exception, and many attacks are made on hyperlinks between web pages, and the issue of predicting redundant hyperlinks on this World Wide Web is also very important.
In this paper, different kinds of attack strategies are provided and some retrieval strategies based on link prediction methods are proposed to recover the hyperlinks after failure or attack. Besides that, a new link prediction method based on the hyperbolic geometry of the complex network is proposed to retrieve redundant hyperlinks and the numerical simulation reveals its superiority that the state-of-the-art algorithms in recovering the attacked hyperlinks especially in the case of attacks based on edge betweenness strategy.

Sie haben noch keine Lizenz? Dann Informieren Sie sich jetzt über unsere Produkte:

Springer Professional "Wirtschaft+Technik"

Online-Abonnement

Mit Springer Professional "Wirtschaft+Technik" erhalten Sie Zugriff auf:

  • über 102.000 Bücher
  • über 537 Zeitschriften

aus folgenden Fachgebieten:

  • Automobil + Motoren
  • Bauwesen + Immobilien
  • Business IT + Informatik
  • Elektrotechnik + Elektronik
  • Energie + Nachhaltigkeit
  • Finance + Banking
  • Management + Führung
  • Marketing + Vertrieb
  • Maschinenbau + Werkstoffe
  • Versicherung + Risiko

Jetzt Wissensvorsprung sichern!

Jetzt informieren

Springer Professional "Technik"

Online-Abonnement

Mit Springer Professional "Technik" erhalten Sie Zugriff auf:

  • über 67.000 Bücher
  • über 390 Zeitschriften

aus folgenden Fachgebieten:

  • Automobil + Motoren
  • Bauwesen + Immobilien
  • Business IT + Informatik
  • Elektrotechnik + Elektronik
  • Energie + Nachhaltigkeit
  • Maschinenbau + Werkstoffe




 

Jetzt Wissensvorsprung sichern!

Jetzt informieren

Springer Professional "Wirtschaft"

Online-Abonnement

Mit Springer Professional "Wirtschaft" erhalten Sie Zugriff auf:

  • über 67.000 Bücher
  • über 340 Zeitschriften

aus folgenden Fachgebieten:

  • Bauwesen + Immobilien
  • Business IT + Informatik
  • Finance + Banking
  • Management + Führung
  • Marketing + Vertrieb
  • Versicherung + Risiko




Jetzt Wissensvorsprung sichern!

Jetzt informieren
Vorheriges Kapitel Synchronization of Complex Networks Subject to Impulses with Average Characteristics
Nächstes Kapitel Deep Reinforcement Learning for FlipIt Security Game
Literatur
1.
2.
3.
Hu, F., et al.: Recovery of infrastructure networks after localised attacks. Sci. Rep. 6(1), 1–10 (2016)
4.
Yu, H., Yang, C.: Partial network recovery to maximize traffic demand. IEEE Commun. Lett. 15(12), 1388–1390 (2011)CrossRef
5.
Yodo, N., Wang, P.: Engineering resilience quantification and system design implications: a literature survey. J. Mech. Des. 138, 11 (2016)CrossRef
6.
Majdandzic, A., et al.: Spontaneous recovery in dynamical networks. Nat. Phys. 10(1), 34–38 (2014)CrossRef
7.
Afrin, T., Yodo, N.: A concise survey of advancements in recovery strategies for resilient complex networks. J. Complex Netw. 7(3), 393–420 (2019)CrossRef
8.
Liben-Nowell, D., Kleinberg, J.: The link-prediction problem for social networks. J. Am. Soc. Inform. Sci. Technol. 58(7), 1019–1031 (2007)CrossRef
9.
Clauset, A., Moore, C., Newman, M.E.: Hierarchical structure and the prediction of missing links in networks. Nature 453(7191), 98–101 (2008)CrossRef
10.
Fu, C., et al.: Link weight prediction using supervised learning methods and its application to yelp layered network. IEEE Trans. Knowl. Data Eng. 30(8), 1507–1518 (2018)CrossRef
11.
12.
Lü, L., Zhou, T.: Link prediction in complex networks: a survey. Physica A 390(6), 1150–1170 (2011)CrossRef
13.
Samei, Z., Jalili, M.: Discovering spurious links in multiplex networks based on interlayer relevance. J. Complex Netw. 7(5), 641–658 (2019)CrossRef
14.
Sales-Pardo, M., et al.: Extracting the hierarchical organization of complex systems. Proc. Natl. Acad. Sci. 104(39), 15224–15229 (2007)CrossRef
15.
Airoldi, E.M., et al.: Mixed membership stochastic blockmodels. J. Mach. Learn. Res. 9, 1981–2014 (2008)MATH
16.
Holland, P.W., Laskey, K.B., Leinhardt, S.: Stochastic blockmodels: first steps. Soc. Netw. 5(2), 109–137 (1983)MathSciNetCrossRef
17.
Heckerman, D., Meek, C., Koller, D.: Probabilistic entity-relationship models, PRMs, and plate models. In: Introduction to Statistical Relational Learning, pp. 201–238 (2007)
18.
Neville, J.: Statistical models and analysis techniques for learning in relational data (2006)
19.
Herrgård, M.J., et al.: A consensus yeast metabolic network reconstruction obtained from a community approach to systems biology. Nat. Biotechnol. 26(10), 1155–1160 (2008)CrossRef
20.
Linden, G., Smith, B., Com, J.Y.A.: Industry report: Amazon.com recommendations: item-to-item collaborative filtering. IEEE Distrib. Syst. Onl. Citeseer (2003)
21.
Radicchi, F., et al.: Defining and identifying communities in networks. Proc. Natl. Acad. Sci. 101(9), 2658–2663 (2004)CrossRef
22.
23.
24.
Papadopoulos, F., et al.: Popularity versus similarity in growing networks. Nature 489(7417), 537–540 (2012)CrossRef
25.
Papadopoulos, F., Psomas, C., Krioukov, D.: Network mapping by replaying hyperbolic growth. IEEE/ACM Trans. Netw. 23(1), 198–211 (2014)CrossRef
26.
Alessandro, M., Vittorio, C.C.: Leveraging the nonuniform PSO network model as a benchmark for performance evaluation in community detection and link prediction. New J. Phys. 20(6), 063022 (2018)CrossRef
27.
Muscoloni, A., Cannistraci, C.V.: A nonuniform popularity-similarity optimization (nPSO) model to efficiently generate realistic complex networks with communities. New J. Phys. 20(5), 052002 (2018)MathSciNetCrossRef
28.
Samei, Z., Jalili, M.: Application of hyperbolic geometry in link prediction of multiplex networks. Sci. Rep. 9(1), 1–11 (2019)CrossRef
29.
Albert, R., Jeong, H., Barabási, A.-L.: Error and attack tolerance of complex networks. Nature 406(6794), 378–382 (2000)CrossRef
30.
Cohen, R., et al.: Breakdown of the internet under intentional attack. Phys. Rev. Lett. 86(16), 3682 (2001)CrossRef
31.
32.
Allesina, S., Pascual, M.: Googling food webs: can an eigenvector measure species’ importance for coextinctions? PLoS Comput. Biol. 5(9), e1000494 (2009)MathSciNetCrossRef
33.
Iyer, S., et al.: Attack robustness and centrality of complex networks. PLoS ONE 8(4), e59613 (2013)CrossRef
34.
Mozafari, M., Khansari, M.: Improving the robustness of scale-free networks by maintaining community structure. J. Complex Netw. 7(6), 838–864 (2019)MathSciNetCrossRef
35.
Moshiri, M., Safaei, F., Samei, Z.: A novel recovery strategy based on link prediction and hyperbolic geometry of complex networks. J. Complex Netw. 9(4), cnab007 (2021)MathSciNetCrossRef
36.
Muscoloni, A., Abdelhamid, I., Cannistraci, C.V.: Local-community network automata modelling based on length-three-paths for prediction of complex network structures in protein interactomes, food webs and more. bioRxiv 346916 (2018)
37.
Kleineberg, K.-K., et al.: Hidden geometric correlations in real multiplex networks. Nat. Phys. 12(11), 1076–1081 (2016)CrossRef
38.
39.
40.
Kunegis, J.: Konect: the koblenz network collection. In: Proceedings of the 22nd International Conference on World Wide Web (2013)
41.
Adamic, L.A., Glance, N.: The political blogosphere and the 2004 US election: divided they blog. In: Proceedings of the 3rd International Workshop on Link Discovery (2005)
42.
43.
Šubelj, L., Bajec, M.: Ubiquitousness of link-density and link-pattern communities in real-world networks. Eur. Phys. J. B 85(1), 1–11 (2012)CrossRef
44.
Metadaten
Titel
Retrieval of Redundant Hyperlinks After Attack Based on Hyperbolic Geometry of Web Complex Networks
verfasst von
Mahdi Moshiri
Farshad Safaei
Copyright-Jahr
2022
Buch
Complex Networks & Their Applications X

Print ISBN: 978-3-030-93408-8

Electronic ISBN: 978-3-030-93409-5

Copyright-Jahr: 2022

DOI
https://doi.org/10.1007/978-3-030-93409-5_67

Premium Partner

    Bildnachweise