Stanford CS224W: Machine Learning with Graphs - Stanford CS224W: ML with Graphs | 2021 | Lecture 10.3 - Knowledge Graph Completion Algorithms

4.0 (2)

29 learners

What you'll learn

This course includes

22.3 hours of video
Certificate of completion
Access on mobile and TV

Summary

Keywords

Jure Leskovec Machine Learning Machine Learning with Graphs Graphs CS224W Stanford TransE TransR Dismult ComplEx knowledge graph completion task

Full Transcript

For more information about Stanford’s Artificial Intelligence professional and graduate programs, visit: https://stanford.io/2ZyfzYa Lecture10.3 - Knowledge Graph Completion: TransE, TransR, DistMul, ComplEx Jure Leskovec Computer Science, PhD Having talked about several knowledge graphs, we then introduce how to perform the knowledge graph completion task. In this lecture, we will talk about several models such as TransE, TransR, Dismult and ComplEx. For each of the model, we will discuss which type of relations it can model and relations it fails to model. 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.

Welcome