Fall 2023 Computer Science and Operations Research W4246 section 001

ALGORITHMS FOR DATA SCIENCE

ALGORITHMS FOR DATA SCIEN

Call Number 11297
Day & Time
Location
TR 11:40am-12:55pm
833 Seeley W. Mudd Building
Points 3
Grading Mode Standard
Approvals Required None
Instructor Eleni Drinea
Type LECTURE
Method of Instruction In-Person
Course Description Prerequisites: basic knowledge in programming (e.g. at the level of COMS W1007), a basic grounding in calculus and linear algebra. Methods for organizing data, e.g. hashing, trees, queues, lists,priority queues. Streaming algorithms for computing statistics on the data. Sorting and searching. Basic graph models and algorithms for searching, shortest paths, and matching. Dynamic programming. Linear and convex programming. Floating point arithmetic, stability of numerical algorithms, Eigenvalues, singular values, PCA, gradient descent, stochastic gradient descent, and block coordinate descent. Conjugate gradient, Newton and quasi-Newton methods. Large scale applications from signal processing, collaborative filtering, recommendations systems, etc.
Web Site Vergil
Department Computer Science
Enrollment 109 students (120 max) as of 9:06PM Wednesday, November 29, 2023
Subject Computer Science and Operations Research
Number W4246
Section 001
Division Interfaculty
Campus Morningside
Note MS Data Science students priority registration.
Section key 20233CSOR4246W001