minisom
som-tsp
Our great sponsors
| minisom | som-tsp | |
|---|---|---|
| 3 | 11 | |
| 1,387 | 3,613 | |
| - | - | |
| 8.4 | 0.0 | |
| 5 days ago | 4 months ago | |
| Python | Python | |
| MIT License | MIT License |
Stars - the number of stars that a project has on GitHub. Growth - month over month growth in stars.
Activity is a relative number indicating how actively a project is being developed. Recent commits have higher weight than older ones.
For example, an activity of 9.0 indicates that a project is amongst the top 10% of the most actively developed projects that we are tracking.
minisom
- How to use MiniSOM (Self Organizing Maps) Library
- [P][D] Self Organizing Maps
-
[OC] Animation of a Self Organizing Map
I made this animation because I could not find a single decent demonstration of a SOM map on the internet, especially considering how popular it is becoming. I used the python library Pyvista for 3D plotting and creating the animation, and I used the minisom library for running the SOM.
som-tsp
- Using Self-Organizing Maps to solve the Traveling Salesman Problem
-
Self-Organizing Maps can be used to to solve the Traveling Salesman Problem — The Traveling Salesman Problem is a well known challenge in Computer Science: it consists on finding the shortest route possible that traverses all cities in a given map only once.
Blog: https://diego.codes/post/som-tsp/
- Using Self-Organizing Maps to Solve the Traveling Salesman Problem
-
Ok, who's got an implementation ready - QGIS plugin, Arc toolbox/script, Post, whatever?
The blog link about it in that comment: https://diego.codes/post/som-tsp/
-
Solving the travelling salesman problem using Self-Organizing Maps
Read more on the technique and implementation of self organizing maps in this blog post
-
Solving the travelling salesman problem using self-organising maps
Github repo
- Som-Tsp - Solving the traveling salesman problem using self-organizing maps
- Som-Tsp – Solving the traveling salesman problem using self-organizing maps
What are some alternatives?
umap - Uniform Manifold Approximation and Projection
VeRyPy - A python library with implementations of 15 classical heuristics for the capacitated vehicle routing problem.
somoclu - Massively parallel self-organizing maps: accelerate training on multicore CPUs, GPUs, and clusters
susi - SuSi: Python package for unsupervised, supervised and semi-supervised self-organizing maps (SOM)
sparse-som - Efficient Self-Organizing Map for Sparse Data
TSP_Solver - Python code for visualizations of algorithms that provide approximate solutions to TSP along with two lower bound approximations
Neupy - NeuPy is a Tensorflow based python library for prototyping and building neural networks
DBCV - Python implementation of Density-Based Clustering Validation
encode-attend-navigate-pytorch - Encode-attend-navigate unofficial Pytorch implementation
n2d - A deep clustering algorithm. Code to reproduce results for our paper N2D: (Not Too) Deep Clustering via Clustering the Local Manifold of an Autoencoded Embedding.
awesome-community-detection - A curated list of community detection research papers with implementations.