Power-Law Graph Cuts

10/29/2014
by   Xiangyang Zhou, et al.
0

Algorithms based on spectral graph cut objectives such as normalized cuts, ratio cuts and ratio association have become popular in recent years because they are widely applicable and simple to implement via standard eigenvector computations. Despite strong performance for a number of clustering tasks, spectral graph cut algorithms still suffer from several limitations: first, they require the number of clusters to be known in advance, but this information is often unknown a priori; second, they tend to produce clusters with uniform sizes. In some cases, the true clusters exhibit a known size distribution; in image segmentation, for instance, human-segmented images tend to yield segment sizes that follow a power-law distribution. In this paper, we propose a general framework of power-law graph cut algorithms that produce clusters whose sizes are power-law distributed, and also does not fix the number of clusters upfront. To achieve our goals, we treat the Pitman-Yor exchangeable partition probability function (EPPF) as a regularizer to graph cut objectives. Because the resulting objectives cannot be solved by relaxing via eigenvectors, we derive a simple iterative algorithm to locally optimize the objectives. Moreover, we show that our proposed algorithm can be viewed as performing MAP inference on a particular Pitman-Yor mixture model. Our experiments on various data sets show the effectiveness of our algorithms.

READ FULL TEXT
research
02/20/2013

Spectral Clustering with Unbalanced Data

Spectral clustering (SC) and graph-based semi-supervised learning (SSL) ...
research
05/20/2012

Spectral Graph Cut from a Filtering Point of View

Spectral graph theory is well known and widely used in computer vision. ...
research
09/09/2013

Spectral Clustering with Imbalanced Data

Spectral clustering is sensitive to how graphs are constructed from data...
research
08/26/2016

Clustering and Community Detection with Imbalanced Clusters

Spectral clustering methods which are frequently used in clustering and ...
research
08/18/2023

A scalable clustering algorithm to approximate graph cuts

Due to its computational complexity, graph cuts for cluster detection an...
research
05/05/2011

GANC: Greedy Agglomerative Normalized Cut

This paper describes a graph clustering algorithm that aims to minimize ...
research
09/15/2023

On the Asymptotics of Graph Cut Objectives for Experimental Designs of Network A/B Testing

A/B testing is an effective way to assess the potential impacts of two t...

Please sign up or login with your details

Forgot password? Click here to reset