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
- Efficient graph clustering software for normalized cut and ratio association on undirected graphs. Copyright(c) 2008 Brian Kulis, Yuqiang…☆22Updated 13 years ago
- GPU Accelerated Subsampled Newton Method for Convex Optimization☆8Updated 7 years ago
- Deep Learning framework in C++/CUDA that supports symbolic/automatic differentiation, dynamic computation graphs, tensor/matrix operation…☆53Updated 3 years ago
- Subsampled Graph-Based DBSCAN☆11Updated 4 years ago
- Quickly compute all maximal cliques of a graph☆80Updated 6 years ago
- Solving LPs with convergent message passing☆66Updated 2 years ago
- [NeurIPS 2019 Spotlight] High dimensional mean estimation and outlier detection in nearly-linear time.☆26Updated 5 years ago
- Building KNN Graph for Billion High Dimensional Vectors Efficiently☆21Updated 6 years ago
- A convolutional neural network for graph classification in PyTorch☆91Updated 6 years ago
- Implements the frequent directions algorithm for approximating matrices in streams☆32Updated 8 years ago
- C implementation of algorithms to find the Density-Friendly graph decomposition☆11Updated 5 years ago
- A framework for index based similarity search.☆19Updated 6 years ago
- A fork of Sebastian Nowozin's and Koji Tsuda's gboost code☆17Updated 12 years ago
- graph-based substructure pattern mining algorithm (authors: Xifeng Yan, Jiawei Han) implementation☆11Updated 8 years ago
- [ICLR 2019] Learning Representations of Sets through Optimized Permutations☆36Updated 6 years ago
- Library for performing spectral clustering in C++☆78Updated 2 years ago
- IPC: A Graph Data Set Compiled from International Planning Competitions☆46Updated 5 years ago
- Cartesian k-means for approximate nearest neghbor search, codebook learning, etc.☆51Updated 11 years ago
- Code for ICML2019 paper: Learning to Route in Similarity Graphs☆58Updated last year
- Code release for NeurIPS 2019 paper "End to End Learning and Optimization on Graphs"☆90Updated 5 years ago
- Light-weight GPU kernel interface for graph operations☆15Updated 5 years ago
- NetworkX Addon to allow graph partitioning with METIS☆79Updated 2 years ago
- Graph kernels☆56Updated 3 years 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☆55Updated 10 years ago
- GraphZoom: A Multi-level Spectral Approach for Accurate and Scalable Graph Embedding☆114Updated 2 years ago
- kmeans clustering with multi-GPU capabilities☆119Updated 2 years ago
- A Parallel Graphlet Decomposition Library for Large Graphs☆88Updated 6 years ago
- Auction algorithm for solving linear assignment problem (LAP)☆72Updated 3 years ago