Improvement of neural network classifier using floating centroids
- 219 Downloads
This paper presents a novel technique—Floating Centroids Method (FCM) designed to improve the performance of a conventional neural network classifier. Partition space is a space that is used to categorize data sample after sample is mapped by neural network. In the partition space, the centroid is a point, which denotes the center of a class. In a conventional neural network classifier, position of centroids and the relationship between centroids and classes are set manually. In addition, number of centroids is fixed with reference to the number of classes. The proposed approach introduces many floating centroids, which are spread throughout the partition space and obtained by using K-Means algorithm. Moreover, different classes labels are attached to these centroids automatically. A sample is predicted as a certain class if the closest centroid of its corresponding mapped point is labeled by this class. Experimental results illustrate that the proposed method has favorable performance especially with respect to the training accuracy, generalization accuracy, and average F-measures.
KeywordsClassification Neural networks Floating Centroids Method
Unable to display preview. Download preview PDF.
- 1.Qinlan JR (1986) Introduction of decision trees. Mach Learn 1(1): 81–106Google Scholar
- 9.Koknar-Tezel S, Latecki LJ (2010) Improving SVM classification on imbalanced time series data sets with ghost points. Knowl Inf Syst (in print)Google Scholar
- 10.Benjamin XW, Japkowicz N (2010) Boosting support vector machines for imbalanced data sets. Knowl Inf Syst (in print)Google Scholar
- 16.Bridle JS (1990) Probabilistic interpretation of feedforward classification network outputs, with relationships to statistical pattern recognition. Neuralcomputing: algorithms, architectures and applications, Springer, pp 227–236Google Scholar
- 18.Wang L, Yang B, Chen Z, Abraham A, Peng L (2007) A novel improvement of neural network classification using further division of partition space. In: Proceedings of international work-conference on the interplay between natural and artificial computation, 2007. Lecture notes in computer science vol 4527. Springer, Berlin, pp 214–223Google Scholar
- 20.Kennedy J, Eberhart RC (1995) A new optimizer using paritcle swarm theory. In: Proceddings of the sixth international symposium on micromachine and human science, pp 39–43Google Scholar
- 23.Platt JC (1998) Sequential minimal optimization: a fast algorithm for training support vector machines. Technical Report MSR-TR-98-14, Microsoft ResearchGoogle Scholar