minisom VS DBCV

Compare minisom vs DBCV and see what are their differences.

Our great sponsors
  • WorkOS - The modern identity platform for B2B SaaS
  • InfluxDB - Power Real-Time Data Analytics at Scale
  • SaaSHub - Software Alternatives and Reviews
minisom DBCV
3 1
1,387 140
- -
8.4 0.0
5 days ago 4 months ago
Python Python
MIT License MIT License
The number of mentions indicates the total number of mentions that we've tracked plus the number of user suggested alternatives.
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

Posts with mentions or reviews of minisom. We have used some of these posts to build our list of alternatives and similar projects. The last one was on 2021-07-15.

DBCV

Posts with mentions or reviews of DBCV. We have used some of these posts to build our list of alternatives and similar projects. The last one was on 2022-02-05.

What are some alternatives?

When comparing minisom and DBCV you can also consider the following projects:

umap - Uniform Manifold Approximation and Projection

stringlifier - Stringlifier is on Opensource ML Library for detecting random strings in raw text. It can be used in sanitising logs, detecting accidentally exposed credentials and as a pre-processing step in unsupervised ML-based analysis of application text data.

somoclu - Massively parallel self-organizing maps: accelerate training on multicore CPUs, GPUs, and clusters

DimReductionClustering

sparse-som - Efficient Self-Organizing Map for Sparse Data

awesome-community-detection - A curated list of community detection research papers with implementations.

susi - SuSi: Python package for unsupervised, supervised and semi-supervised self-organizing maps (SOM)

orange - 🍊 :bar_chart: :bulb: Orange: Interactive data analysis

som-tsp - Solving the Traveling Salesman Problem using Self-Organizing Maps

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.