Jump to ContentJump to Main Navigation
Semi-Supervised Learning$
Users without a subscription are not able to see the full content.

Olivier Chapelle, Bernhard Scholkopf, and Alexander Zien

Print publication date: 2006

Print ISBN-13: 9780262033589

Published to MIT Press Scholarship Online: August 2013

DOI: 10.7551/mitpress/9780262033589.001.0001

Show Summary Details
Page of

PRINTED FROM MIT PRESS SCHOLARSHIP ONLINE (www.mitpress.universitypressscholarship.com). (c) Copyright The MIT Press, 2021. All Rights Reserved. An individual user may print out a PDF of a single chapter of a monograph in MITSO for personal use.date: 23 September 2021

Probabilistic Semi-Supervised Clustering with Constraints

Probabilistic Semi-Supervised Clustering with Constraints

(p.73) 5 Probabilistic Semi-Supervised Clustering with Constraints
Semi-Supervised Learning

Basu Sugato

Bilenko Mikhail

Banerjee Arindam

Mooney Raymond

The MIT Press

This chapter discusses a problem resulting from certain clustering tasks from which limited supervision is obtained in the form of pairwise constraints—semi-supervised clustering. Semi-supervised clustering is an instance of semi-supervised learning stemming from a traditional unsupervised learning setting. Several algorithms exist for enhancing clustering quality by using supervision in the form of constraints. These algorithms typically utilize the pairwise constraints to either modify the clustering objective function or to learn the clustering distortion measure. This chapter describes an approach that employs hidden Markov random fields (HMRFs) as a probabilistic generative model for semi-supervised clustering, thereby providing a principled framework for incorporating constraint-based supervision into prototype-based clustering. The HMRF-based model allows the use of a broad range of clustering distortion measures, including Bregman divergences and directional distance measures, making it applicable to a number of domains.

Keywords:   clustering tasks, pairwise constraints, semi-supervised clustering, hidden Markov random fields, HMRFs, probabilistic generative model, Bregman divergences, directional distance measures

MIT Press Scholarship Online requires a subscription or purchase to access the full text of books within the service. Public users can however freely search the site and view the abstracts and keywords for each book and chapter.

Please, subscribe or login to access full text content.

If you think you should have access to this title, please contact your librarian.

To troubleshoot, please check our FAQs, and if you can't find the answer there, please contact us.