Centroid neural network with Bhattacharyya Kernel for GPDF data clustering

3Citations
Citations of this article
1Readers
Mendeley users who have this article in their library.
Get full text

Abstract

A clustering algorithm for GPDF data called Centroid Neural Network with Bhattacharyya Kernel (BK-CNN) is proposed in this paper. The proposed BK-CNN is based on the unsupervised competitive centroid neural network (CNN) and employs a kernel method for data projection. In order to cluster the GPDF data, the Bhattacharyya kernel is used to measure the distance between two probability distributions for data projection. When applied to GPDF data in an image classification model, the experiment results show that the proposed BKCNN algorithm is more efficient than other conventional algorithms such as k-means algorithm, SOM and CNN with Bhattacharyya distance. © Springer-Verlag Berlin Heidelberg 2007.

Author supplied keywords

Cite

CITATION STYLE

APA

Lee, S. J., & Park, D. C. (2007). Centroid neural network with Bhattacharyya Kernel for GPDF data clustering. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 4426 LNAI, pp. 616–622). Springer Verlag. https://doi.org/10.1007/978-3-540-71701-0_65

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free