yuj-umd / fastscLinks
A fast implementation of spectral clustering on GPU-CPU Platform
☆32Updated 7 years ago
Alternatives and similar repositories for fastsc
Users that are interested in fastsc are comparing it to the libraries listed below
Sorting:
- Neural LSH [ICLR 2020] - Using supervised learning to produce better space partitions for fast nearest neighbor search.☆73Updated 4 years ago
- Subsampled Graph-Based DBSCAN☆11Updated 4 years ago
- Solving LPs with convergent message passing☆66Updated 2 years ago
- Quickly compute all maximal cliques of a graph☆80Updated 6 years ago
- Deep Learning framework in C++/CUDA that supports symbolic/automatic differentiation, dynamic computation graphs, tensor/matrix operation…☆53Updated 4 years ago
- NetworkX Addon to allow graph partitioning with METIS☆79Updated 2 years ago
- Code for ICML2019 paper: Learning to Route in Similarity Graphs☆58Updated last year
- Efficient graph clustering software for normalized cut and ratio association on undirected graphs. Copyright(c) 2008 Brian Kulis, Yuqiang…☆22Updated 13 years ago
- Library for performing spectral clustering in C++☆79Updated 2 years ago
- A framework for index based similarity search.☆19Updated 6 years ago
- Building KNN Graph for Billion High Dimensional Vectors Efficiently☆21Updated 6 years ago
- [NeurIPS 2019 Spotlight] High dimensional mean estimation and outlier detection in nearly-linear time.☆26Updated 6 years ago
- Scaling Up Subgraph Query Processing with Efficient Subgraph Matching by Shixuan Sun and Dr. Qiong Luo☆17Updated 6 years ago
- A convolutional neural network for graph classification in PyTorch☆91Updated 6 years ago
- A fork of Sebastian Nowozin's and Koji Tsuda's gboost code☆17Updated 12 years ago
- ☆31Updated 5 years ago
- Data augmentation utility for machine learning on 3D point clouds☆22Updated 8 years ago
- Light-weight GPU kernel interface for graph operations☆15Updated 5 years ago
- [ICLR 2019] Learning Representations of Sets through Optimized Permutations☆36Updated 6 years ago
- Parallel network flows using OpenMP and CUDA.☆28Updated 6 years ago
- C implementation of algorithms to find the Density-Friendly graph decomposition☆11Updated 5 years ago
- Embedded Graph Convolutional Neural Networks (EGCNN) in TensorFlow☆77Updated 7 years ago
- Cartesian k-means for approximate nearest neghbor search, codebook learning, etc.☆51Updated 12 years ago
- Implements the frequent directions algorithm for approximating matrices in streams☆33Updated 8 years ago
- Implementation of the Spline-Based Convolution Operator of SplineCNN in PyTorch☆183Updated 2 months ago
- A clustering algorithm that first finds the high-density regions (cluster-cores) of the data and then clusters the remaining points by hi…☆69Updated 7 years ago
- SRS - Fast Approximate Nearest Neighbor Search in High Dimensional Euclidean Space With a Tiny Index☆54Updated 10 years ago
- Implementation of Kernighan-Lin graph partitioning algorithm in Python☆50Updated 6 years ago
- A Distributed Multi-GPU System for Fast Graph Processing☆65Updated 6 years ago
- Fast search algorithm for product-quantized codes via hash-tables☆53Updated 7 years ago