Median strings

Authors:
Teuvo Kohonen
Affiliations:
Helsinki University of Technology, Department of Technical Physics, SF-02150 Espoo 15, Finland
Venue:
Pattern Recognition Letters
Year:
1985

Citing 1
Cited 5

Self-organization and associative memory: 3rd edition

Self-organization and associative memory: 3rd edition

Rough-DBSCAN: A fast hybrid density based clustering method for large data sets

Pattern Recognition Letters
Generalized median string computation by means of string embedding in vector spaces

Pattern Recognition Letters
Essentials of the self-organizing map

Neural Networks
Normalised LCS-based method for indexing multidimensional data cube

International Journal of Intelligent Information and Database Systems
A new iterative algorithm for computing a quality approximate median of strings based on edit operations

Pattern Recognition Letters

Quantified Score

Hi-index	0.10

Visualization

Abstract

The concept of 'median string' over a set of strings is introduced in this paper. The set median is defined to be that element in the set of strings which has the smallest sum of distances (with respect to an arbitrary measure) from the other elements, and the (generalized) median is a hypothetical, artificially constructed element which has the smallest sum of distances from all the elements of the given set. The applicability of the median strings in the recognition of garbled strings is demonstrated, where they mostly yield a higher accuracy than the multiple-similarity and the k-nearest-neighbour methods.