A probabilistic framework for semi-supervised clustering

doi:10.1145/1014052.1014062

A probabilistic framework for semi-supervised clustering

Full Text:

Pdf

Buy this Article

Authors:	Sugato Basu	University of Texas at Austin, Austin, TX
	Mikhail Bilenko	University of Texas at Austin, Austin, TX
	Raymond J. Mooney	University of Texas at Austin, Austin, TX

Published in:

	· Proceeding
	KDD '04 Proceedings of the tenth ACM SIGKDD international conference on Knowledge discovery and data mining
	ACM New York, NY, USA ©2004 table of contents ISBN:1-58113-888-1 doi>10.1145/1014052.1014062

	2004 Article
Bibliometrics
· Downloads (6 Weeks): 6 · Downloads (12 Months): 240 · Citation Count: 131

Tools and Resources

Buy this Article
Request Permissions
TOC Service:
- Email
- RSS
Save to Binder
Export Formats:
- BibTeX
- EndNote
- ACM Ref
Upcoming Conference:
- KDD '12

Tags: algorithms data mining distance metric learning hidden markov random fields learning semi-supervised clustering

The ACM Digital Library is published by the Association for Computing Machinery. Copyright © 2012 ACM, Inc.
Terms of Usage Privacy Policy Code of Ethics Contact Us

Useful downloads:

Adobe Acrobat

QuickTime

Windows Media Player

Real Player