On Clusterings: Good, Bad and Spectral

On Clusterings: Good, Bad and Spectral (2000)

by Ravi Kannan , Santosh Vempala , Adrian Vetta

Citations:

User correction supplied by SystemCorrections

Datum	Value	Source
TITLE	On Clusterings: Good, Bad and Spectral	user correction - Legacy Corrections
AUTHOR NAME	Ravi Kannan	SVM HeaderParse 0.1
AUTHOR AFFIL	Yale University, New Haven.	SVM HeaderParse 0.2
AUTHOR NAME	Santosh Vempala	SVM HeaderParse 0.1
AUTHOR NAME	Adrian Vetta	SVM HeaderParse 0.1
AUTHOR AFFIL	z	SVM HeaderParse 0.2
AUTHOR ADDR	Department of Mathematics,; M.I.T., Cambridge.	SVM HeaderParse 0.1
ABSTRACT	We motivate and develop a natural bicriteria measure for assessing the quality of a clustering which avoids the drawbacks of existing measures. A simple recursive heuristic has poly-logarithmic worst-case guarantees under the new measure. The main result of the paper is the analysis of a popular spectral algorithm. One variant of spectral clustering turns out to have effective worst-case guarantees	user correction - Legacy Corrections
YEAR	2000	user correction - Legacy Corrections
CITATIONS	15 found	ParsCit 1.0