Elena Farahbaksh Touli: Challenges in Hierarchical Clustering

Tid: Fr 2019-04-26 kl 13.00 - 14.00

Föreläsare: Elena Farahbaksh Touli

Plats: Room 22, building 5, Kräftriket, Department of Mathematics, Stockholm University 

Abstract: Hierarchical clustering (HC) is one of the popular methods in the application of data analysis and data science as it is advantageous over flat clustering--a method for clustering a given data with the fixed number of clusters. In general, there are two methods for HC; top-down clustering and agglomerative methods. In this seminar, I will
talk about linkage methods which are agglomerative methods for HC. I will talk about a divisive method for HC as well. The cost function is very simple, but it is NP-hard to minimize. I will also present an approximation algorithm for minimizing the cost function.
 

Innehållsansvarig:webmaster@math.kth.se
Tillhör: Institutionen för matematik
Senast ändrad: 2019-04-16