Disputation von Morteza Alamgir am 15.07.2014, 10:00 Uhr, Raum C-221
15. Juli 2014
Foto: Fachschaft Informatik
Einladung zur hochschulöffentlichen Disputation
von Herrn Morteza Alamgir:“Analysis of distance functions in graphs”
Einladung zur hochschulöffentlichen Disputation
von Herrn Morteza Alamgir
Dienstag, 15. Juli 2014 um 10:00 Uhr
im Informatikum, Vogt-Kölln-Str. 30, Raum C-221
“Analysis of distance functions in graphs”
Abstract:
Many machine learning algorithms use graphs to model relations between data points. One of the main objects of interest for such algorithms is the distance between vertices. The main goal of this thesis is to study distance functions in graphs, specifically the ones that often appear in machine learning problems. The focus is on properties of distance functions in large graphs. In particular, I will present new results on the convergence of the shortest path distance in graphs, downsampling massive graphs, and local distances with applications in graph clustering and friend recommendation in social networks.
Prof. Dr. Christopher Habel
(Fach-Promotionsausschusses Informatik)