YoVDO

Topological Node2vec: Improving Graph Embeddings with Persistent Homology

Offered By: Applied Algebraic Topology Network via YouTube

Tags

Topological Data Analysis Courses Machine Learning Courses Network Analysis Courses Algebraic Topology Courses Graph Embeddings Courses Persistent Homology Courses Optimal Transport Courses

Course Description

Overview

Save Big on Coursera Plus. 7,000+ courses at $160 off. Limited Time Only!
Explore the intersection of topology and machine learning in this 46-minute talk from the Applied Algebraic Topology Network. Delve into the theory, applications, and heuristics of incorporating topology into graph embeddings. Examine how persistent homology defines topology for point clouds and weighted graphs by analyzing pairwise distances and edge weights. Discover the challenges of preserving topology when transforming weighted edges into Euclidean distances using graph embedding methods. Learn about a novel topological loss term that addresses these issues, and gain insights into new developments in optimal transport as it relates to Topological Data Analysis (TDA). Enhance your understanding of graph embeddings and their topological implications through practical examples and theoretical discussions.

Syllabus

Killian Meehan (07/10/24): Topological Node2vec: improving graph embeddings with persistent homology


Taught by

Applied Algebraic Topology Network

Related Courses

Optimal Transport and PDE - Gradient Flows in the Wasserstein Metric
Simons Institute via YouTube
Crash Course on Optimal Transport
Simons Institute via YouTube
Learning From Ranks, Learning to Rank - Jean-Philippe Vert, Google Brain
Alan Turing Institute via YouTube
Optimal Transport for Machine Learning - Gabriel Peyre, Ecole Normale Superieure
Alan Turing Institute via YouTube
Regularization for Optimal Transport and Dynamic Time Warping Distances - Marco Cuturi
Alan Turing Institute via YouTube