An introduction to gamma-convergence for spectral clustering

Document Type

Conference Article

Publication Title

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Abstract

The problem of clustering is to partition the dataset into groups such that elements belonging to the same group are similar and elements belonging to the different groups are dissimilar. The unsupervised nature of the problem makes it widely applicable and also tough to solve objectively. Clustering in the context of image data is referred to as image segmentation. Distance based methods such as K-means fail to detect the non-globular clusters and hence spectral clustering was proposed to overcome this problem. This method detects the non globular structures by projecting the data set into a subspace, in which the usual clustering methods work well. Gamma convergence is the study of asymptotic behavior of minimizers of a family of minimization problems. Such a limit of minimizers is referred to as the gamma limit. Calculating the gamma limit for various variational problems has been proved useful - giving a different algorithm and insights into why existing methods work. In this article, we calculate the gamma limit of the spectral clustering methods, analyze its properties, and compare them with minimum spanning tree based clustering methods and spectral clustering methods.

First Page

185

Last Page

196

DOI

10.1007/978-3-319-66272-5_16

Publication Date

1-1-2017

Comments

Open Access, Green

This document is currently not available here.

Share

COinS