On the Weighted Mean of a Pair of Strings |
| |
Authors: | Horst Bunke Xiaoyi Jiang Karin Abegglen Abraham Kandel |
| |
Affiliation: | (1) Department of Computer Science, University of Bern, Bern, Switzerland, CH;(2) Department of Computer Science and Engineering, University of South Florida, Tampa, FL, USA, US |
| |
Abstract: | String matching and string edit distance are fundamental concepts in structural pattern recognition. In this paper, the weighted
mean of a pair of strings is introduced. Given two strings, x and y, where d(x, y) is the edit distance of x and y, the weighted mean of x and y is a string z that has edit distances d(x, z) and d(z, y)to x and y, respectively, such that d(x, z) _ d(z, y) = d(x, y). We’ll show formal properties of the weighted mean, describe a procedure for its computation, and give practical examples.
Received: 26 October 2000, Received in revised form: 27 April 2001, Accepted: 20 July 2001 |
| |
Keywords: | : Generalised median string Self-organising feature map String edit distance String matching Weighted mean string |
本文献已被 SpringerLink 等数据库收录! |
|