COMS 5350: Algorithms for Large Data Sets: Theory and Practice
(Dual-listed with COMS 4350).
Credits: 3. Contact Hours: Lecture 3.
Prereq: COMS 3110 or equivalent; graduate standing or permission of instructor
Algorithmic challenges involved in solving computational problems on massive data sets. Probabilistic data structures, Curse of Dimensionality and dimensionality reduction, locality sensitive hashing, similarity measures, matrix decompositions. Optimization problems in massive data analysis. Computational problems that arise in the context of web search, social network analysis, online advertising etc. Practical aspects include implementation and performance evaluation of the algorithms on real world data sets. Graduate credit requires a written report on current research.