Alternatives and similar repositories for hdbscan_paper:

Users that are interested in hdbscan_paper are comparing it to the libraries listed below

• ciortanmadalina / high_noise_clustering
  Techniques to cluster very noisy data (dropouts or random noise)
  ☆65Updated 5 years ago
• VincentRouvreau / GUDHI_presentation-NIPS_2017
  PDF and notebooks of GUDHI presentation @ NIPS 2017
  ☆14Updated 7 years ago
• franrole / cclust_package
  ☆33Updated 4 years ago
• abojchevski / rsc
  Robust Spectral Clustering. Implementation of "Robust Spectral Clustering for Noisy Data: Modeling Sparse Corruptions Improves Latent Emb…
  ☆26Updated 5 years ago
• metterlein / spectral_clustering
  ☆19Updated 6 years ago
• xgfs / NetLSD
  NetLSD descriptors for graphs. Compare and analyze graph structure on multiple levels!
  ☆59Updated 5 years ago
• nphdang / GE-FSG
  Graph Embedding via Frequent Subgraphs
  ☆45Updated 4 years ago
• snap-stanford / masa
  Motif-Aware State Assignment in Noisy Time Series Data
  ☆23Updated 4 years ago
• lmcinnes / umap_paper_notebooks
  Notebooks in support of the UMAP paper
  ☆44Updated 3 years ago
• ksanjeevan / mapper-tda
  Mapper implementation (Topological Data Analysis) in Python
  ☆65Updated 6 years ago
• amueller / information-theoretic-mst
  Information Theoretic Clustering using Minimum Spanning Trees
  ☆20Updated 6 years ago
• mlarionov / machine_learning_POC
  The repository for various machine learning POC
  ☆28Updated 3 years ago
• mmortazavi / UMAP_Nonlinear-Dimensionality-Reduction_Benchmark
  A primer to Uniform Manifold Approximation and Projection (UMAP)
  ☆15Updated 6 years ago
• lmcinnes / sstsne
  Semi-Supervised t-SNE using a Bayesian prior based on partial labelling
  ☆42Updated 8 years ago
• uzhdag / pathpy
  An OpenSource python package for the analysis of time series data on networks using higher-order and multi-order graphical models.
  ☆50Updated last year
• dzambon / cdg
  Change Detection in a sequence of Graphs
  ☆22Updated 2 years ago
• google / quickshift
  A clustering algorithm that first finds the high-density regions (cluster-cores) of the data and then clusters the remaining points by hi…
  ☆68Updated 6 years ago
• angeloschatzimparmpas / t-viSNE
  t-viSNE: Interactive Assessment and Interpretation of t-SNE Projections
  ☆17Updated 2 years ago
• GemsLab / MCbook_Individual-Collective_GraphMining
  Slides and code for the Morgan Claypool book on "Individual and Collective Graph Mining: Principles, Algorithms and Applications"
  ☆19Updated 4 years ago
• FlorentF9 / skstab
  Clustering stability analysis in Python with a scikit-learn compatible API.
  ☆21Updated last year
• ralphhaygood / sklearn-gbmi
  scikit-learn gradient-boosting-model interactions
  ☆25Updated last year
• bdwilliamson / vimpy
  Perform inference on algorithm-agnostic variable importance in Python
  ☆20Updated 2 years ago
• lnferreira / time_series_clustering_via_community_detection
  Code used in the paper "Time Series Clustering via Community Detection in Networks"
  ☆37Updated 5 years ago
• gagolews / clustering-benchmarks
  A framework for benchmarking clustering algorithms
  ☆38Updated last week
• stephantul / somber
  Recursive Self-Organizing Map/Neural Gas.
  ☆52Updated 2 years ago
• lmcinnes / hypergraph
  A library for hypergraphs and hypergraph algorithms
  ☆28Updated 9 years ago
• IIT-LAND / reval_clustering
  ☆29Updated 3 years ago
• Hongyuy / sbrl
  repository for R library "sbrlmod"
  ☆25Updated 11 months ago
• mutualinfo / mutual_info
  Putting GaelVaroquaux's mutual_info gist in a project until it has a better home.
  ☆30Updated 10 months ago
• hrayrhar / T-CorEx
  Implementation of linear CorEx and temporal CorEx.
  ☆37Updated 3 years ago