Improving Rbf Networks Classification Performance By Using K-Harmonic Means release_43x5umlyh5aofarf3d2hcsj6xy

by Z. Zainuddin, W. K. Lye

Published by Zenodo.



In this paper, a clustering algorithm named KHarmonic means (KHM) was employed in the training of Radial Basis Function Networks (RBFNs). KHM organized the data in clusters and determined the centres of the basis function. The popular clustering algorithms, namely K-means (KM) and Fuzzy c-means (FCM), are highly dependent on the initial identification of elements that represent the cluster well. In KHM, the problem can be avoided. This leads to improvement in the classification performance when compared to other clustering algorithms. A comparison of the classification accuracy was performed between KM, FCM and KHM. The classification performance is based on the benchmark data sets: Iris Plant, Diabetes and Breast Cancer. RBFN training with the KHM algorithm shows better accuracy in classification problem.
In text/plain format

Archived Files and Locations

application/pdf  131.9 kB
file_4l5kat6xurdqbjxguyppi6qhae (repository) (webarchive)
Read Archived PDF
Preserved and Accessible
Type  article-journal
Stage   published
Date   2010-02-28
Language   en ?
Work Entity
access all versions, variants, and formats of this works (eg, pre-prints)
Catalog Record
Revision: 046c16ef-d902-445b-bb20-579f0d25dac0