GANC: Greedy Agglomerative Normalized Cut

05/05/2011
by   Seyed Salim Tabatabaei, et al.
0

This paper describes a graph clustering algorithm that aims to minimize the normalized cut criterion and has a model order selection procedure. The performance of the proposed algorithm is comparable to spectral approaches in terms of minimizing normalized cut. However, unlike spectral approaches, the proposed algorithm scales to graphs with millions of nodes and edges. The algorithm consists of three components that are processed sequentially: a greedy agglomerative hierarchical clustering procedure, model order selection, and a local refinement. For a graph of n nodes and O(n) edges, the computational complexity of the algorithm is O(n log^2 n), a major improvement over the O(n^3) complexity of spectral methods. Experiments are performed on real and synthetic networks to demonstrate the scalability of the proposed approach, the effectiveness of the model order selection procedure, and the performance of the proposed algorithm in terms of minimizing the normalized cut metric.

READ FULL TEXT
research
08/18/2023

A scalable clustering algorithm to approximate graph cuts

Due to its computational complexity, graph cuts for cluster detection an...
research
06/06/2018

Normalized Cut with Adaptive Similarity and Spatial Regularization

In this paper, we propose a normalized cut segmentation algorithm with s...
research
05/24/2015

Tight Continuous Relaxation of the Balanced k-Cut Problem

Spectral Clustering as a relaxation of the normalized/ratio cut has beco...
research
07/22/2023

Spectral Normalized-Cut Graph Partitioning with Fairness Constraints

Normalized-cut graph partitioning aims to divide the set of nodes in a g...
research
05/12/2023

One-step Bipartite Graph Cut: A Normalized Formulation and Its Application to Scalable Subspace Clustering

The bipartite graph structure has shown its promising ability in facilit...
research
12/29/2022

Constant Approximation for Normalized Modularity and Associations Clustering

We study the problem of graph clustering under a broad class of objectiv...
research
10/29/2014

Power-Law Graph Cuts

Algorithms based on spectral graph cut objectives such as normalized cut...

Please sign up or login with your details

Forgot password? Click here to reset