yuj-umd / fastsc
A fast implementation of spectral clustering on GPU-CPU Platform
☆31Updated 6 years ago
Alternatives and similar repositories for fastsc:
Users that are interested in fastsc are comparing it to the libraries listed below
- C implementation of algorithms to find the Density-Friendly graph decomposition☆12Updated 4 years ago
- Bunch of aproximated graph edit distance algorithms.☆33Updated 6 years ago
- Light-weight GPU kernel interface for graph operations☆15Updated 4 years ago
- Implementation of the Multiscale Laplacian Graph Kernel☆18Updated 5 years ago
- Efficient graph clustering software for normalized cut and ratio association on undirected graphs. Copyright(c) 2008 Brian Kulis, Yuqiang…☆22Updated 12 years ago
- Neural LSH [ICLR 2020] - Using supervised learning to produce better space partitions for fast nearest neighbor search.☆73Updated 4 years ago
- SRS - Fast Approximate Nearest Neighbor Search in High Dimensional Euclidean Space With a Tiny Index☆55Updated 9 years ago
- graph-based substructure pattern mining algorithm (authors: Xifeng Yan, Jiawei Han) implementation☆11Updated 7 years ago
- Graph Feature Representation/Vector Based On The Family Of Graph Spectral Distances (NIPS 2017).☆24Updated 5 years ago
- fast kernel evaluation in high dimensions via hashing☆23Updated 4 years ago
- A Persistent Weisfeiler–Lehman Procedure for Graph Classification☆61Updated 3 years ago
- Implements the frequent directions algorithm for approximating matrices in streams☆32Updated 7 years ago
- Building KNN Graph for Billion High Dimensional Vectors Efficiently☆21Updated 6 years ago
- A framework for index based similarity search.☆19Updated 5 years ago
- NetworkX Addon to allow graph partitioning with METIS☆78Updated last year
- Geo2DR: A Python and PyTorch library for learning distributed representations of graphs.☆45Updated last year
- IPC: A Graph Data Set Compiled from International Planning Competitions☆44Updated 5 years ago
- A Python implementation of a fast approximation of the Weisfeiler-Lehman Graph Kernels.☆23Updated 5 years ago
- Learning Graph Distances with Message PassingNeural Networks☆13Updated 8 months ago
- Deep Learning framework in C++/CUDA that supports symbolic/automatic differentiation, dynamic computation graphs, tensor/matrix operation…☆53Updated 3 years ago
- Optimization and Generalization Analysis of Transduction through Gradient Boosting and Application to Multi-scale Graph Neural Networks☆13Updated 4 years ago
- Legendre decomposition for tensors☆13Updated 6 years ago
- Code release for NeurIPS 2019 paper "End to End Learning and Optimization on Graphs"☆88Updated 5 years ago
- Mean-shift clustering in Python in 100 lines☆13Updated 6 years ago
- Network Density of States (https://arxiv.org/abs/1905.09758) (KDD 2019)☆25Updated 5 years ago
- Large Scale Graphical Model☆24Updated 6 years ago
- Supplementary Code for Unsupervised Neural Quantization for Compressed-Domain Similarity Search☆36Updated 5 years ago
- Fast search algorithm for product-quantized codes via hash-tables☆53Updated 6 years ago
- Code for ICML2019 paper: Learning to Route in Similarity Graphs☆58Updated 8 months ago
- The reference implementation of FEATHER from the CIKM '20 paper "Characteristic Functions on Graphs: Birds of a Feather, from Statistical…☆50Updated 2 years ago