• Corpus ID: 220686409

Spectral Clustering using Eigenspectrum Shape Based Nystrom Sampling

@article{Bouneffouf2020SpectralCU,
  title={Spectral Clustering using Eigenspectrum Shape Based Nystrom Sampling},
  author={Djallel Bouneffouf},
  journal={ArXiv},
  year={2020},
  volume={abs/2007.11416}
}
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… 
1 Citations

Tables from this paper

Etat de l'art sur l'application des bandits multi-bras
TLDR
Un examen complet des principaux développements récents dans de multiples applications réelles des bandits, identifions les tendances actuelles importantes and fournissons de nouvelles perspectives concernant l’avenir de ce domaine en plein essor.

References

SHOWING 1-10 OF 48 REFERENCES
Ensemble Minimum Sum of Squared Similarities sampling for Nyström-based spectral clustering
TLDR
A new sampling procedure called Ensemble Minimum Sum of Squared Similarities (EMS3) is introduced, which improves on this method by using weight mixtures in subsample selection, yielding more accurate low-rank approximations than existing ensemble Nyström methods.
Sampling with Minimum Sum of Squared Similarities for Nystrom-Based Large Scale Spectral Clustering
TLDR
A scalable Nystrom-based clustering algorithm with a new sampling procedure, Minimum Sum of Squared Similarities (MSSS), is proposed and a theoretical analysis of the upper error bound of the algorithm is provided.
Clusterability Analysis and Incremental Sampling for Nyström Extension Based Spectral Clustering
TLDR
The performance of Nyström method is analyzed in terms of cluster ability and an incremental sampling scheme is suggested that outperforms existing sampling schemes on various clustering tasks and image segmentation applications, and its efficiency is comparable withexisting sampling schemes.
Minimum Similarity Sampling Scheme for Nyström Based Spectral Clustering on Large Scale High-Dimensional Data
TLDR
Experiments show that the proposed sampling scheme outperforms other algorithms when applied in Nystrom based spectral clustering with higher accuracy, and lowers the time consumption for sampling.
Large Scale Spectral Clustering with Landmark-Based Representation
TLDR
This paper proposes a novel approach, called Landmark-based Spectral Clustering (LSC), for large scale clustering problems, where p representative data points are selected as the landmarks and the spectral embedding of the data can be efficiently computed with the landmark-based representation.
Ensemble Nystrom Method
TLDR
A new family of algorithms based on mixtures of Nystrom approximation, ensemble Nystrom algorithms, that yield more accurate low-rank approximations than the standard Nystrom method are introduced.
Optimal Landmark Selection for Nyström Approximation
  • Z. Fu
  • Computer Science
    ICONIP
  • 2014
TLDR
This work proposes a novel approach for optimizing landmark points for the Nystrom approximation by minimizing the approximation error for the input vectors instead of the original kernel.
Spectral grouping using the Nystrom method
TLDR
The contribution of this paper is a method that substantially reduces the computational requirements of grouping algorithms based on spectral partitioning making it feasible to apply them to very large grouping problems.
Spectral methods in machine learning and new strategies for very large datasets
TLDR
Two new algorithms for the approximation of positive-semidefinite kernels based on the Nyström method are presented, each of which demonstrates the improved performance of the approach relative to existing methods.
On sampling-based approximate spectral decomposition
TLDR
This paper addresses the problem of approximate singular value decomposition of large dense matrices that arises naturally in many machine learning applications and proposes an efficient adaptive sampling technique to select informative columns from the original matrix.
...
...