mlsanityData to 7 Oct 2026

Spectral Toolkit of Algorithms for Graphs: Technical Report (2)

arXiv 2407.07096 ↗First posted 6 Jun 2024cs.DS cs.LG cs.MScited by 0

Not on the map. Why?

Abstract (arXiv)

Spectral Toolkit of Algorithms for Graphs (STAG) is an open-source library for efficient graph algorithms. This technical report presents the newly implemented component on locality sensitive hashing, kernel density estimation, and fast spectral clustering. The report includes a user's guide to the newly implemented algorithms, experiments and demonstrations of the new functionality, and several technical considerations behind our development.

Key facts. No citing papers in the map yet (data through 7 Oct 2026). Builds on 9 of its 32 references that are in the map. First posted on arXiv 6 Jun 2024.

Builds on

9 of 32 references.

References · 9

  1. 2016Efficient and robust approximate nearest neighbor search using Hierarchical Navigable Small World graphscited by 853
  2. 2015Practical and Optimal LSH for Angular Distancecited by 105
  3. 2015Optimal Data-Dependent Hashing for Approximate Near Neighborscited by 43
  4. 2018Hashing-Based-Estimators for Kernel Density in High Dimensionscited by 31
  5. 2020Kernel Density Estimation through Density Constrained Near Neighbor Searchcited by 26
  6. 2017Distributed Graph Clustering and Sparsificationcited by 9
  7. 2021Faster Kernel Matrix Algebra via Density Estimationcited by 7
  8. 2023Spectral Toolkit of Algorithms for Graphs: Technical Report (1)cited by 3
  9. 2023Fast Approximation of Similarity Graphs with Kernel Density Estimationcited by 3

Built on by

Not cited yet.