Entropy and information theory
Entropy and information theory
Elements of information theory
Elements of information theory
Normalized Cuts and Image Segmentation
IEEE Transactions on Pattern Analysis and Machine Intelligence
IEEE Transactions on Pattern Analysis and Machine Intelligence
Unsupervised Image Clustering Using the Information Bottleneck Method
Proceedings of the 24th DAGM Symposium on Pattern Recognition
Segmentation Using Eigenvectors: A Unifying View
ICCV '99 Proceedings of the International Conference on Computer Vision-Volume 2 - Volume 2
Multiclass Spectral Clustering
ICCV '03 Proceedings of the Ninth IEEE International Conference on Computer Vision - Volume 2
Graph Partitioning by Spectral Rounding: Applications in Image Segmentation and Clustering
CVPR '06 Proceedings of the 2006 IEEE Computer Society Conference on Computer Vision and Pattern Recognition - Volume 1
An analysis of the elastic net approach to the traveling salesman problem
Neural Computation
Multiway partitioning via geometric embeddings, orderings, and dynamic programming
IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems
Understanding IPv6 Usage: Communities and Behaviors
APNOMS '08 Proceedings of the 11th Asia-Pacific Symposium on Network Operations and Management: Challenges for Next Generation Network Operations and Service Management
| Hi-index | 0.01 |
We describe an annealing procedure that computes the normalized N-cut of a weighted graph G. The first phase transition computes the solution of the approximate normalized 2-cut problem, while the low temperature solution computes the normalized N-cut. The intermediate solutions provide a sequence of refinements of the 2-cut that can be used to split the data to K clusters with 2=