By Topic

Strongly robust feature-voting fuzzy clustering

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
$31 $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)
Looney, C.G. ; Dept. of Comput. Sci. & Eng., Nevada Univ., Reno, NV, USA ; Yan, Y.

An outstanding problem in classification and recognition is that of dealing with random errors on one or more features of the feature vectors. This makes it difficult to train a supervised learning system such as NNs and SVMs that are trained on input-output pairs, which learn the noise and are thus unreliable. One way to get the training pairs from the input data is to cluster the feature vectors into clusters and assign an output codeword to each. But here too the problem of errors appears when a distance is used as the similarity measure. We devise here a way to deal with the noise problem by letting each feature in an input feature vector vote for the class it is most like. The most votes determines the winner. Thus unbounded noise on a minority of features does not affect the outcome. We make comparisons on the notoriously difficult iris dataset and analyze why other methods fail. The results are quite good.

Published in:

Information Reuse and Integration, Conf, 2005. IRI -2005 IEEE International Conference on.

Date of Conference:

15-17 Aug. 2005