By Topic

A method for improving the classification speed of clustering algorithms which use a Euclidean distance metric

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)
J. D. Curle ; Plessey Electronic Systems Research, Havant, England ; J. J. Hill

Many pattern recognition computer programs use one of the clustering algorithm techniques. Often these algorithms use a Euclidean distance metric as a similarity measure. A scheme is proposed where both the Euclidean metric and a more simple city-block metric are utilized together to reduce overall classification time. The relation between the Euclidean and city-block distances is introduced as a scalar function. The bounds of the function are given and used to decide whether classification of each pattern vector is to be achieved by the computationally slow Euclidean distance or the faster city-block distance. The criteria is that the classification should be identical to the original Euclidean only scheme.

Published in:

Proceedings of the IEEE  (Volume:69 ,  Issue: 1 )