2012 ActiveSpectralClusteringviaIter

Subject Headings:

Notes

Spectral clustering is a widely used method for organizing data that only relies on pairwise similarity measurements. This makes its application to non-vectorial data straight-forward in principle, as long as all pairwise similarities are available. However, in recent years, numerous examples have emerged in which the cost of assessing similarities is substantial or prohibitive. We propose an active learning algorithm for spectral clustering that incrementally measures only those similarities that are most likely to remove uncertainty in an intermediate clustering solution. In many applications, similarities are not only costly to compute, but also noisy. We extend our algorithm to maintain running estimates of the true similarities, as well as estimates of their accuracy. Using this information, the algorithm updates only those estimates which are relatively inaccurate and whose update would most likely remove clustering uncertainty. We compare our methods on several datasets, including a realistic example where similarities are expensive and noisy. The results show a significant improvement in performance compared to the alternatives.

;

	Author	volume	Date Value	title	type	journal	titleUrl	doi	note	year
2012 ActiveSpectralClusteringviaIter	Fabian L. Wauthier Nebojsa Jojic Michael I. Jordan			Active Spectral Clustering via Iterative Uncertainty Reduction				10.1145/2339530.2339737		2012