- Built wikipedia article and image retrieval models by using clustering algorithms such as k nearest neighbors, k means, latent dirichlet allocation, and hierarchical clustering.
- Used expectation maximization, locality sensitive hashing, and gibbs sampling to built gaussian mixture and mixed membership models for an improved assignment of data-points and clustering.
- Nearest Neighbors Search
- 1 Nearest Neighbor with Locality Sensitive Hashing
- K Means
- Expectation Maximization
- Expectation Maximization - Image Data (Gaussian Mixtures)
- Latent Dirichlet Allocation - Mixed Membership Model
- Hierarchical Clustering
Python
Anaconda, Graphlab Create Installation guide
Jupyter notebook (IPython)
- Fork this repository to have your own copy
- Clone your copy on your local system
- Install necessary packages
This repository does not contain optimal machine learning models! It only assesses various models that can be built using different machine learning algorithms (either implemented or used directly from Graphlab Create package) to perform different tasks.