By Topic

A validity measure for hard and fuzzy clustering derived from Fisher's linear discriminant

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

3 Author(s)
Rita de Franco, C. ; AEP/NCE, Univ. Fed. do Rio de Janeiro, Brazil ; Silva Vidal, L. ; de Oliveira Cruz, A.J.

Cluster analysis has a growing importance in many research areas, especially those involving problems of pattern recognition. Generally, in real-world problems, the number of classes is unknown in advance, criteria to identify the best choice of clusters being necessary. In this paper, we propose an extension to the Fisher linear discriminant (EFLD) that does not impose limits on the minimum number of samples, that can be applied to fuzzy and crisp partitions and that can be calculated more efficiently. We also propose a new fast and efficient validity method based in the EFLD that measures the compactness and separation of partitions produced by any fuzzy or crisp clustering algorithm. The simulations performed indicate that it is a efficient and fast measure even when the overlapping between clusters is high. Finally, we propose an algorithm that applies the new validity measure to the problem of finding patterns for a fuzzy k-NN (k-nearest neighbors) classifier. This algorithm is applied to the problem of cursive digit recognition

Published in:

Fuzzy Systems, 2002. FUZZ-IEEE'02. Proceedings of the 2002 IEEE International Conference on  (Volume:2 )

Date of Conference:

2002