Clustering via nonparametric density estimation

Statistics and Computing

Volumn 17, Issue 1, 2007, Pages 71-80

  Azzalini, Adelchi ^a   Torelli, Nicola ^b  

^a UNIVERSITY OF PADOVA   (Italy)

^b UNIVERSITY OF TRIESTE   (Italy)

Author keywords

Cluster analysis; Delaunay triangulation; Kernel method; Nonparametric density estimation; Voronoi tessellation

Indexed keywords

EID: 34247211255     PISSN: 09603174     EISSN: None     Source Type: Journal    
DOI: 10.1007/s11222-006-9010-y     Document Type: Article

References (18)

1. Aitchison J. 1986. The Statistical Analysis of Compositional Data. Chapman & Hall, London.
2. Ankerst M., Breuning M.M., Krlegel H.P., and Sander J. 1999. OPTICS: ordering points to identity the clustering structure. In: International Conference on Management of Data (SIGMOD'99), ACM, pp. 49-60.
3. Barber C.B., Dobkin D.P., and Huhdanpaa H. 1996. The Quickhull algorithm for convex hulls. ACM Trans. Math. Software 22: 469-483.
4. Bowman A. and Foster P. 1993. Density based exploration of bivariate data. Statistics and Computing 3: 171-177.
5. Bowman A.W. and Azzalini 1997. Applied Smoothing Techniques for Data Analysis. Claredon Press, Oxford.
6. Cuevas A., Febrero M., and Fraiman R. 2000. Estimating the number of clusters. Canad. J. Stat. 28: 367-382.
7. Cuevas A., Febrero M., and Fraiman R. 2001. Cluster analysis: a further approach based on density estimation. Computational Statistics & Data Analysis 36: 441-459.
8. Devroye L.P. and Wagner T.J. 1980. The strong uniform consistency of kernel density estimates. In: Multivariate Analysis, North-Holland, Vol. 5, pp. 59-77.
9. Ester M., Kriegel H.P., Sander J., and Xu X. 1996. A density-based algorithm for discovering clusters in large spatial databases with noise. In: Proceedings of the 2nd International Conference on Knowledge Discovery in Data Mining (KDD-96), Portland, OR, USA. ACM, pp. 226-231.
10. Forina M., Armanino C., Lanteri S., and Tiscornia E. 1983. Classication of olive oils from their fatty acid composition. In: H. Martens and H. J. Russwurm (Eds.), Food Research and Data Analysis, Applied Science Publishers: London, pp. 189-214.
11. Hartigan J.A. 1975. Clustering Algorithms. J. Wiley & Sons, New York.
12. Hubert L. and Arabie P. 1985. Comparing partitions. Journal of Classification 2: 193-218.
13. Nadaraya É.A. 1965. On non-parametric estimates of density functions and regression curves. Theory Probability its Appl. (Transl. Teorija Verojatnostei i ee Primenenija) 10: 186-190.
14. Okabe A., Boots B.N., and Sugihara K. 1992. Spatial Tessellations: Concepts and Applications of Voronoi Diagrams. J. Wiley & Sons, New York.
15. R Development Core Team 2004. R: A language and environment for statistical computing. R Foundation for Statistical Computing, Vienna, Austria 3-900051-07-0.
16. Rosolin T., Azzalini A., and Torelli N. 2003. Detecting clusters via non-parametric density estimation. In: Convegno SIS analisi statistica multivariata per le scienze economico-sociali, le scienze naturali e la tecnologia, Napoli, Italy. Società Italiana di Statistica, RCE edizioni.
17. Stuetzle W. 2003. Estimating the cluster tree of a density by analyzing the minimal spanning tree of a sample. Journal of Classification 20: 25-47.
18. Wong A.M. and Lane T. 1983. The kth nearest neighbour clustering procedure. Journal of the Royal Statistical Society, Series B 45: 362-368.