Unsupervised clustering can be significantly improved using supervision in the form of pairwise constraints, i.e., pairs of instances labeled as belonging to same or different clusters. In recent years, a number of algorithms have been proposed for enhancing clustering quality by employing such supe
โฆ LIBER โฆ
[ACM Press the 2004 ACM SIGKDD international conference - Seattle, WA, USA (2004.08.22-2004.08.25)] Proceedings of the 2004 ACM SIGKDD international conference on Knowledge discovery and data mining - KDD '04 - A probabilistic framework for semi-supervised clustering
โ Scribed by Basu, Sugato; Bilenko, Mikhail; Mooney, Raymond J.
- Book ID
- 125804701
- Publisher
- ACM Press
- Year
- 2004
- Weight
- 183 KB
- Category
- Article
No coin nor oath required. For personal study only.
๐ SIMILAR VOLUMES
[ACM Press the 2004 ACM SIGKDD internati
โ
Basu, Sugato; Bilenko, Mikhail; Mooney, Raymond J.
๐
Article
๐
2004
๐
ACM Press
โ 183 KB
[ACM Press the 2004 ACM SIGKDD internati
โ
Gilburd, Bobi; Schuster, Assaf; Wolff, Ran
๐
Article
๐
2004
๐
ACM Press
โ 178 KB
[ACM Press the 2004 ACM SIGKDD internati
โ
Dhillon, Inderjit S.; Guan, Yuqiang; Kulis, Brian
๐
Article
๐
2004
๐
ACM Press
โ 251 KB
[ACM Press the 2004 ACM SIGKDD internati
โ
Keogh, Eamonn; Lonardi, Stefano; Ratanamahatana, Chotirat Ann
๐
Article
๐
2004
๐
ACM Press
โ 753 KB
[ACM Press the 2004 ACM SIGKDD internati
โ
Steyvers, Mark; Smyth, Padhraic; Rosen-Zvi, Michal; Griffiths, Thomas
๐
Article
๐
2004
๐
ACM Press
โ 316 KB
[ACM Press the 2004 ACM SIGKDD internati
โ
Steyvers, Mark; Smyth, Padhraic; Rosen-Zvi, Michal; Griffiths, Thomas
๐
Article
๐
2004
๐
ACM Press
โ 316 KB
We propose a new unsupervised learning technique for extracting information from large text collections. We model documents as if they were generated by a two-stage stochastic process. Each author is represented by a probability distribution over topics, and each topic is represented as a probabilit