Fall 2023 Computer Science and Operations Research W4246 section 002

ALGORITHMS FOR DATA SCIENCE

ALGORITHMS FOR DATA SCIEN

Call Number 11299
Day & Time
Location
TR 1:10pm-2:25pm
329 Pupin Laboratories
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 100 students (100 max) as of 11:06AM Sunday, December 10, 2023
Status Full
Subject Computer Science and Operations Research
Number W4246
Section 002
Division Interfaculty
Campus Morningside
Note MS in Data Science have priority registration.
Section key 20233CSOR4246W002