Optimal symbol alignment distance: a new distance for sequences of symbols
Visualitza/Obre
Cita com:
hdl:2117/11063
Tipus de documentArticle
Data publicació2010-10-14
EditorIEEE Press. Institute of Electrical and Electronics Engineers
Condicions d'accésAccés obert
Tots els drets reservats. Aquesta obra està protegida pels drets de propietat intel·lectual i
industrial corresponents. Sense perjudici de les exempcions legals existents, queda prohibida la seva
reproducció, distribució, comunicació pública o transformació sense l'autorització del titular dels drets
Abstract
Comparison functions for sequences (of symbols) are important components of many applications, for example clustering, data cleansing and integration. For years, many efforts have been made to improve the performance of such comparison functions. Improvements have been done either at the cost of reducing the accuracy of the comparison, or by compromising certain basic characteristics of the functions, such as the triangular inequality. In this paper, we propose a new distance for sequences of symbols (or strings) called Optimal Symbol Alignment distance (OSA distance, for short). This distance has a very low cost in practice, which makes it a suitable candidate for computing distances in applications with large amounts of (very long) sequences. After providing a mathematical proof that the OSA distance is a real distance, we present some experiments for different scenarios (DNA sequences, record linkage, ...), showing that the proposed distance outperforms, in terms of execution time and/or accuracy, other well-known comparison functions such as the Edit or Jaro-Winkler distances.
CitacióHerranz, J.; Nin, J.; Solé, M. Optimal symbol alignment distance: a new distance for sequences of symbols. "IEEE Transactions on Knowledge and Data Engineering (TKDE)", 14 Octubre 2010.
ISSN1041-4347
Fitxers | Descripció | Mida | Format | Visualitza |
---|---|---|---|---|
05601718.pdf | 298,9Kb | Visualitza/Obre |