Top AI Repos — open-source AI, indexed and scored
Top AI Repos tracks AI repositories on GitHub and answers two different questions about each one: is it moving right now, and would you bet a product on it.
Top AI Repos tracks AI repositories on GitHub and answers two different questions about each one: is it moving right now, and would you bet a product on it.
Minimal and clean examples of machine learning algorithms implementations
| Date | Stars |
|---|---|
| 2026-07-31 | 11150 |
| 2026-08-01 | 11150 |
| 2026-08-04 | 11159 |
| 2026-08-06 | 11158 |
| 2026-08-07 | 11159 |
| 2026-08-08 | 11161 |
| 2026-08-10 | 11162 |
| 2026-08-13 | 11163 |
| 2026-08-14 | 11163 |
| 2026-08-15 | 11163 |
| 2026-08-16 | 11165 |
| 2026-08-18 | 11166 |
| 2026-08-20 | 11168 |
| 2026-08-21 | 11168 |
| 2026-08-22 | 11169 |
| 2026-08-24 | 11168 |
| 2026-08-25 | 11168 |
| 2026-08-26 | 11170 |
| 2026-08-27 | 11170 |
| 2026-08-28 | 11171 |
| 2026-08-29 | 11173 |
| 2026-09-01 | 11172 |
| 2026-09-04 | 11171 |
| 2026-09-05 | 11172 |
| 2026-09-06 | 11172 |
| 2026-09-08 | 11172 |
| 2026-09-09 | 11173 |
| 2026-09-11 | 11175 |
| 2026-09-14 | 11177 |
| 2026-09-17 | 11176 |
| 2026-09-20 | 11176 |
Today
— stars today
This week
+1 stars this week
This month
+8 stars this month
Momentum
0.0
growth rate 0.01%/day
# Machine learning algorithms
A collection of minimal and clean implementations of machine learning algorithms.
### Why?
This project is targeting people who want to learn internals of ml algorithms or implement them from scratch.
The code is much easier to follow than the optimized libraries and easier to play with.
All algorithms are implemented in Python, using numpy, scipy and autograd.
### Implemented:
* [Deep learning (MLP, CNN, RNN, LSTM)](mla/neuralnet)
* [Linear regression, logistic regression](mla/linear_models.py)
* [Random Forests](mla/ensemble/random_forest.py)
* [Support vector machine (SVM) with kernels (Linear, Poly, RBF)](mla/svm)
* [K-Means](mla/kmeans.py)
* [Gaussian Mixture Model](mla/gaussian_mixture.py)
* [K-nearest neighbors](mla/knn.py)
* [Naive bayes](mla/naive_bayes.py)
* [Principal component analysis (PCA)](mla/pca.py)
* [Factorization machines](mla/fm.py)
* [Restricted Boltzmann machine (RBM)](mla/rbm.py)
* [t-Distributed Stochastic Neighbor Embedding (t-SNE)](mla/tsne.py)
* [Gradient Boosting trees (also known as GBDT, GBRT, GBM, XGBoost)](mla/ensemble/gbm.py)
* [Reinforcement learning (Deep Q learning)](mla/rl)
### Installation
```sh
git clone https://github.com/rushter/MLAlgorithms
cd MLAlgorithms
pip install scipy numpy
python setup.py develop
```
### How to run examples without installation
```sh
cd MLAlgorithms
python -m examples.linear_models
```
### How to run examples within Docker
```sh
cd MLAlgorithms
docker build -t mlalgorithms .
docker run --rm -it mlalgorithms bash
python -m examples.linear_models
```
### Contributing
Your contributions are always welcome!
Feel free to improve existing code, documentation or implement new algorithm.
Please open an issue to propose your changes if they are big enough.
Excerpt of 1,870 characters
Read on GitHub
Artem Golubin
104
Shihab Shahriar Khan · United States
4
4
Nicolas Hug · United Kingdom
4
3
Jiancheng (JC) Yang · @HINTLab, ELLIS Institute Finland & Aalto University · Finland
3
3
Robert Wukmir · United States
3
2
2
2
2
1
1
1
1
1
1
1
1
Would you bet a product on this? Bounded 0–100 and slow moving.
matched fp:6e4271e007ee7fb0, topic:deep-learning, readme:autograd