Media Summary: MapReduce: TeraSort, minimum spanning tree, triangle counting. External memory model: linked list, matrix multiplication, B-tree, buffered repository tree, sorting. Zeta transform, Möbius inversion, streaming

Algorithms For Big Data Compsci 229r Lecture 25 - Detailed Analysis & Overview

MapReduce: TeraSort, minimum spanning tree, triangle counting. External memory model: linked list, matrix multiplication, B-tree, buffered repository tree, sorting. Zeta transform, Möbius inversion, streaming Oblivious subspace embeddings, faster iterative regression, sketch-and-solve regression. Linear least squares via subspace embeddings, leverage score sampling, non-commutative Khintchine, oblivious subspace ... P-stable sketch analysis, Nisan's PRG, ℓp estimation for p

Khintchine, decoupling, Hanson-Wright, proof of distributional JL lemma. Low-rank approximation, column-based matrix reconstruction, k-means, compressed sensing. Power of random signs: ℓ2 norm estimation, subspace embeddings (regression), Johnson-Lindenstrauss, deterministic point ... second order methods (Newton's method), path-following interior point wrap-up.

Photo Gallery

Algorithms for Big Data (COMPSCI 229r), Lecture 25
Algorithms for Big Data (COMPSCI 229r), Lecture 24
Algorithms for Big Data (COMPSCI 229r), Lecture 23
Advanced Algorithms (COMPSCI 224), Lecture 25
Algorithms for Big Data (COMPSCI 229r), Lecture 17
Algorithms for Big Data (COMPSCI 229r), Lecture 22
Algorithms for Big Data (COMPSCI 229r), Lecture 16
Algorithms for Big Data (COMPSCI 229r), Lecture 4
Algorithms for Big Data (COMPSCI 229r), Lecture 5
Algorithms for Big Data (COMPSCI 229r), Lecture 11
Algorithms for Big Data (COMPSCI 229r), Lecture 18
Advanced Algorithms (COMPSCI 224), Lecture 26
Sponsored
View Detailed Profile
Algorithms for Big Data (COMPSCI 229r), Lecture 25

Algorithms for Big Data (COMPSCI 229r), Lecture 25

MapReduce: TeraSort, minimum spanning tree, triangle counting.

Algorithms for Big Data (COMPSCI 229r), Lecture 24

Algorithms for Big Data (COMPSCI 229r), Lecture 24

Competitive paging, cache-oblivious

Algorithms for Big Data (COMPSCI 229r), Lecture 23

Algorithms for Big Data (COMPSCI 229r), Lecture 23

External memory model: linked list, matrix multiplication, B-tree, buffered repository tree, sorting.

Advanced Algorithms (COMPSCI 224), Lecture 25

Advanced Algorithms (COMPSCI 224), Lecture 25

Zeta transform, Möbius inversion, streaming

Algorithms for Big Data (COMPSCI 229r), Lecture 17

Algorithms for Big Data (COMPSCI 229r), Lecture 17

Oblivious subspace embeddings, faster iterative regression, sketch-and-solve regression.

Sponsored
Algorithms for Big Data (COMPSCI 229r), Lecture 22

Algorithms for Big Data (COMPSCI 229r), Lecture 22

Matrix completion.

Algorithms for Big Data (COMPSCI 229r), Lecture 16

Algorithms for Big Data (COMPSCI 229r), Lecture 16

Linear least squares via subspace embeddings, leverage score sampling, non-commutative Khintchine, oblivious subspace ...

Algorithms for Big Data (COMPSCI 229r), Lecture 4

Algorithms for Big Data (COMPSCI 229r), Lecture 4

P-stable sketch analysis, Nisan's PRG, ℓp estimation for p

Algorithms for Big Data (COMPSCI 229r), Lecture 5

Algorithms for Big Data (COMPSCI 229r), Lecture 5

Analysis of ℓp estimation

Algorithms for Big Data (COMPSCI 229r), Lecture 11

Algorithms for Big Data (COMPSCI 229r), Lecture 11

Khintchine, decoupling, Hanson-Wright, proof of distributional JL lemma.

Algorithms for Big Data (COMPSCI 229r), Lecture 18

Algorithms for Big Data (COMPSCI 229r), Lecture 18

Low-rank approximation, column-based matrix reconstruction, k-means, compressed sensing.

Advanced Algorithms (COMPSCI 224), Lecture 26

Advanced Algorithms (COMPSCI 224), Lecture 26

Power of random signs: ℓ2 norm estimation, subspace embeddings (regression), Johnson-Lindenstrauss, deterministic point ...

Advanced Algorithms (COMPSCI 224), Lecture 18

Advanced Algorithms (COMPSCI 224), Lecture 18

second order methods (Newton's method), path-following interior point wrap-up.