Estimation of Spectral Clustering Hyper Parameters

08/10/2019
by   Sioan Zohar, et al.
0

Robust automation of analysis procedures capable of handling diverse data sets is critical for high data throughput experiments at the Linac Coherent Light Source (LCLS). One challenge encountered in this process is determining the number of clusters required for the execution of conventional clustering algorithms. It is demonstrated here that bi-cross validation of the inverted and regularized Laplacian used in the spectral clustering algorithm, yields a robust minimum at the predicted number of clusters and kernel hyper parameters. These results indicate that the process of estimating the number of clusters should not be divorced from the process of estimating other hyper parameters. Applying this method to LCLS x-ray scattering data demonstrates the ability to identify clusters of dropped shots without manually setting boundaries on detector fluence and provides a path towards identifying rare events.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
02/22/2023

Approximate spectral clustering with eigenvector selection and self-tuned k

The recently emerged spectral clustering surpasses conventional clusteri...
research
12/17/2017

Path-Based Spectral Clustering: Guarantees, Robustness to Outliers, and Fast Algorithms

We consider the problem of clustering with the longest leg path distance...
research
09/16/2013

Regularized Spectral Clustering under the Degree-Corrected Stochastic Blockmodel

Spectral clustering is a fast and popular algorithm for finding clusters...
research
08/18/2023

Eigenvalue-based Incremental Spectral Clustering

Our previous experiments demonstrated that subsets collections of (short...
research
03/12/2020

Bringing in the outliers: A sparse subspace clustering approach to learn a dictionary of mouse ultrasonic vocalizations

Mice vocalize in the ultrasonic range during social interactions. These ...
research
02/06/2019

An Automated Spectral Clustering for Multi-scale Data

Spectral clustering algorithms typically require a priori selection of i...
research
07/10/2016

Spectral Clustering for Optical Confirmation and Redshift Estimation of X-ray Selected Galaxy Cluster Candidates in the SDSS Stripe 82

We develop a galaxy cluster finding algorithm based on spectral clusteri...

Please sign up or login with your details

Forgot password? Click here to reset