2003 SpectralLearning

• (Kamvar et al., 2003) ⇒ Sepandar D. Kamvar, Dan Klein, and Christopher D. Manning. (2003). “Spectral Learning.” In: Proceedings of the 18th international joint conference on Artificial intelligence.

Subject Headings: Spectral Learning Algorithm.

Cited By

• http://scholar.google.com/scholar?q=%222003%22+Spectral+Learning
• http://dl.acm.org/citation.cfm?id=1630659.1630742&preflayout=flat#citedby

Quotes

Abstract

We present a simple, easily implemented spectral learning algorithm which applies equally whether we have no supervisory information, pairwise link constraints, or labeled examples. In the unsupervised case, it performs consistently with other spectral clustering algorithms. In the supervised case, our approach achieves high accuracy on the categorization of thousands of documents given only a few dozen labeled training documents for the 20 Newsgroups data set. Furthermore, its classification accuracy increases with the addition of unlabeled documents, demonstrating effective use of unlabeled data. By using normalized affinity matrices which are both symmetric and stochastic, we also obtain both a probabilistic interpretation of our method and certain guarantees of performance.

References

;

	Author	volume	Date Value	title	type	journal	titleUrl	doi	note	year
2003 SpectralLearning	Dan Klein Christopher D. Manning Sepandar D. Kamvar			Spectral Learning						2003