XiaogangHuang

abseil-cpp

Abseil Common Libraries (C++)

ann-benchmarks

Benchmarks of approximate nearest neighbor libraries in Python

Data_Structures_and_Algorithms

denmune-clustering-algorithm

DenMune a clustering algorithm that can find clusters of arbitrary size, shapes and densities in two-dimensions. Higher dimensions are first reduced to 2-D using the t-sne. The algorithm relies on a single parameter K (the number of nearest neighbors). The results show the superiority of DenMune. Enjoy the simplicty but the power of DenMune.

GAP-DBC

google-research

Google Research

GriT-DBSCAN

hdbscan-java

Java implementation of HDBSCAN* and RNG-HDBSCAN*

Meanshift

MFC

XiaogangHuang/GriT-DBSCAN

XiaogangHuang/abseil-cpp

Abseil Common Libraries (C++)

XiaogangHuang/ann-benchmarks

Benchmarks of approximate nearest neighbor libraries in Python

XiaogangHuang/Data_Structures_and_Algorithms

XiaogangHuang/denmune-clustering-algorithm

DenMune a clustering algorithm that can find clusters of arbitrary size, shapes and densities in two-dimensions. Higher dimensions are first reduced to 2-D using the t-sne. The algorithm relies on a single parameter K (the number of nearest neighbors). The results show the superiority of DenMune. Enjoy the simplicty but the power of DenMune.

XiaogangHuang/GAP-DBC

XiaogangHuang/google-research

Google Research

XiaogangHuang/hdbscan-java

Java implementation of HDBSCAN* and RNG-HDBSCAN*

XiaogangHuang/Meanshift

XiaogangHuang/MFC

XiaogangHuang/RTree

N-dimensional RTree implementation in C++