Mining Complex Networks (Advances in Applied Mathematics) （2ND）

個数：

予約

Mining Complex Networks (Advances in Applied Mathematics) （2ND）

Kamiński, Bogumił/ Prałat, Paweł/ Théberge, François

ウェブストア価格 ¥57,086（本体¥51,897）
CRC Press（2026/05発売）
外貨定価 US$ 255.00
ポイント 518pt

現在予約受付中です。出版後の入荷・発送となります。
（重要：表示されている発売日は予定となり、発売が延期、中止、生産限定品で商品確保ができないなどの理由により、ご注文をお取消しさせていただく場合がございます。予めご了承ください。）

●3Dセキュア導入とクレジットカードによるお支払いについて

【入荷遅延について】
世界情勢の影響により、海外からお取り寄せとなる洋書・洋古書の入荷が、表示している標準的な納期よりも遅延する場合がございます。
おそれいりますが、あらかじめご了承くださいますようお願い申し上げます。

◆画像の表紙や帯等は実物とは異なる場合があります。

◆ウェブストアでの洋書販売価格は、弊社店舗等での販売価格とは異なります。
また、洋書販売価格は、ご注文確定時点での日本円価格となります。
ご注文確定後に、同じ洋書の販売価格が変動しても、それは反映されません。

製本 Hardcover:ハードカバー版／ページ数 312 p.
言語 ENG
商品コード 9781041261919

Full Description

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, Instagram and Facebook online social networks), nodes not only contain some useful information (such as the user's profile, photos, tags) but are also internally connected to other nodes (relations based on follower requests, similar users' behavior, age, 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 behavior 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.

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