Stanford CS224W: ML with Graphs | 2021 | Lecture 12.1-Fast Neural Subgraph Matching & Counting
16.9 هزار بار بازدید -
3 سال پیش
-
For more information about Stanford’s
For more information about Stanford’s Artificial Intelligence professional and graduate programs, visit: https://stanford.io/3jR7jK2
Jure Leskovec
Computer Science, PhD
In this lecture, we will be talking about the problem on subgraph matching and counting. Subgraphs work as building blocks for larger networks, and have the power to characterize and discriminate networks. We first give an introduction on two types of subgraphs - node-induced subgraphs and edge-induced subgraphs. Then we give you an idea how to determine subgraph relation through the concept of graph isomorphism. Finally, we discuss why subgraphs are important, and how we can identify the most informative subgraphs with network significance profile.
To follow along with the course schedule and syllabus, visit:
http://web.stanford.edu/class/cs224w/
Jure Leskovec
Computer Science, PhD
In this lecture, we will be talking about the problem on subgraph matching and counting. Subgraphs work as building blocks for larger networks, and have the power to characterize and discriminate networks. We first give an introduction on two types of subgraphs - node-induced subgraphs and edge-induced subgraphs. Then we give you an idea how to determine subgraph relation through the concept of graph isomorphism. Finally, we discuss why subgraphs are important, and how we can identify the most informative subgraphs with network significance profile.
To follow along with the course schedule and syllabus, visit:
http://web.stanford.edu/class/cs224w/
3 سال پیش
در تاریخ 1400/02/29 منتشر شده
است.
16,956
بـار بازدید شده