DENCLUE 2.0: Fast clustering based on kernel density estimation

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 4723 LNCS, Issue , 2007, Pages 70-80

  Hinneburg, Alexander ^a   Gabriel, Hans Henning ^b  

^a MARTIN LUTHER UNIVERSITY HALLE WITTENBERG   (Germany)

^b OTTO VON GUERICKE UNIVERSITY   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; CLUSTER ANALYSIS; CONVERGENCE OF NUMERICAL METHODS; GAUSSIAN DISTRIBUTION; OPTIMIZATION; PROBABILITY DENSITY FUNCTION;

GAUSSIAN KERNELS; KERNEL DENSITY ESTIMATION; MAXIMIZATION ALGORITHMS;

DATA PROCESSING;

EID: 38049052212     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-74825-0_7     Document Type: Conference Paper

References (17)

1. Ankerst, M., Breunig, M.M., Kriegel, H.-P., Sander, J.: Optics: Ordering points to identify the clustering structure. In: Proceedings SIGMOD'99, pp. 49-60. ACM Press, New York (1999)
2. Bezdiek, J.: Fuzzy Models and Algorithms for Pattern Recognition and Image Processing. Kluwer Academic Publishers, Dordrecht (1999)
3. Bock, H.H.: Automatic Classification. Vandenhoeck and Ruprecht (1974)
4. Fukunaga, K.: Introduction to Statistical Pattern Recognition. Academic Press, London (1990)
5. Fukunaga, K., Hostler, L.: The estimation of the gradient of a density function, with application in pattern recognition. IEEE Trans. Info. Thy. 21, 32-40 (1975)
6. Herbin, M., Bonnet, N., Vautrot, P.: Estimation of the number of clusters and influence zones. Pattern Recognition Letters 22, 1557-1568 (2001)
7. Hinneburg, A., Keim, D.: An efficient approach to clustering in large multimedia databases with noise. In: Proceedings KDD'98, pp. 58-65. AAAI Press (1998)
8. Hinneburg, A., Keim, D.A.: A general approach to clustering in large databases with noise. Knowledge and Information Systems (KAIS) 5(4), 387-415 (2003)
9. McLachlan, G.J., Krishnan, T.: EM Algorithm and Extensions. Wiley, Chichester (1997)
10. Nasraoui, O., Krishnapuram, R.: The unsupervised niche clustering algorithm: extension tomultivariate clusters and application to color image segmentation. In: IFSA World Congress and 20th NAFIPS International Conference, vol. 3 (2001)
11. Neal, R.M., Hinton, G.E.: A view of the em algorithm that justifies incremental, sparse, and other variants. In: Learning in graphical models, pp. 355-368. MIT Press, Cambridge (1999)
12. Sander, J., Ester, M., Kriegel, H.-P., Xu, X.: Density-based clustering in spatial databases: The algorithm gdbscan and its applications. Data Mining and Knowledge Discovery 2(2), 169-194 (1997)
13. Schnell, P.: A method to find point-groups. Biometrika 6, 47-48 (1964)
14. Scott, D.: Multivariate Density Estimation. Wiley, Chichester (1992)
15. Silverman, B.W.: Density Estimation for Statistics and Data Analysis. Chapman & Hall (1986)
16. Yager, R., Filev, D.: Approximate clustering via the mountain method. IEEE Transactions on Systems, Man and Cybernetics 24(8), 1279-1284 (1994)
17. Zhang, T., Ramakrishnan, R., Livny, M.: Fast density estimation using cf-kernel for very large databases. In: Proceedings KDD'99, pp. 312-316. ACM Press, New York (1999)