Teaching
Teaching
Course Description:
Supervised learning, including regression, kernel-based, tree-based, probability model-based, and ensemble learning; unsupervised learning, including distance-based and model-based; Markov Chain Monte Carlo (MCMC) methods; graphical models; current topics from literature.
Course Description:
Best case, worst case, and expected case complexity analysis; asymptotic approximations; solutions of recurrence equations; probabilistic techniques; divide-and-conquer; the greedy approach; dynamic programming; branch and bound; NP-completeness; parallel algorithms.