On some spectral properties of stochastic similarity matrices for data clustering

arXiv1910.01392MaRDI QIDQ6326467FDOQ6326467

Ralf Pihlström, Martin Ryner, Denis Gaidashev

Publication date: 3 October 2019

Abstract: Clustering in image analysis is a central technique that allows to classify elements of an image. We describe a simple clustering technique that uses the method of similarity matrices. We expand upon recent results in spectral analysis for Gaussian mixture distributions, and in particular, provide conditions for the existence of a spectral gap between the leading and remaining eigenvalues for matrices with entries from a Gaussian mixture with two real univariate components. Furthermore, we describe an algorithm in which a collection of image elements is treated as a dynamical system in which the existence of the mentioned spectral gap results in an efficient clustering.

Mathematics Subject Classification ID

Random matrices (probabilistic aspects) (60B20) Clustering in the social and behavioral sciences (91C20)

This page was built for publication: On some spectral properties of stochastic similarity matrices for data clustering

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6326467)