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 Graph Machine Learning
  • Table Of Contents Toc
Graph Machine Learning

Graph Machine Learning - Second Edition

By : Aldo Marzullo, Enrico Deusebio, Claudio Stamile
close
close
Graph Machine Learning

Graph Machine Learning

By: Aldo Marzullo, Enrico Deusebio, Claudio Stamile

Overview of this book

Graph Machine Learning, Second Edition builds on its predecessor’s success, delivering the latest tools and techniques for this rapidly evolving field. From basic graph theory to advanced ML models, you’ll learn how to represent data as graphs to uncover hidden patterns and relationships, with practical implementation emphasized through refreshed code examples. This thoroughly updated edition replaces outdated examples with modern alternatives such as PyTorch and DGL, available on GitHub to support enhanced learning. The book also introduces new chapters on large language models and temporal graph learning, along with deeper insights into modern graph ML frameworks. Rather than serving as a step-by-step tutorial, it focuses on equipping you with fundamental problem-solving approaches that remain valuable even as specific technologies evolve. You will have a clear framework for assessing and selecting the right tools. By the end of this book, you’ll gain both a solid understanding of graph machine learning theory and the skills to apply it to real-world challenges. *Email sign-up and proof of purchase required -
Table of Contents (20 chapters)
close
close
1
Part 1: Introduction to Graph Machine Learning
5
Part 2: Machine Learning on Graphs
9
Part 3: Practical Applications of Graph Machine Learning
14
Part 4: Advanced topics in Graph Machine Learning
18
Index

Graph regularization methods

The shallow embedding methods described in the previous section show how topological information and relations between data points can be encoded and leveraged in order to build more robust classifiers and address semi-supervised tasks. In general terms, network information can be extremely useful in constraining models and enforcing the output to be smooth within neighboring nodes. As we have already seen in previous sections, this idea can be efficiently used in semi-supervised tasks, when propagating the information on neighbor unlabeled nodes.

On the other hand, this can also be used to regularize the learning phase in order to create more robust models that tend to better generalize to unseen examples. Both the label propagation and the label spreading algorithms we have seen previously can be implemented as a cost function to be minimized when we add an additional regularization term. Generally, in supervised tasks, we can write the cost function...

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.
Graph Machine Learning
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