Postsupervised hard c-means classifier

  • Authors:
  • Hidetomo Ichihashi;Katsuhiro Honda;Akira Notsu

  • Affiliations:
  • Graduate School of Engineering, Osaka Prefecture University, Sakai, Osaka, Japan;Graduate School of Engineering, Osaka Prefecture University, Sakai, Osaka, Japan;Graduate School of Engineering, Osaka Prefecture University, Sakai, Osaka, Japan

  • Venue:
  • RSCTC'06 Proceedings of the 5th international conference on Rough Sets and Current Trends in Computing
  • Year:
  • 2006

Quantified Score

Hi-index 0.00

Visualization

Abstract

Miyamoto et al. derived a hard clustering algorithms by defuzzifying a generalized entropy-based fuzzy c-means in which covariance matrices are introduced as decision variables. We apply the hard c-means (HCM) clustering algorithms to a postsupervised classifier to improve resubstitution error rate by choosing best clustering results from local minima of an objective function. Due to the nature of the prototype based classifier, the error rates can easily be improved by increasing the number of clusters with the cost of computer memory and CPU speed. But, with the HCM classifier, the resubstitution error rate along with the data set compression ratio is improved on several benchmark data sets by using a small number of clusters for each class.