evilyingyun Goto Github PK

procrustes-analysis

- Implementations for computing optimal solutions to Procrustes problems

pymongeampere

Python interface for a 2D optimal transport / Monge Ampère solver using Laguerre diagrams

quickshift

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 cluster-cores than the singleton modes found by popular algorithm such as mean shift. (https://arxiv.org/abs/1805.07909)

rdist

An R package to calculate pairwise distances

s-wmd

Code for Supervised Word Mover's Distance (SWMD)

security-news

Information Security News

semi-discrete-transport

sources

spark-notes

spark-py-notebooks

Apache Spark & Python (pySpark) tutorials for Big Data Analysis and Machine Learning as IPython / Jupyter notebooks

spectra

A header-only C++ library for large scale eigenvalue problems

subspaceot

tartu-gromov-wasserstein

transfer-learning

transferlearning

Everything about Transfer Learning and Domain Adaptation--迁移学习

tree-wasserstein

A python module for fast calculation of the wasserstein distance on tree metrics implemented by C++.

tweet-stance-prediction

Applying NLP transfer learning techniques to predict Tweet stance

twitter_nlp

Twitter NLP Tools

udacimak

Udacity Nanodegree and Course Downloader

undoing-bias

Undoing the Damage of Dataset Bias

visbeat

Code for making anything dance to anything

wassersteindictionarylearning

Morgan A. Schmitz., Matthieu Heitz, Nicolas Bonneel, Fred Ngole, David Coeurjolly, Marco Cuturi, Gabriel Peyré, and Jean-Luc Starck. "Wasserstein dictionary learning: Optimal transport-based unsupervised nonlinear dictionary learning." SIAM Journal on Imaging Sciences, 2018

word2gm

Word to Gaussian Mixture Model