By Topic

Combine the clustering algorithm and representation-based algorithm for concurrent classification of test samples

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$33 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

2 Author(s)
Xiao-Zhao Fang ; Bio-Computing Research Center and Shenzhen graduate, school, Harbin Institute of Technology, Shenzhen, China ; Yong Xu

Sparse representation (SR) is a novel pattern recognition method. The algorithm of SR usually performs well. However, in processing a massive concurrent recognition task, SR has a very high computational cost because every test sample has to seek to an optimal linear combination of all the training samples. To this end, we propose a novel method which can perform well without needing to seek a linear combination of all the training samples for every test sample. Our proposed method can be divided into two steps: the first step of the proposed method uses c-means clustering to categorize the test sets into c subsets and then calculates K nearest neighbors for each class centre from all the training samples. The second step represents test samples located in each subset as a linear combination of the according K nearest neighbors and uses representation result to perform ultimate classification. A large number of experimental results show that the proposed algorithm is promising.

Published in:

2012 IEEE Symposium on Computational Intelligence for Security and Defence Applications

Date of Conference:

11-13 July 2012