For more information about Stanford’s Artificial Intelligence professional and graduate programs, visit: https://stanford.io/3BsESs7
Lecture 11.2 - Answering Predictive Queries on Knowledge Graphs
Jure Leskovec
Computer Science, PhD
We introduce the idea of traversing knowledge graphs in vector space for better reasoning and handling queries. We show how composability relationships can allow us to handle path queries. We then finally talk about how to traverse knowledge graphs to answer conjunctive queries, as well as how to use embeddings to impute missing relationships.
To follow along with the course schedule and syllabus, visit:
http://web.stanford.edu/class/cs224w/
Continue this lesson in the app
Install CourseHive on Android or iOS to keep learning while you move.
FAQs
We curate free YouTube courses, organized by category and language — and make it easy for you to track your learning progress.
Yes. Free courses are embedded YouTube videos.
Currently available in English — with Portuguese, Spanish, French, German, and Italian coming soon.
Check ratings, reviews, duration, and description.
All courses include a certificate of participation.
Yes, an account lets you track progress, earn certificates, and save favorites.
We auto-save your watch position so you can resume on any device.