The Complexity of the k-means Method∗ Tim Roughgarden1 and Joshua R. Wang2 1 Department of Computer Science, Stanford Univeresity, 474 Gates Building, 353 Serra Mall, Stanford, CA 94305, USA

First Page		Document Content
Date: 2016-06-27 17:36:50 NAND gate FO K-means++ K-means clustering Gadget Cluster analysis		The Complexity of the k-means Method∗ Tim Roughgarden1 and Joshua R. Wang2 1 Department of Computer Science, Stanford Univeresity, 474 Gates Building, 353 Serra Mall, Stanford, CA 94305, USA Add to Reading List Source URL: theory.stanford.edu Download Document from Source Website File Size: 539,40 KB Share Document on Facebook