Distributed and Provably Good Seedings for k-Means in Constant Rounds
暂无分享,去创建一个
[1] Christian Sohler,et al. BICO: BIRCH Meets Coresets for k-Means Clustering , 2013, ESA.
[2] Andreas Krause,et al. Approximate K-Means++ in Sublinear Time , 2016, AAAI.
[3] Ameet Talwalkar,et al. MLlib: Machine Learning in Apache Spark , 2015, J. Mach. Learn. Res..
[4] Ankit Aggarwal,et al. Adaptive Sampling for k-Means Clustering , 2009, APPROX-RANDOM.
[5] Andreas Krause,et al. Training Mixture Models at Scale via Coresets , 2017 .
[6] Amit Kumar,et al. A Simple D2-Sampling Based PTAS for k-Means and Other Clustering Problems , 2012, Algorithmica.
[7] Nir Ailon,et al. Streaming k-means approximation , 2009, NIPS.
[8] Andreas Krause,et al. Fast and Provably Good Seedings for k-Means , 2016, NIPS.
[9] Christian Sohler,et al. StreamKM++: A clustering algorithm for data streams , 2010, JEAL.
[10] Andreas Krause,et al. Uniform Deviation Bounds for k-Means Clustering , 2017, ICML.
[11] Patricio A. Vela,et al. A Comparative Study of Efficient Initialization Methods for the K-Means Clustering Algorithm , 2012, Expert Syst. Appl..
[12] S. P. Lloyd,et al. Least squares quantization in PCM , 1982, IEEE Trans. Inf. Theory.
[13] Sergei Vassilvitskii,et al. k-means++: the advantages of careful seeding , 2007, SODA '07.
[14] Ragesh Jaiswal,et al. Improved analysis of D2-sampling based PTAS for k-means and other clustering problems , 2015, Inf. Process. Lett..
[15] Andreas Krause,et al. Coresets for Nonparametric Estimation - the Case of DP-Means , 2015, ICML.
[16] Andreas Krause,et al. Strong Coresets for Hard and Soft Bregman Clustering with Applications to Exponential Family Mixtures , 2015, AISTATS.