Fetching the paper…
Reading the bibliography…
Many modern clustering methods scale well to a large number of data items, N, but not to a large number of clusters, K.
Algorithms
Robert Sedgewick. 1988 · 1988
Earlier work this paper cites.
Five balltree construction algorithms
Stephen M Omohundro. 1989 · 1989
Earlier work this paper cites.
Class-based n-gram models of natural language
Peter F Brown, Peter V Desouza, Robert L Mercer, Vincent J Della Pietra, and Jenifer C Lai. 1992 · 1992
Earlier work this paper cites.
Convergence Properties of the K-Means Algorithms. In Advances in Neural Information Processing Systems (NIPS)
Léon Bottou and Yoshua Bengio. 1995 · 1995
Earlier work this paper cites.
A density-based algorithm for discovering clusters in large spatial databases with noise.. In International Conference on Knowledge Discovery and Data Mining (KDD)
Martin Ester, Hans-Peter Kriegel, Jörg Sander, Xiaowei Xu, and others. 1996 · 1996
Earlier work this paper cites.
BIRCH: an efficient data clustering method for very large databases. In ACM Sigmod Record
Tian Zhang, Raghu Ramakrishnan, and Miron Livny. 1996 · 1996
Earlier work this paper cites.
Incremental clustering and dynamic information retrieval. In Symposium on Theory of Computing (STOC)
Moses Charikar, Chandra Chekuri, Tomás Feder, and Rajeev Motwani. 1997 · 1997
Earlier work this paper cites.
Cluster analysis and display of genome-wide expression patterns
Michael B Eisen, Paul T Spellman, Patrick O Brown, and David Botstein. 1998 · 1998
Earlier work this paper cites.
Approximate clustering via core-sets. In Symposium on Theory of Computing (STOC)
Mihai Bādoiu, Sariel Har-Peled, and Piotr Indyk. 2002 · 2002
Earlier work this paper cites.
Streaming-data algorithms for high-quality clustering. In International Conference on Data Engineering
Liadan O’callaghan, Nina Mishra, Adam Meyerson, Sudipto Guha, and Rajeev Motwani. 2002 · 2002
Earlier work this paper cites.
An incremental approach to building a cluster hierarchy. In International Conference on Data Mining (ICDM)
Dwi H Widyantoro, Thomas R Ioerger, and John Yen. 2002 · 2002
Earlier work this paper cites.
A framework for clustering evolving data streams. In International Conference on Very Large Databases (VLDB)
Charu C Aggarwal, Jiawei Han, Jianyong Wang, and Philip S Yu. 2003 · 2003
Earlier work this paper cites.
Finding community structure in very large networks
Aaron Clauset, Mark EJ Newman, and Cristopher Moore. 2004 · 2004
Earlier work this paper cites.
The Amsterdam library of object images
Jan-Mark Geusebroek, Gertjan J Burghouts, and Arnold WM Smeulders. 2005 · 2005
Cited alongside, same era.
Bayesian hierarchical clustering. In International Conference on Machine Learning (ICML)
Katherine A Heller and Zoubin Ghahramani. 2005 · 2005
Cited alongside, same era.
Cover trees for nearest neighbor. In International Conference on Machine Learning (ICML)
Alina Beygelzimer, Sham Kakade, and John Langford. 2006 · 2006
Cited alongside, same era.
The effectiveness of Lloyd-type methods for the k-means problem. In Foundations of Computer Science (FOCS)
Rafail Ostrovsky, Yuval Rabani, Leonard J Schulman, and Chaitanya Swamy. 2006 · 2006
Cited alongside, same era.
k-means++: The advantages of careful seeding. In Symposium on Discrete Algorithms (SODA)
David Arthur and Sergei Vassilvitskii. 2007 · 2007
Cited alongside, same era.
Fastex: Hash clustering with exponential families. In Advances in Neural Information Processing Systems (NIPS)
Amr Ahmed, Sujith Ravi, Alex J Smola, and Shravan M Narayanamurthy. 2012 · 2012
Later among the works it cites.
Efficient active algorithms for hierarchical clustering. In International Conference on Machine Learning (ICML)
Akshay Krishnamurthy, Sivaraman Balakrishnan, Min Xu, and Aarti Singh. 2012 · 2012
Later among the works it cites.
NCBI Reference Sequences (RefSeq): current status, new features and genome annotation policy
Kim D Pruitt, Tatiana Tatusova, Garth R Brown, and Donna R Maglott. 2012 · 2012
Later among the works it cites.
BICO: BIRCH meets coresets for k-means clustering. In European Symposium on Algorithms
Hendrik Fichtenberger, Marc Gillé, Melanie Schmidt, Chris Schwiegelshohn, and Christian Sohler. 2013 · 2013
Later among the works it cites.
Stochastic variational inference
Matthew D Hoffman, David M Blei, Chong Wang, and John William Paisley. 2013 · 2013
Later among the works it cites.
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
Alexander N Gorban, Balázs Kégl, Donald C Wunsch, Andrei Y Zinovyev, and others. 2008 · 2008
Cited alongside, same era.
Introduction to information retrieval
Christopher D Manning, Prabhakar Raghavan, Hinrich Schütze, and others. 2008 · 2008
Cited alongside, same era.
Imagenet: A large-scale hierarchical image database. In Computer Vision and Pattern Recognition (CVPR)
Jia Deng, Wei Dong, Richard Socher, Li-Jia Li, Kai Li, and Li Fei-Fei. 2009 · 2009
Cited alongside, same era.
Web-scale k-means clustering. In International World Wide Web Conference (WWW)
David Sculley. 2010 · 2010
Cited alongside, same era.
Discovering non-binary hierarchical structures with Bayesian rose trees
Charles Blundell, Yee Whye Teh, and Katherine A Heller. 2011 · 2011
Cited alongside, same era.
Front-end factor analysis for speaker verification
Najim Dehak, Patrick J Kenny, Réda Dehak, Pierre Dumouchel, and Pierre Ouellet. 2011 · 2011
Cited alongside, same era.
Scikit-learn: Machine Learning in Python
F. Pedregosa, G. Varoquaux, A. Gramfort, V. Michel, B. Thirion, O. Grisel, M. Blondel, P. Prettenhofer, R. Weiss, V. Dubourg, J. Vanderplas, A. Passos, D. Cournapeau, M. Brucher, M. Perrot, and E. Duchesnay. 2011 · 2011
Cited alongside, same era.
UCI Machine Learning Repository
M. Lichman. 2013 · 2013
Later among the works it cites.
Logarithmic time online multiclass prediction. In Advances in Neural Information Processing Systems (NIPS)
Anna E Choromanska and John Langford. 2015 · 2015
Later among the works it cites.
ImageNet Large Scale Visual Recognition Challenge
Olga Russakovsky, Jia Deng, Hao Su, Jonathan Krause, Sanjeev Satheesh, Sean Ma, Zhiheng Huang, Andrej Karpathy, Aditya Khosla, Michael Bernstein, Alexander C. Berg, and Li Fei-Fei. 2015 · 2015
Later among the works it cites.
Flexible Models for Microclustering with Application to Entity Resolution. In Advances in Neural Information Processing Systems (NIPS)
Brenda Betancourt, Giacomo Zanella, Jeffrey W Miller, Hanna Wallach, Abbas Zaidi, and Rebecca C Steorts. 2016 · 2016
Later among the works it cites.
Logarithmic Time One-Against-Some
Hal Daume III, Nikos Karampatziakis, John Langford, and Paul Mineiro. 2016 · 2016
Later among the works it cites.
An algorithm for online k-means clustering. In Workshop on Algorithm Engineering and Experiments
Edo Liberty, Ram Sriharsha, and Maxim Sviridenko. 2016 · 2016
Later among the works it cites.
Rethinking the inception architecture for computer vision. In Computer Vision and Pattern Recognition (CVPR)
Christian Szegedy, Vincent Vanhoucke, Sergey Ioffe, Jon Shlens, and Zbigniew Wojna. 2016 · 2016
Later among the works it cites.