A Greedy Strategy for Graph Cut
Feiping Nie, Shenfei Pei, Zengwei Zheng, Rong Wang, and Xuelong Li

TL;DR
This paper introduces GGC, a greedy graph cut algorithm that efficiently merges clusters to optimize the normalized cut problem, providing unique solutions with improved performance over traditional methods.
Contribution
The paper presents a novel greedy strategy for graph cut that reduces computational complexity and guarantees unique solutions, outperforming existing algorithms in normalized cut tasks.
Findings
GGC achieves nearly linear computational complexity.
GGC often finds better solutions than traditional methods.
GGC outperforms several state-of-the-art clustering algorithms.
Abstract
We propose a Greedy strategy to solve the problem of Graph Cut, called GGC. It starts from the state where each data sample is regarded as a cluster and dynamically merges the two clusters which reduces the value of the global objective function the most until the required number of clusters is obtained, and the monotonicity of the sequence of objective function values is proved. To reduce the computational complexity of GGC, only mergers between clusters and their neighbors are considered. Therefore, GGC has a nearly linear computational complexity with respect to the number of samples. Also, unlike other algorithms, due to the greedy strategy, the solution of the proposed algorithm is unique. In other words, its performance is not affected by randomness. We apply the proposed method to solve the problem of normalized cut which is a widely concerned graph cut problem. Extensive…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsGraph Theory and Algorithms · Constraint Satisfaction and Optimization · Data Management and Algorithms
