CS224W: Machine Learning with Graphs | 2021 | Lecture 12.3 - Finding Frequent Subgraphs

Jure Leskovec Computer Science, PhD In this lecture, we discuss the techniques to mine frequent subgraphs. We will first give you an idea on the computational difficulty of the subgraph mining problems, as well as the standard problem setup for such problems. Then, we introduce SPMiner, a neural model to identify frequent motifs. The algorithm of SPMiner consists of the step of randomly selecting starting nodes, and growing the set to larger subgraphs. You’ll see how SPMiner heuristically picks nodes in subsequent iterations, and the inspiring experimental results from it. To follow along with the course schedule and syllabus, visit: To get the latest news on Stanford’s upcoming professional programs in Artificial Intelligence, visit: To view all online courses and programs offered by Stanford, visit: ​