A complete gradient clustering algorithm formed with kernel estimators
Open Access
|Mar 2010References
- Anderberg, M. R. (1973)., Academic Press, New York, NY.
- Barnett, V. and Lewis, T. (1994)., Wiley, Chichester.
- Carreira-Perpinan, M. A. (2006). Fast nonparametric clustering with gaussian blurring mean-shift,, pp. 153-160.
- Cheng, Y. (1995). Mean shift, mode seeking, and clustering,(8): 790-799.
- Comaniciu, D. and Meer, P. (2002). Mean shift: A robust approach toward feature space analysis,(5): 603-619.
- Daniel, K. (2009)., Ph.D. thesis, Systems Research Institute, Polish Academy of Sciences, Warsaw, (in Polish).
- Everitt, B. S., Landau, S. and Leese, M. (2001)., Arnold, London.
- Fukunaga, K. and Hostetler, L. D. (1975). The estimation of the gradient of a density function, with applications in pattern recognition,(1): 32-40.
- Girolami, M. and He, C. (2003). Probability density estimation from optimally condensed data samples,(10): 1253-1264.
- Jain, A. K. and Dubes, R. C. (1988)., Prentice Hall, Englewood Cliffs, NJ.
- Kincaid, D. and Cheney, W. (2002)., Brooks/Cole, Pacific Grove, CA.
- Kulczycki, P. (2005)., WNT, Warsaw, (in Polish).
- Kulczycki, P. (2007). Kernel estimators in systems research,P. Kulczycki, O. Hryniewicz and J. Kacprzyk (Eds),, WNT, Warsaw, pp. 79-105, (in Polish).
- Kulczycki, P. (2008). Kernel estimators in industrial applications,B. Prasad (Ed.),, Springer-Verlag, Berlin, pp. 69-91.
- Kulczycki, P. and Charytanowicz, M. (2008). A complete gradient clustering algorithm,K. Malinowski and L. Rutkowski (Eds),, EXIT, Warsaw, pp. 312-321, (in Polish).
- Kulczycki, P. and Daniel, K. (2009). A method for supporting the marketing strategy of a mobile phone network provider,(2): 116-134, (in Polish).
- Kulczycki, P. and Łukasik, S. (2009). Reduction of sample dimension and size for synthesis of a statistical fault detection system,Z. Kowalczuk (Ed.),, PWNT, Gdańsk, pp. 139-146, (in Polish).
- Larose, D. T. (2006)., Wiley, New York, NY.
- Lubischew, A. A. (1962). On the use of discriminant functions in taxonomy,(4): 455-478.
- Muller, H. G. (1984). Smooth optimum kernel estimators of densities, regression curves and models,(2): 766-774.
- Pal, S. K. and Mitra, P. (2004)., Chapman and Hall, London.
- Rodriguez, R. and Suarez, A. G. (2006). A new algorithm for image segmentation by using iteratively the mean shift filtering,(2): 43-48.
- Silverman, B. W. (1986)., Chapman and Hall, London.
- Wand, M. P. and Jones, M. C. (1994)., Chapman and Hall, London.
- Wang, W. J., Tan, Y. X., Jiang, J. H., Lu, J. Z., Shen, G. L. and Yu, R. Q. (2004). Clustering based on kernel density estimation: Nearest local maximum searching algorithm,(1): 1-8.
- Yang, C., Duraiswami, R., DeMenthon, D. and Davis, L. (2003). Mean-shift analysis using quasi-newton methods,, pp. 447-450.
- Zhang, K., Tang, M. and Kwok, J. T. (2005). Applying neighborhood consistency for fast clustering and kernel density estimation,, pp. 1001-1007.
Language: English
Page range: 123 - 134
Published on: Mar 25, 2010
Published by: University of Zielona Góra
In partnership with: Paradigm Publishing Services
Publication frequency: 4 issues per year
Keywords:
Related subjects:
© 2010 Piotr Kulczycki, Małgorzata Charytanowicz, published by University of Zielona Góra
This work is licensed under the Creative Commons License.