Optimum cut-based clustering
Authors:
- 1 November 2007
- journal article
- Published by Elsevier in Signal Processing
- Vol. 87 (11) , 2491-2502
Abstract
No abstract availableKeywords
This publication has 11 references indexed in Scilit:
- Spectral grouping using the nystrom methodIEEE Transactions on Pattern Analysis and Machine Intelligence, 2004
- Normalized cuts and image segmentationIEEE Transactions on Pattern Analysis and Machine Intelligence, 2000
- Spectral partitioning with multiple eigenvectorsDiscrete Applied Mathematics, 1999
- Segmentation using eigenvectors: a unifying view1999
- An optimal graph theoretic approach to data clustering: theory and its application to image segmentationIEEE Transactions on Pattern Analysis and Machine Intelligence, 1993
- Optimal approximations by piecewise smooth functions and associated variational problemsCommunications on Pure and Applied Mathematics, 1989
- Stochastic Relaxation, Gibbs Distributions, and the Bayesian Restoration of ImagesIEEE Transactions on Pattern Analysis and Machine Intelligence, 1984
- Graph theoretical clustering based on limited neighbourhood setsPattern Recognition, 1982
- Algorithm AS 136: A K-Means Clustering AlgorithmJournal of the Royal Statistical Society Series C: Applied Statistics, 1979
- Graph-Theoretical Methods for Detecting and Describing Gestalt ClustersIEEE Transactions on Computers, 1971