Stars
A library for efficient similarity search and clustering of dense vectors.
Productive, portable, and performant GPU programming in Python.
Seamless operability between C++11 and Python
Approximate Nearest Neighbors in C++/Python optimized for memory usage and loading/saving to disk
Fit interpretable models. Explain blackbox machine learning.
BanditPAM C++ implementation and Python package
Combining tree-boosting with Gaussian process and mixed effects models
The Graph-Cut RANSAC algorithm proposed in paper: Daniel Barath and Jiri Matas; Graph-Cut RANSAC, Conference on Computer Vision and Pattern Recognition, 2018. It is available at http://openaccess.t…
The Fast Downward domain-independent classical planning system
Fast and lightweight header-only C++ library (with Python bindings) for approximate nearest neighbor search
Fast, high-quality forecasts on relational and multivariate time-series data powered by new feature learning algorithms and automated ML.
Python3 binding to mRMR Feature Selection algorithm (currently not maintained)
Entropy rate superpixel segmentation source code
A clustering algorithm that first finds the high-density regions (cluster-cores) of the data and then clusters the remaining points by hill-climbing. Such seedings act as more stable and expressive…
Generalized Optimal Sparse Decision Trees
Generalized Optimal Sparse Decision Trees
High-performance Non-negative Matrix Factorizations (NMF) - Python/C++
ubc-systopia / treeFarms
Forked from ubc-systopia/gosdt-guessesTrees FAst RashoMon Sets
Konclude: A parallel, tableau-based, high-performance reasoner for the Description Logic SROIQV(D)/the Web Ontology Language (OWL) 2 DL
Code and supplementary material from the KDD 2016 paper "Skinny-dip: Clustering in a sea of noise" by Samuel Maurus and Claudia Plant.
S2DL: A Superpixel-based and Spatially-regularized Diffusion Learning Method for Unsupervised Hyperspectral Image Clustering