Sign In Start Free Trial
Account

Add to playlist

Create a Playlist

Modal Close icon
You need to login to use this feature.
  • Book Overview & Buying Modern Graph Theory Algorithms with Python
  • Table Of Contents Toc
Modern Graph Theory Algorithms with Python

Modern Graph Theory Algorithms with Python

By : Colleen M. Farrelly, Franck Kalala Mutombo
4.6 (7)
close
close
Modern Graph Theory Algorithms with Python

Modern Graph Theory Algorithms with Python

4.6 (7)
By: Colleen M. Farrelly, Franck Kalala Mutombo

Overview of this book

We are living in the age of big data, and scalable solutions are a necessity. Network science leverages the power of graph theory and flexible data structures to analyze big data at scale. This book guides you through the basics of network science, showing you how to wrangle different types of data (such as spatial and time series data) into network structures. You’ll be introduced to core tools from network science to analyze real-world case studies in Python. As you progress, you’ll find out how to predict fake news spread, track pricing patterns in local markets, forecast stock market crashes, and stop an epidemic spread. Later, you’ll learn about advanced techniques in network science, such as creating and querying graph databases, classifying datasets with graph neural networks (GNNs), and mining educational pathways for insights into student success. Case studies in the book will provide you with end-to-end examples of implementing what you learn in each chapter. By the end of this book, you’ll be well-equipped to wrangle your own datasets into network science problems and scale solutions with Python.
Table of Contents (21 chapters)
close
close
Lock Free Chapter
1
Part 1:Introduction to Graphs and Networks with Examples
4
Part 2: Spatial Data Applications
8
Part 3: Temporal Data Applications
12
Part 4: Advanced Applications

Summary

In this chapter, we considered several use cases of ML algorithms on network datasets. This included UL on a friendship network through fitting k-means and spectral clustering. We considered k-means clustering on both the original dataset of activities in which individuals participated and the original dataset, with added network metrics to improve clustering accuracy. We then turned to SL and SSL on networks and collections of networks through a type of DL algorithm called GNNs. We accurately predicted the labels of individuals in Zachary’s Karate Network dataset through a shallow GNN and compared results with other existing solutions to this network classification problem. In Chapter 10, we'll mine educational data for causal relationships using network tools related to conditional probability.

CONTINUE READING
83
Tech Concepts
36
Programming languages
73
Tech Tools
Icon Unlimited access to the largest independent learning library in tech of over 8,000 expert-authored tech books and videos.
Icon Innovative learning tools, including AI book assistants, code context explainers, and text-to-speech.
Icon 50+ new titles added per month and exclusive early access to books as they are being written.
Modern Graph Theory Algorithms with Python
notes
bookmark Notes and Bookmarks search Search in title playlist Add to playlist download Download options font-size Font size

Change the font size

margin-width Margin width

Change margin width

day-mode Day/Sepia/Night Modes

Change background colour

Close icon Search
Country selected

Close icon Your notes and bookmarks

Confirmation

Modal Close icon
claim successful

Buy this book with your credits?

Modal Close icon
Are you sure you want to buy this book with one of your credits?
Close
YES, BUY

Submit Your Feedback

Modal Close icon
Modal Close icon
Modal Close icon