2012-10-01から1ヶ月間の記事一覧

A Local Search Approximation Algorithm for k-Means Clustering

Tapas Kanungo, David M. Mount, Nathan S. Netanyahu, Christine D. Piatko, Ruth Silverman and Angela Y. Wu. A Local Search Approximation Algorithm for k-Means Clustering. In Proceedings of the eighteenth annual symposium on Computational ge…

k-means++: The Advantages of Careful Seeding

David Arthur and Sergei Vassilvitskii, k-means++: The Advantages of Careful Seeding. In Proceedings of the eighteenth annual ACM-SIAM symposium on Discrete algorithms (2007), pp. 1027-1035.言わずと知れたk-meansアルゴリズム(Lloydのアルゴリ…

Fast Approximate Nearest-Neighbor Search with k-Nearest Neighbor Graph

K. Hajebi, Y. Abbasi-Yadkori, H. Shahbazi, and H. Zhang, Fast Approximate Nearest-Neighbor Search with k-Nearest Neighbor Graph. ;In Proceedings of IJCAI. 2011, 1312-1317. k近傍グラフ上での山登り方による近似最近傍探索. Locality Sensitive …

院試備忘録

結構前の話だが,院試について書く.超ラフな備忘録.質問はコメントかTwitter([twitter:@todo314])にてどうぞ.

Fast and Accurate k-means For Large Datasets

Michael Shindler, Alex Wong, and Adam Meyerson. Fast and Accurate k-means For Large Datasets. In NIPS, 2011.k-meansアルゴリズムのストリーム版で,割りと最近のもの.今回は適当に紹介.