Muutke küpsiste eelistusi

Modelling and Mining Networks: 20th International Workshop, WAW 2025, Vilnius, Lithuania, June 30 July 3, 2025, Proceedings [Pehme köide]

Edited by , Edited by , Edited by , Edited by , Edited by , Edited by , Edited by
  • Formaat: Paperback / softback, 205 pages, kõrgus x laius: 235x155 mm, 42 Illustrations, color; 9 Illustrations, black and white; X, 205 p. 51 illus., 42 illus. in color., 1 Paperback / softback
  • Sari: Lecture Notes in Computer Science 15699
  • Ilmumisaeg: 22-May-2025
  • Kirjastus: Springer International Publishing AG
  • ISBN-10: 3031928970
  • ISBN-13: 9783031928970
Teised raamatud teemal:
  • Pehme köide
  • Hind: 56,11 €*
  • * hind on lõplik, st. muud allahindlused enam ei rakendu
  • Tavahind: 66,01 €
  • Säästad 15%
  • Raamatu kohalejõudmiseks kirjastusest kulub orienteeruvalt 2-4 nädalat
  • Kogus:
  • Lisa ostukorvi
  • Tasuta tarne
  • Tellimisaeg 2-4 nädalat
  • Lisa soovinimekirja
Modelling and Mining Networks: 20th International Workshop, WAW 2025, Vilnius, Lithuania, June 30 July 3, 2025, ProceedingsSuurem pilt
  • Formaat: Paperback / softback, 205 pages, kõrgus x laius: 235x155 mm, 42 Illustrations, color; 9 Illustrations, black and white; X, 205 p. 51 illus., 42 illus. in color., 1 Paperback / softback
  • Sari: Lecture Notes in Computer Science 15699
  • Ilmumisaeg: 22-May-2025
  • Kirjastus: Springer International Publishing AG
  • ISBN-10: 3031928970
  • ISBN-13: 9783031928970
Teised raamatud teemal:
Püsilink: https://www.kriso.ee/db/9783031928970.html

This book constitutes the refereed proceedings of the 20th International Workshop on Modelling and Mining Networks, WAW 2025, held in Vilnius, Lithuania, during June 30–July 3, 2025.
The 13 full papers presented in this book were carefully reviewed and selected from 20 submissions.The aim of the 20th Workshop on Modelling and Mining Networks was to further the understanding of networks that arise in theoretical as well as applied domains. The goal was also to stimulate the development of high performance and scalable algorithms that exploit these networks.

.- Linear Geometric Centralities.
.- Analysis and predictability of centrality measures in competition
networks.
.- Modularity of Random Intersection Graphs.
.- The size of the giant in inhomogeneous random graphs of
preferential attachment type.
.- k-connectivity threshold for superpositions of Bernoulli random graphs.
.- Improving community detection via community association strength scores.
.- PageRank under interpolation between undirected- and directed networks - a
case study.
.- Degrees in preferential attachment networks with an anomaly.
.- The Artificial Benchmark for Community Detection with Outliers and
Overlapping Communities (ABCD+o2).
.- A Graph Network Approach to Disinformation Detection in Social Media.
.- Computation of the Laplacian Spectral Barycentre Network in a
Soules Basis.
.- The Multilayer Artificial Benchmark for Community Detection (mABCD).
.- Integrating Link Prediction and Isolation Forest for Backbone Extraction.