Beyond Pairwise Clustering
Sameer Agarwal, Jongwoo Lim, Lihi Zelnik‐Manor et al. · IEEE Computer Society Conference on Computer Vision and Pattern Recognition/Proceedings - IEEE Computer Society Conference on Computer Vision and Pattern Recognition/Proceedings · 2005
We consider the problem of clustering in domains where the affinity relations are not dyadic (pairwise), but rather triadic, tetradic or higher. The problem is an instance of the hypergraph partitioning problem. We propose a two-step algorithm for solving this problem. In the first step we use a novel scheme to approximate the hypergraph using a weighted graph. In the second step a spectral partitioning algorithm is used to partition the vertices of this graph. The algorithm is capable of handling hyperedges of all orders including order two, thus incorporating information of all orders simultaneously. We present a theoretical analysis that relates our algorithm to an existing hypergraph partitioning algorithm and explain the reasons for its superior performance. We report the performance of our algorithm on a variety of computer vision problems and compare it to several existing hypergraph partitioning algorithms.
Cited by 244 works. doi:10.1109/cvpr.2005.89
Authors
References
- Normalized cuts and image segmentation
- An Efficient Heuristic Procedure for Partitioning Graphs
- Finding groups in data: an introduction to cluster analysis
- Generalizing the Hough transform to detect arbitrary shapes
- On Spectral Clustering: Analysis and an algorithm
- Analysis of Individual Differences in Multidimensional Scaling Via an N-way Generalization of “Eckart-Young” Decomposition
- From few to many: illumination cone models for face recognition under variable lighting and pose
- Numerical methods for least squares problems
- Numerical Methods for Least Squares Problems
- A Linear-Time Heuristic for Improving Network Partitions