Factorizing class characteristics via group MEBs construction

Authors:
Ye Chen;Shaoning Pang;Nikola Kasabov
Affiliations:
KEDRI, Auckland University of Technology, New Zealand & NICT, Japan;KEDRI, Auckland University of Technology, New Zealand & NICT, Japan;KEDRI, Auckland University of Technology, New Zealand & NICT, Japan
Venue:
ICONIP'10 Proceedings of the 17th international conference on Neural information processing: models and applications - Volume Part II
Year:
2010

Citing 5
Cited 0

Approximate clustering via core-sets

STOC '02 Proceedings of the thiry-fourth annual ACM symposium on Theory of computing
A Tutorial on Support Vector Machines for Pattern Recognition

Data Mining and Knowledge Discovery
Support vector clustering

The Journal of Machine Learning Research
Core Vector Machines: Fast SVM Training on Very Large Data Sets

The Journal of Machine Learning Research
Face membership authentication using SVM classification tree generated by membership-based LLE data partition

IEEE Transactions on Neural Networks

Quantified Score

Hi-index	0.00

Visualization

Abstract

Classic MEB (minimum enclosing ball) models characteristics of each class for classification by extracting core vectors through a (1 + ε)-approximation problem solving. In this paper, we develop a new MEB systemlearning the core vectors set in a group manner, called group MEB (g-MEB). The g-MEB factorizes class characteristic in 3 aspects such as, reducing the sparseness in MEB by decomposing data space based on data distribution density, discriminating core vectors on class interaction hyperplanes, and enabling outliers detection to decrease noise affection. Experimental results show that the factorized core set from g-MEB delivers often apparently higher classification accuracies than the classic MEB.