Improved distance measure for pattern recognition
B.G. Batchelor
Abstract
B.G. Batchelor
Abstract
The Euclidean distance has often been used to measure the similarity between patterns represented by multidimensional vectors. The Euclidean distance is expensive to implement in hardware, and alternatives have been sought. The letter proposes a new distance measure which is a weighted sum of the city block and square distances. This new distance is a more accurate predictor of the Euclidean distance than are either of its components.
OpenAlex reports 4 citations for this work. Citation counts describe recorded attention and do not establish research quality.
A contribution statement is not available in the OpenAlex record.
Method details are not available in the OpenAlex metadata.
Findings are not separately available in the OpenAlex metadata.
Limitations are not available in the OpenAlex metadata.
Application details are not available in the OpenAlex metadata.
The Euclidean distance has often been used to measure the similarity between patterns represented by multidimensional vectors. The Euclidean distance is expensive to implement in hardware, and alternatives have been sought. The letter proposes a new distance measure which is a weighted sum of the city block and square distances. This new distance is a more accurate predictor of the Euclidean distance than are either of its components.
Key concepts: Euclidean distance, Distance measures, Euclidean distance matrix, Measure (data warehouse), Minkowski distance, Similarity measure, Mathematics, Similarity (geometry)