Versions Compared

Key

  • This line was added.
  • This line was removed.
  • Formatting was changed.

...

 
Topic
Student  Name
Date
Presentation
1

Distributed file systems and map-reduce as a tool for creating parallel algorithms that succeed on very large amounts of data

Yiting Xia

2/13/2015

PPT
2

Similarity search, including the key techniques of min-hashing and locality sensitive hashing

Deepak Majeti2/20/2015PDF
3

Data-stream processing and specialized algorithms for dealing with data that arrives so fast it must be processed immediately or lost

Wei-Cheng Xiao2/27/2015PPTX
4

Anomaly Detection Frequent-itemset mining, including association rules, market-baskets, the A-Priori Algorithm and its improvements

Deepak Majeti3/13/2015PPT
5Omid Pouya3/20/2015PPT1, PPT2
6

Algorithms for clustering very large, high-dimensional datasets

Simbarashe Dzinamarira3/27/2015 
7

Two key problems for Web applications: managing advertising and recommendation systems

Lei Tang4/10/2015 
8

Algorithms for analyzing and mining the structure of very large graphs, especially social-network graphs

Shangyu Luo 4/17/2015 
9

Techniques for obtaining the important properties of a large dataset by dimensionality reduction, including singular-value decomposition

and latent semantic indexing

Zhipeng Wang4/24/2015 
10

Machine-learning algorithms that can be applied to very large data, such as perceptrons, support-vector machines, and gradient descent

Zhipeng Wang4/30/2015 

...