Pairwise clustering and graphical models

Noam Shental, Assaf Zomet, Tomer Hertz, Yair Weiss

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review


Significant progress in clustering has been achieved by algorithms that are based on pairwise affinities between the datapoints. In particular, spectral clustering methods have the advantage of being able to divide arbitrarily shaped clusters and are based on efficient eigenvector calculations. However, spectral methods lack a straightforward probabilistic interpretation which makes it difficult to automatically set parameters using training data. In this paper we use the previously proposed typical cut framework for pairwise clustering. We show an equivalence between calculating the typical cut and inference in an undirected graphical model. We show that for clustering problems with hundreds of datapoints exact inference may still be possible. For more complicated datasets, we show that loopy belief propagation (BP) and generalized belief propagation (GBP) can give excellent results on challenging clustering problems. We also use graphical models to derive a learning algorithm for affinity matrices based on labeled data.

Original languageEnglish
Title of host publicationAdvances in Neural Information Processing Systems 17 - Proceedings of the 2003 Conference, NIPS 2003
PublisherNeural information processing systems foundation
ISBN (Print)0262201526, 9780262201520
StatePublished - 2004
Externally publishedYes
Event17th Annual Conference on Neural Information Processing Systems, NIPS 2003 - Vancouver, BC, Canada
Duration: 8 Dec 200313 Dec 2003

Publication series

NameAdvances in Neural Information Processing Systems
ISSN (Print)1049-5258


Conference17th Annual Conference on Neural Information Processing Systems, NIPS 2003
CityVancouver, BC


Dive into the research topics of 'Pairwise clustering and graphical models'. Together they form a unique fingerprint.

Cite this