Lecture

Knowledge Inference for Graphs

Description

This lecture by the instructor covers the concept of knowledge inference for graphs, focusing on propagating attribute values among connected nodes in a graph. It discusses label inference, optimization objectives, injecting pre-existing knowledge, label propagation algorithms, and the behavior of probabilities in the inference process. The lecture also explores extensions of label propagation, the semi-supervised learning aspect, and the application of knowledge inference in completing knowledge bases. Various models and algorithms for knowledge base completion and learning are presented, along with their practical implications and references to related research.

About this result
This page is automatically generated and may contain information that is not correct, complete, up-to-date, or relevant to your search query. The same applies to every other page on this website. Please make sure to verify the information with EPFL's official sources.

Graph Chatbot

Chat with Graph Search

Ask any question about EPFL courses, lectures, exercises, research, news, etc. or try the example questions below.

DISCLAIMER: The Graph Chatbot is not programmed to provide explicit or categorical answers to your questions. Rather, it transforms your questions into API requests that are distributed across the various IT services officially administered by EPFL. Its purpose is solely to collect and recommend relevant references to content that you can explore to help you answer your questions.