Fetching the paper…
Reading the bibliography…
\textbf{A}ccuracy, \textbf{R}obustness to noises and scales, \textbf{I}nterpretability, \textbf{S}peed, and \textbf{E}asy to use (ARISE) are crucial requirements of a good clustering algorithm.
Quantitative expression of cultural relationships , volume 31
Driver, H. E.; and Kroeber, A. L. 1932 · 1932
Earlier work this paper cites.
A technique for measuring like-mindedness
Zubin, J. 1938 · 1938
Earlier work this paper cites.
Cluster analysis: correlation profile and orthometric analysis for the isolation of unities in mind and personality
Tryon, R. C. 1939 · 1939
Earlier work this paper cites.
Sur la division des corps matériels en parties
Steinhaus, H. 1956 · 1956
Earlier work this paper cites.
On estimation of a probability density function and mode
Parzen, E. 1962 · 1962
Earlier work this paper cites.
A nonparametric estimate of a multivariate density function
Loftsgaarden, D. O.; Quesenberry, C. P.; et al. 1965 · 1965
Earlier work this paper cites.
Least squares quantization in PCM
Lloyd, S. 1982 · 1982
Earlier work this paper cites.
Comparing partitions
Hubert, L.; and Arabie, P. 1985 · 1985
Earlier work this paper cites.
Algorithms for Clustering Data
Jain, A. K.; and Dubes, R. C. 1988 · 1988
Earlier work this paper cites.
A density-based algorithm for discovering clusters in large spatial databases with noise
Ester, M.; Kriegel, H.-P.; Sander, J.; Xu, X.; et al. 1996 · 1996
Earlier work this paper cites.
OPTICS: ordering points to identify the clustering structure
Ankerst, M.; Breunig, M. M.; Kriegel, H.-P.; and Sander, J. 1999 · 1999
Earlier work this paper cites.
Fast and effective text mining using linear-time document clustering
Evett, I. W.; and Spiehler, E. J. 1999 · 1999
Earlier work this paper cites.
Data clustering: a review
Jain, A. K.; Murty, M. N.; and Flynn, P. J. 1999 · 1999
Earlier work this paper cites.
Mean shift: A robust approach toward feature space analysis
Comaniciu, D.; and Meer, P. 2002 · 2002
Earlier work this paper cites.
Kernel k-means: spectral clustering and normalized cuts
Dhillon, I. S.; Guan, Y.; and Kulis, B. 2004 · 2004
Earlier work this paper cites.
k-means++: The advantages of careful seeding
Arthur, D.; and Vassilvitskii, S. 2006 · 2006
Cited alongside, same era.
Fundamental limitations of spectral clustering
Nadler, B.; and Galun, M. 2006 · 2006
Cited alongside, same era.
Dynamic cluster formation using level set methods
Yip, A. M.; Ding, C.; and Chan, T. F. 2006 · 2006
Cited alongside, same era.
UCI machine learning repository
Asuncion, A.; and Newman, D. 2007 · 2007
Cited alongside, same era.
Spectral Clustering: a Tutorial for the 2010’s
Meila, M. 2016 · 2010
Cited alongside, same era.
Information theoretic measures for clusterings comparison: Variants, properties, normalization and correction for chance
Vinh, N. X.; Epps, J.; and Bailey, J. 2010 · 2010
Cited alongside, same era.
Accelerated hierarchical density based clustering
McInnes, L.; and Healy, J. 2017 · 2017
Later among the works it cites.
A review of clustering techniques and developments
Saxena, A.; Prasad, M.; Gupta, A.; Bharill, N.; Patel, O. P.; Tiwari, A.; Er, M. J.; Ding, W.; and Lin, C.-T. 2017 · 2017
Later among the works it cites.
Fashion-mnist: a novel image dataset for benchmarking machine learning algorithms
Xiao, H.; Rasul, K.; and Vollgraf, R. 2017 · 2017
Later among the works it cites.
Deep clustering for unsupervised learning of visual features
Caron, M.; Bojanowski, P.; Joulin, A.; and Douze, M. 2018 · 2018
Later among the works it cites.
RECOME: A new density-based clustering algorithm using relative KNN kernel density
Geng, Y.-a.; Li, Q.; Zheng, R.; Zhuang, F.; He, R.; and Xiong, N. 2018 · 2018
Later among the works it cites.
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
Remarks on some nonparametric estimates of a density function
Davis, R. A.; Lii, K.-S.; and Politis, D. N. 2011 · 2011
Cited alongside, same era.
Scikit-learn: Machine Learning in Python
Pedregosa, F.; Varoquaux, G.; Gramfort, A.; Michel, V.; Thirion, B.; Grisel, O.; Blondel, M.; Prettenhofer, P.; Weiss, R.; Dubourg, V.; Vanderplas, J.; Passos, A.; Cournapeau, D.; Brucher, M.; Perrot, M.; and Duchesnay, E. 2011 · 2011
Cited alongside, same era.
The mnist database of handwritten digit images for machine learning research
Deng, L. 2012 · 2012
Cited alongside, same era.
Density-based clustering based on hierarchical density estimates
Campello, R. J.; Moulavi, D.; and Sander, J. 2013 · 2013
Cited alongside, same era.
Persistence-based clustering in riemannian manifolds
Chazal, F.; Guibas, L. J.; Oudot, S. Y.; and Skraba, P. 2013 · 2013
Cited alongside, same era.
Computability and unsolvability
Davis, M. 2013 · 2013
Cited alongside, same era.
Jiang, H.; Jang, J.; and Kpotufe, S. 2018 · 2018
Later among the works it cites.
Umap: Uniform manifold approximation and projection for dimension reduction
McInnes, L.; Healy, J.; and Melville, J. 2018 · 2018
Later among the works it cites.
Alternative objective functions for deep clustering
Wang, Z.-Q.; Le Roux, J.; and Hershey, J. R. 2018 · 2018
Later among the works it cites.
The SpectACl of nonconvex clustering: a spectral approach to density-based clustering
Hess, S.; Duivesteijn, W.; Honysz, P.; and Morik, K. 2019 · 2019
Later among the works it cites.
A better k-means++ algorithm via local search
Lattanzi, S.; and Sohler, C. 2019 · 2019
Later among the works it cites.
Data clustering: theory, algorithms, and applications
Gan, G.; Ma, C.; and Wu, J. 2020 · 2020
Later among the works it cites.
Online deep clustering for unsupervised representation learning
Zhan, X.; Xie, J.; Liu, Z.; Ong, Y.-S.; and Loy, C. C. 2020 · 2020
Later among the works it cites.
Automatic topography of high-dimensional data sets by non-parametric Density Peak clustering
d’Errico, M.; Facco, E.; Laio, A.; and Rodriguez, A. 2021 · 2021
Closest in time.
Automatic clustering algorithms: a systematic review and bibliometric analysis of relevant literature
Ezugwu, A. E.; Shukla, A. K.; Agbaje, M. B.; Oyelade, O. N.; Jose-Garcia, A.; and Agushaka, J. O. 2021 · 2021
Closest in time.