Mining Complex Networks
Sorozatcím: Advances in Applied Mathematics;
-
10% KEDVEZMÉNY?
- Kiadói listaár GBP 62.99
-
30 093 Ft (28 660 Ft + 5% áfa)
Az ár azért becsült, mert a rendelés pillanatában nem lehet pontosan tudni, hogy a beérkezéskor milyen lesz a forint árfolyama az adott termék eredeti devizájához képest. Ha a forint romlana, kissé többet, ha javulna, kissé kevesebbet kell majd fizetnie.
- Kedvezmény(ek) 10% (cc. 3 009 Ft off)
- Kedvezményes ár 27 084 Ft (25 794 Ft + 5% áfa)
27 084 Ft
Beszerezhetőség
Még nem jelent meg, de rendelhető. A megjelenéstől számított néhány héten belül megérkezik.
Why don't you give exact delivery time?
A beszerzés időigényét az eddigi tapasztalatokra alapozva adjuk meg. Azért becsült, mert a terméket külföldről hozzuk be, így a kiadó kiszolgálásának pillanatnyi gyorsaságától is függ. A megadottnál gyorsabb és lassabb szállítás is elképzelhető, de mindent megteszünk, hogy Ön a lehető leghamarabb jusson hozzá a termékhez.
A termék adatai:
- Kiadás sorszáma 2
- Kiadó Chapman and Hall
- Megjelenés dátuma 2026. május 15.
- ISBN 9781041261926
- Kötéstípus Puhakötés
- Terjedelem326 oldal
- Méret 234x156 mm
- Nyelv angol
- Illusztrációk 95 Illustrations, black & white; 95 Line drawings, black & white; 28 Tables, black & white 700
Kategóriák
Rövid leírás:
This textbook for upper-year undergraduates and graduates concentrates on mining networks, a subfield within data science. Changes and updates to this edition include: new material and examples on random geometric graphs, new tools and techniques on mining hypergraphs, and a chapter on fairness in network mining models.
Több
Hosszú leírás:
This book concentrates on mining networks, a subfield within data science. Many data science problems can be viewed as a study of some properties of complex networks in which nodes represent the entities that are being investigated, and edges represent relations between these entities.
In these networks (for example, the Instagram and Facebook online social networks), nodes not only contain some useful information (such as the user’s profile, photos, and tags) but are also internally connected to other nodes (relations based on follower requests, similar users’ behaviour, age, and geographic location). Such networks are often large-scale, decentralized, and evolve dynamically over time.
Mining complex networks to understand the principles governing the organization and the behaviour of such networks is crucial for a broad range of fields of study, including information and social sciences, economics, biology, and neuroscience.
The field has seen significant advancements since the first edition was published. Changes and updates to this edition include:
- New material and examples on random geometric graphs.
- The chapter on node embeddings was augmented in several places including a discussion on classical vs. structural embeddings, more details on graph neural networks (GNNs), as well as other directions.
- Several new tools and techniques are introduced on mining hypergraphs.
- New material on post-processing for overlapping communities.
- A new focus on a framework for embedding graphs codeveloped by the authors.
- A short chapter on fairness in network mining models.
This book is aimed at being suitable for an upper-year undergraduate course or a graduate course.
TöbbTartalomjegyzék:
Part 1. Core Material 1. Graph Theory 2. Random Graph Models 3. Centrality Measures 4. Degree Correlations 5. Community Detection 6. Graph Embeddings 7. Hypergraphs Part 2. Additional Material 8. Detecting Overlapping Communities 9. Embedding Graphs 10. Network Robustness 11. Road Networks 12. Fairness in Graph Mining
Több
