By Topic

Neural networks applied to classification of data based on Mahalanobis metrics

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)

This work presents a new algorithm for automatic classification of data that make use of a competitive neural network to aid the classification process. The algorithm basically answer two questions: Given a table where each row is a point of dimension D, in how many classes or clusters these data are disposed in? and given a point out of this set, to witch of this classes or clusters the point belongs to? The number of classes is automatically founded by the algorithm, that cluster according with a similarity measure among points that belong to the classes. The similarity measure used was the Mahalanobis distance, instead of the common Euclidian distance. That measure makes possible the incorporation of the spatial statistics of the data.

Published in:

Neural Networks, 2003. Proceedings of the International Joint Conference on  (Volume:4 )

Date of Conference:

20-24 July 2003