Course10610518640 lectures
Scalable Data Science
Prof. Anirban Dasgupta and Prof. Sourangshu Bhattacharya · IIT Gadhinagar IIT Kharagpur
About
Consider the following example problems: One is interested in computing summary statistics (word count distributions) for a set of words which occur in the same document in entire Wikipedia collection (5 million documents). Naive techniques, will run out of main memory on most computers. One needs to train an SVM classifier for text categorization, with unigram features (typically ~10 million) for hundreds of classes. One would run out of main memory, if they store uncompressed model parameters in main memory. One is interested in learning either a supervised model or find unsupervised patterns, but the data is distributed over multiple machines. Communication being the bottleneck, naïve methods to adapt existing algorithms to such a distributed setting might perform extremely poorly. In all the above situations, a simple data mining / machine learning task has been made more complicated due to large scale of input data, output results or both. In this course, we discuss algorithmic techniques as well as software paradigms which allow one to develop scalable algorithms and systems for the common data science tasks.
INTENDED AUDIENCE : Computer Science and Engineering
PREREQUISITES : Algorithms, Machine Learning
INDUSTRY SUPPORT : Google, Microsoft, Facebook, Amazon, Flipkart, LinkedIn etc.
Lectures
Week 1
- Lecture 1 : Background: Introduction
- Lecture 2 : Probability: Concentration inequalities
- Lecture 3 : Linear algebra: PCA, SVD
- Lecture 4 : Optimization: Basics, Convex, GD
- Lecture 5 : Machine Learning: Supervised, generalization, feature learning, clustering.
Week 2
- Lecture 6 : Memory-efficient data structures: Hash functions, universal / perfect hash families
- Lecture 7 : Bloom filters
- Lecture 8 : Sketches for distinct count
- Lecture 9 : Sketches for distinct count (Contd.)
- Lecture 10 : Misra-Gries sketch
Week 3
- Lecture 11 : Frequent Element: Space Saving and Count Min.
- Lecture 12 : Frequent Element: Count Sketch
- Lecture 13 : Near Neighbors
- Lecture 14 : Locality Sensitive Hashing.
- Lecture 15 : Building LSH Tables.
Week 4
- Lecture 16 : Approximate near neighbors search: Extensions e.g. multi-probe, b-bit hashing, Data dependent variants
- Lecture 17 : Approximate near neighbors search: Extensions e.g. multi-probe, b-bit hashing, Data dependent variants (Contd.)
- Lecture 18 : Approximate near neighbors search: Extensions e.g. multi-probe, b-bit hashing, Data dependent variants (Contd.)
- Lecture 19 : Randomized Numerical Linear Algebra: Random projection
- Lecture 20 : Randomized Numerical Linear Algebra: Random projection (Contd.)
Week 5
- Lecture 21 : Randomized Numerical Linear Algebra:a) Matrix multiplication + QB decomposition
- Lecture 22 : Randomized Numerical Linear Algebra:b) CUR+CX
- Lecture 23 : Randomized Numerical Linear Algebra:a) L2 regression using RP
- Lecture 24 : Randomized Numerical Linear Algebra:b) Leverage scores
- Lecture 25 : Randomized Numerical Linear Algebra:c) Hash Kernels + Kitchen Sink
Week 6
- Lecture 26 : Map-reduce and Hadoop
- Lecture 27 : Hadoop System
- Lecture 28 : Hadoop System(Contd.)
- Lecture 29 : Hadoop System(Contd.)
Week 7
- Lecture 30 : Spark
- Lecture 31 : Spark(Contd.)
- Lecture 32 : Spark(Contd.)
- Lecture 33 : Distributed Machine Learning and Optimization: Introduction
- Lecture 34 : SGD+Proof
- Lecture 35 : SGD+Proof(Contd.)
Week 8
Syllabus and materials
At NPTEL, as the course publishes them.
Credits and licence
- Institution
- IIT Gadhinagar IIT Kharagpur
- Department
- Computer Science and Engineering
- Taught by
- Prof. Anirban Dasgupta, Prof. Sourangshu Bhattacharya
- Level
- Graduate
- Language
- English
- Subjects
- Computer science, Engineering
- Source
- NPTEL
- Licence
- CC BY-NC-SA, as NPTEL states it. Non-commercial use only. NPTEL's terms
- Attribution
- NPTEL states: "Distributed under Creative Commons Attribution-ShareAlike / CC BY - NC - SA", beside a BY-NC-SA badge. Coordinated by IIT Kharagpur.
- Who can watch
- NPTEL gives no rating. Invisible Network shows it to Tweens profiles and older, judged from what the source says about it. How courses are placed
More like this
Course
Matrix Methods in Data Analysis, Signal Processing, and Machine Learning
34 lectures · Video
Course
Computational Science and Engineering I
50 lectures · Video
Course
Engineering Dynamics
223 lectures · Video
Course
CS50’s Introduction to Computer Science
12 lectures · Video
Course
Frontiers of Biomedical Engineering
25 lectures · Audio
Course
CS50's Introduction to Programming with Python
10 lectures · Video