BEGIN:VCALENDAR
VERSION:2.0
PRODID:-//Memento EPFL//
BEGIN:VEVENT
SUMMARY:IC Talk: A Theory of Spectral Clustering
DTSTART:20180522T101500
DTEND:20180522T113000
DTSTAMP:20260506T194940Z
UID:5606d1a981396ffd8f724113bb51c54aae2e84ce2e40b0e01606cec7
CATEGORIES:Conferences - Seminars
DESCRIPTION:By: Luca Trevisan - UC Berkeley\n\nAbstract:\nSpectral cluster
 ing algorithms find clusters in a given network by exploiting properties o
 f the eigenvectors of matrices associated with the network. As a first ste
 p\, one computes a spectral embedding\, that is a mapping of nodes to poin
 ts in a low-dimensional real space\; then one uses geometric clustering al
 gorithms such as k-means to cluster the points corresponding to the nodes.
 \n \nSuch algorithms work so well that\, in certain applications unrelate
 d to network analysis\, such as image segmentation\, it is useful to assoc
 iate a network to the data\, and then apply spectral clustering to the net
 work. In addition to its application to clustering\, spectral embeddings a
 re a valuable tool for dimension-reduction and data visualization.\n \nTh
 e performance of spectral clustering algorithms has been justified rigorou
 sly when applied to networks coming from certain probabilistic generative 
 models.\n \nA more recent development\, which is the focus of this lectur
 e\, is a worst-case analysis of spectral clustering\, showing that\, for e
 very graph that exhibits a certain cluster structure\, such structure can 
 be found by geometric algorithms applied to a spectral embedding.\n \nSuc
 h results generalize the graph Cheeger’s inequality (a classical result 
 in spectral graph theory)\, and they have additional applications in compu
 tational complexity theory and in pure mathematics.\n\nBio:\nLuca Trevisan
  is a professor of electrical engineering and computer sciences at U.C. Be
 rkeley and a senior scientist at the Simons Institute for the Theory of Co
 mputing. Luca studied at the Sapienza University of Rome\, he was a post-d
 oc at MIT and at DIMACS\, and he was on the faculty of Columbia University
 \, U.C. Berkeley\, and Stanford\, before returning to Berkeley in 2014.\n
  \nLuca's research is in theoretical computer science\, and it is focused
  on computational complexity and graph algorithms.\n \nLuca received the 
 STOC'97 Danny Lewin (best student paper) award\, the 2000 Oberwolfach Priz
 e\, and the 2000 Sloan Fellowship.\n\nMore information\n 
LOCATION:BC 420 https://plan.epfl.ch/?room==BC%20420
STATUS:CONFIRMED
END:VEVENT
END:VCALENDAR