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
- Graph Feature Representation/Vector Based On The Family Of Graph Spectral Distances (NIPS 2017).☆24Updated 4 years ago
- Neural LSH [ICLR 2020] - Using supervised learning to produce better space partitions for fast nearest neighbor search.☆73Updated 4 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
- Light-weight GPU kernel interface for graph operations☆15Updated 4 years ago
- ☆14Updated last year
- Code for ICML2019 paper: Learning to Route in Similarity Graphs☆58Updated 6 months ago
- SRS - Fast Approximate Nearest Neighbor Search in High Dimensional Euclidean Space With a Tiny Index☆55Updated 9 years ago
- [ICLR 2019] Learning Representations of Sets through Optimized Permutations☆36Updated 5 years ago
- Tensor spectral clustering.☆28Updated 7 years ago
- fast kernel evaluation in high dimensions via hashing☆23Updated 4 years ago
- IPC: A Graph Data Set Compiled from International Planning Competitions☆44Updated 5 years ago
- Implementation of the Multiscale Laplacian Graph Kernel☆18Updated 5 years ago
- Implementation of Deep Soft-K means☆28Updated 3 years ago
- HogWild++: A New Mechanism for Decentralized Asynchronous Stochastic Gradient Descent☆33Updated 8 years ago
- ☆8Updated 9 years ago
- Distributed NMF/NTF Library☆42Updated 2 months ago
- Source code for our IEEE ICDM 2017 paper "Glocalized Weisfeiler-Lehman Graph Kernels: Global-Local Feature Maps of Graphs".☆11Updated 7 years ago
- Easing non-convex optimization with neural networks.☆22Updated 6 years ago
- Fast search algorithm for product-quantized codes via hash-tables☆52Updated 6 years ago
- [NeurIPS 2019 Spotlight] High dimensional mean estimation and outlier detection in nearly-linear time.☆26Updated 5 years ago
- Quickly compute all maximal cliques of a graph☆76Updated 6 years ago
- Caffe version of code for our paper "Joint unsupervised learning of deep representations and image clusters"☆16Updated 7 years ago
- Legendre decomposition for tensors☆13Updated 6 years ago
- Large Scale Graphical Model☆24Updated 6 years ago
- graph-based substructure pattern mining algorithm (authors: Xifeng Yan, Jiawei Han) implementation☆11Updated 7 years ago
- Supplementary code to "Convolutional Neural Networks Generalization Utilizing the Data Graph Structure"☆51Updated 7 years ago
- Stochastic training of graph convolutional networks☆85Updated 2 years ago
- NetworkX Addon to allow graph partitioning with METIS☆78Updated last year
- Efficient LDA solution on GPUs.☆24Updated 6 years ago
- Proximal Asynchronous SAGA☆12Updated 7 years ago