Fetching the paper…
Reading the bibliography…
The level set tree approach of Hartigan (1975) provides a probabilistically based and highly interpretable encoding of the clustering behavior of a dataset.
“Some Methods for Classification and And Analysis of Multivariate Observations.”
MacQueen J (1967) · 1967
Earlier work this paper cites.
“Mode analysis: a generalization of nearest neighbor which reduces chaining effects.”
Wishart D (1969) · 1969
Earlier work this paper cites.
Clustering Algorithms
Hartigan J (1975) · 1975
Earlier work this paper cites.
“Consistency of Single Linkage for High-Density Clusters.”
Hartigan JA (1981) · 1981
Earlier work this paper cites.
“Least squares quantization in PCM.”
Lloyd S (1982) · 1982
Earlier work this paper cites.
“A kth Nearest Neighbour Clustering Procedure.”
Wong A, Lane T (1983) · 1983
Earlier work this paper cites.
“Measuring Mass Concentrations and Estimating Density Contour Clusters - An Excess Mass Approach.”
Polonik W (1995) · 1995
Earlier work this paper cites.
“A Density-Based Algorithm for Discovering Clusters in Large Spatial Databases with Noise.”
Ester M, Kriegel Hp, Xu X (1996) · 1996
Earlier work this paper cites.
“Normalized Cuts and Image Segmentation.”
Shi J, Malik J (2000) · 2000
Earlier work this paper cites.
“SciPy: Open Source Scientific Tools for Python.”
Jones E, Oliphant T, Peterson P (2001) · 2001
Earlier work this paper cites.
“Visualization of Multivariate Density Estimates With Level Set Trees.”
Klemelä J (2004) · 2004
Earlier work this paper cites.
“Algorithms for Manipulation of Level Sets of Nonparametric Density Estimates.”
Klemelä J (2005) · 2005
Cited alongside, same era.
“The igraph Software Package for Complex Network Research.”
Csardi G, Nepusz T (2006) · 2006
Cited alongside, same era.
Nonparametric Functional Data Analysis
Ferraty F, Vieu P (2006) · 2006
Cited alongside, same era.
“Clustering via nonparametric density estimation.”
Azzalini A, Torelli N (2007) · 2007
Cited alongside, same era.
“Matplotlib: A 2D Graphics Environment.”
Hunter JD (2007) · 2007
Cited alongside, same era.
“Optimal construction of k-nearest-neighbor graphs for identifying noisy clusters.”
Maier M, Hein M, von Luxburg U (2009) · 2009
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, Duchesnay E (2011) · 2011
Later among the works it cites.
“Adaptive Density Level Set Clustering.”
Steinwart I (2011) · 2011
Later among the works it cites.
“Clustering via Nonparametric Density Estimation : the R Package pdfCluster.”
Azzalini A, Menardi G (2012) · 2012
Later among the works it cites.
Probability and Measure
Billingsley P (2012) · 2012
Later among the works it cites.
“Distribution-Free Prediction Sets.”
Lei J, Robins J, Wasserman L (2013) · 2012
Later among the works it cites.
“Stability of Density-Based Clustering.”
Rinaldo A, Singh A, Nugent R, Wasserman L (2012) · 2012
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
“A Generalized Single Linkage Method for Estimating the Cluster Tree of a Density.”
Stuetzle W, Nugent R (2010) · 2009
Cited alongside, same era.
“Rates of convergence for the cluster tree.”
Chaudhuri K, Dasgupta S (2010) · 2010
Cited alongside, same era.
“Generalized density clustering.”
Rinaldo A, Wasserman L (2010) · 2010
Cited alongside, same era.
“Pruning nearest neighbor cluster trees.”
Kpotufe S, Luxburg UV (2011) · 2011
Cited alongside, same era.
Later among the works it cites.
“Consistency and Rates for Clustering with DBSCAN.”
Sriperumbudur BK, Steinwart I (2012) · 2012
Later among the works it cites.
Balakrishnan BS, Narayanan S, Rinaldo A, Singh A, Wasserman L (2013) · 2013
Closest in time.
“fpc: Flexible procedures for clustering.”
Hennig C (2013) · 2013
Closest in time.
“An Advancement in Clustering via Nonparametric Density Estimation.”
Menardi G, Azzalini A (2013) · 2013
Closest in time.