Project Name | Stars | Downloads | Repos Using This | Packages Using This | Most Recent Commit | Total Releases | Latest Release | Open Issues | License | Language |
---|---|---|---|---|---|---|---|---|---|---|
Skills Ml | 156 | 13 days ago | 3 | May 04, 2018 | 37 | other | Jupyter Notebook | |||
Data Processing and Machine learning methods for the Open Skills Project | ||||||||||
Recotour | 147 | a year ago | Jupyter Notebook | |||||||
A tour through recommendation algorithms in python [IN PROGRESS] | ||||||||||
Tsp_animation | 63 | 5 years ago | gpl-3.0 | Python | ||||||
The source code for an animation of four algorithms trying to solve a traveling salesman problem | ||||||||||
Tourr | 60 | 10 | 12 | 5 days ago | 16 | August 25, 2022 | 9 | other | R | |
A implementation of tour algorithms in R | ||||||||||
Hello Scrollytelling | 38 | 6 years ago | 1 | HTML | ||||||
A bare-bones version of the scrollytelling framework used in the Algorithms Tour | ||||||||||
Traveling Salesman | 33 | 9 years ago | 1 | C++ | ||||||
C++ Implementation of Traveling Salesman Problem using Christofides and 2-opt | ||||||||||
Data Structures And Algorithms | 22 | 2 years ago | Python | |||||||
A more visual tour to Data Structures and Algorithms! | ||||||||||
Traveling Salesman | 22 | 5 years ago | C++ | |||||||
Traveling Salesman Problem C++ Implementation | ||||||||||
Acotsp | 14 | 13 years ago | 1 | C | ||||||
Ant Colony Optimization for the Travelling Salesman Problem | ||||||||||
Knightstour | 14 | 5 years ago | mit | JavaScript | ||||||
A knight's tour is a sequence of moves of a knight on a chessboard such that the knight visits every square only once. |
This repo intends to be a tour through some recommendation algorithms in python using various dataset. Companion posts are:
Recotour: a tour through recommendation algorithms in python
RecoTour III: Variational Autoencoders for Collaborative Filtering with Mxnet and Pytorch.
The repo is organised as follows:
recotour
directory are:
lightGBM
with a tutorial on how to optimize gbmsxlearn
xlearn
pytorch
I have included a more modular (nicer looking) version of a possible final
solution (described in Chapter16_final_solution_Recommendations.ipynb
) in
the directory final_recommendations
.
In addition, I have included an illustration of how to use other evaluation
metrics apart from the one shown in the notebooks ( the mean average precision
or MAP) such as the Normalized Discounted Cumulative Gain
(NDCG). This can
be found in using_ncdg.py
in the directory py_scripts
.
In addition, there are other, DL-based recommendation algorithms that use mainly the Amazon Reviews dataset, in particular the 5-core Movies and TV reviews. These are:
The core of the repo are the notebooks in each directory. They intend to be self-contained and in consequence, there is some of code repetition. The code is, of course, "notebook-oriented". The notebooks have plenty of explanations and references to relevant papers or packages. My intention was to focus on the code, but you will also find some math.
I hope the code here is useful to someone. If you have any idea on how to improve the content of the repo, or you want to contribute, let me know.