antoniocavalcante

annoy-java

Approximate nearest neighbors in Java

coresg

This repository contains an implementation of CORE-SG, a replacement for the complete Mutual Reachability Graph used in density-based methods. CORE-SG can be used to speed up the computation of density-based Minimum Spanning Trees that are the based of several unsupervised and semi-supervised methods, e.g. clustering, semi-supervised clustering, semi-supervised classification and outlier detection.

hdbscan

A high performance implementation of HDBSCAN clustering.

hdbscan-java

Java implementation of HDBSCAN* and RNG-HDBSCAN*

mustache

pynndescent

A Python nearest neighbor descent for approximate nearest neighbors

UnifiedView

Unified Framework of Density-based Clustering for Semi-supervised Classification

antoniocavalcante/mustache

antoniocavalcante/hdbscan-java

Java implementation of HDBSCAN* and RNG-HDBSCAN*

antoniocavalcante/annoy-java

Approximate nearest neighbors in Java

antoniocavalcante/coresg

This repository contains an implementation of CORE-SG, a replacement for the complete Mutual Reachability Graph used in density-based methods. CORE-SG can be used to speed up the computation of density-based Minimum Spanning Trees that are the based of several unsupervised and semi-supervised methods, e.g. clustering, semi-supervised clustering, semi-supervised classification and outlier detection.

antoniocavalcante/hdbscan

A high performance implementation of HDBSCAN clustering.

antoniocavalcante/pynndescent

A Python nearest neighbor descent for approximate nearest neighbors

antoniocavalcante/UnifiedView

Unified Framework of Density-based Clustering for Semi-supervised Classification