Spectral Clustering using Eigenspectrum Shape Based Nystrom Sampling
arXiv:2007.11416
Abstract
Spectral clustering has shown a superior performance in analyzing the cluster structure. However, its computational complexity limits its application in analyzing large-scale data. To address this problem, many low-rank matrix approximating algorithms are proposed, including the Nystrom method - an approach with proven approximate error bounds. There are several algorithms that provide recipes to construct Nystrom approximations with variable accuracies and computing times. This paper proposes a scalable Nystrom-based clustering algorithm with a new sampling procedure, Centroid Minimum Sum of Squared Similarities (CMS3), and a heuristic on when to use it. Our heuristic depends on the eigen spectrum shape of the dataset, and yields competitive low-rank approximations in test datasets compared to the other state-of-the-art methods
References in corpus (7)
- Beyond Backprop: Online Alternating Minimization with Auxiliary Variables
- Interpretable Multi-Objective Reinforcement Learning through Policy Orchestration
- Unified Models of Human Behavioral Agents in Bandits, Contextual Bandits and RL
- A Bandit Approach to Posterior Dialog Orchestration Under a Budget
- Online learning with Corrupted context: Corrupted Contextual Bandits
- Hyper-parameter Tuning for the Contextual Bandit
- Contextual Bandit with Missing Rewards