Andrews, Nicholas O.Fox, Edward A.2013-06-192013-06-192007-10-01http://hdl.handle.net/10919/19848We consider the problem of reducing a potentially very large dataset to a subset of representative prototypes. Rather than searching over the entire space of prototypes, we first roughly divide the data into balanced clusters using bisecting k-means and spectral cuts, and then find the prototypes for each cluster by affinity propagation. We apply our algorithm to text data, where we perform an order of magnitude faster than simply looking for prototypes on the entire dataset. Furthermore, our "divide and conquer" approach actually performs more accurately on datasets which are well bisected, as the greedy decisions of affinity propagation are confined to classes of already similar items.application/pdfenIn CopyrightAlgorithmsData structuresTechnical reportTR-07-36http://eprints.cs.vt.edu/archive/00000999/01/redux.pdf