Analysis of Hierarchical Clustering Methods
Project Description
Hierarchical clustering algorithms try to construct a “best” cluster tree representing the relationship between data. It is difficult to construct such a “best” tree. Student would experiment with various approximation algorithms for Hierarchical Clustering, trying to study their performance on actual data as well as analytically analyzing their performance
Supervisor
GOLIN Mordecai Jay
Quota
1
Course type
UROP1000
UROP1100
Applicant's Roles
Running empirical experiments and performing analytical analysis
Applicant's Learning Objectives
Learning how to formally analyze algorithm
Complexity of the project
Moderate