Turning Big Data Into Tiny Data: Constant-Size Coresets for -Means, PCA, and Projective Clustering D Feldman, M Schmidt, C Sohler SIAM Journal on Computing 49 (3), 601-657, 2020 | 647 | 2020 |
Streamkm++ a clustering algorithm for data streams MR Ackermann, M Märtens, C Raupach, K Swierkot, C Lammersen, ... Journal of Experimental Algorithmics (JEA) 17, 2.1-2.30, 2012 | 508 | 2012 |
Counting triangles in data streams LS Buriol, G Frahling, S Leonardi, A Marchetti-Spaccamela, C Sohler Proceedings of the twenty-fifth ACM SIGMOD-SIGACT-SIGART symposium on …, 2006 | 305 | 2006 |
A PTAS for k-means clustering based on weak coresets D Feldman, M Monemizadeh, C Sohler Proceedings of the twenty-third annual symposium on Computational geometry …, 2007 | 227 | 2007 |
Coresets in dynamic geometric data streams G Frahling, C Sohler Proceedings of the thirty-seventh annual ACM symposium on Theory of …, 2005 | 178 | 2005 |
A fast k-means implementation using coresets G Frahling, C Sohler Proceedings of the twenty-second annual symposium on Computational geometry …, 2006 | 177 | 2006 |
Fair Coresets and Streaming Algorithms for Fair k-means M Schmidt, C Schwiegelshohn, C Sohler Approximation and Online Algorithms: 17th International Workshop, WAOA 2019 …, 2020 | 169* | 2020 |
Clustering for metric and nonmetric distance measures MR Ackermann, J Blömer, C Sohler ACM Transactions on Algorithms (TALG) 6 (4), 1-26, 2010 | 169 | 2010 |
Randomized pursuit-evasion in graphs M Adler, H Räcke, N Sivadasan, C Sohler, B Vöcking Combinatorics, Probability and Computing 12 (3), 225-244, 2003 | 168 | 2003 |
Sampling in dynamic data streams and applications G Frahling, P Indyk, C Sohler Proceedings of the twenty-first annual symposium on Computational geometry …, 2005 | 154 | 2005 |
Analysis of agglomerative clustering MR Ackermann, J Blömer, D Kuntze, C Sohler Algorithmica 69, 184-215, 2014 | 134 | 2014 |
Theoretical Analysis of the k-Means Algorithm – A Survey J Blömer, C Lammersen, M Schmidt, C Sohler Algorithm Engineering: Selected Results and Surveys, 81-116, 2016 | 129 | 2016 |
Every property of hyperfinite graphs is testable I Newman, C Sohler Proceedings of the forty-third annual ACM symposium on Theory of computing …, 2011 | 127 | 2011 |
Coresets and sketches for high dimensional subspace approximation problems D Feldman, M Monemizadeh, C Sohler, DP Woodruff Proceedings of the twenty-first annual ACM-SIAM symposium on Discrete …, 2010 | 118 | 2010 |
On coresets for logistic regression A Munteanu, C Schwiegelshohn, C Sohler, D Woodruff Advances in Neural Information Processing Systems 31, 2018 | 115 | 2018 |
Testing expansion in bounded-degree graphs A Czumaj, C Sohler Combinatorics, Probability and Computing 19 (5-6), 693-709, 2010 | 110 | 2010 |
Strong coresets for k-median and subspace approximation: Goodbye dimension C Sohler, DP Woodruff 2018 IEEE 59th Annual Symposium on Foundations of Computer Science (FOCS …, 2018 | 101 | 2018 |
Subspace embeddings for the L1-norm with applications C Sohler, DP Woodruff Proceedings of the forty-third annual ACM symposium on Theory of computing …, 2011 | 100 | 2011 |
Sublinear‐time approximation algorithms for clustering via random sampling A Czumaj, C Sohler Random Structures & Algorithms 30 (1‐2), 226-256, 2007 | 96* | 2007 |
BICO: BIRCH Meets Coresets for k-Means Clustering H Fichtenberger, M Gillé, M Schmidt, C Schwiegelshohn, C Sohler Algorithms–ESA 2013: 21st Annual European Symposium, Sophia Antipolis …, 2013 | 95 | 2013 |