Generalized median string computation by means of string embedding in vector spaces

Authors:
Xiaoyi Jiang;Jöran Wentker;Miquel Ferrer
Affiliations:
Department of Mathematics and Computer Science, University of Münster Einsteinstrasse 62, 48149 Münster, Germany;Department of Mathematics and Computer Science, University of Münster Einsteinstrasse 62, 48149 Münster, Germany;Centre de Visió per Computador, Departament de Ciències de la Computació Universitat Autònoma de Barcelona, 08193 Bellaterra, Spain
Venue:
Pattern Recognition Letters
Year:
2012

Citing 18
Cited 4

The algebraic degree of geometric optimization problems

Discrete & Computational Geometry
Using consensus sequence voting to correct OCR errors

Computer Vision and Image Understanding
The String-to-String Correction Problem

Journal of the ACM (JACM)
Improved greedy algorithm for computing approximate median strings

Acta Cybernetica
On Median Graphs: Properties, Algorithms, and Applications

IEEE Transactions on Pattern Analysis and Machine Intelligence - Graph Algorithms and Computer Vision
An approximate median search algorithm in non-metric spaces

Pattern Recognition Letters
Computation of Normalized Edit Distance and Applications

IEEE Transactions on Pattern Analysis and Machine Intelligence
Fast Computation of Normalized Edit Distances

IEEE Transactions on Pattern Analysis and Machine Intelligence
Optimal Lower Bound for Generalized Median Problems in Metric Space

Proceedings of the Joint IAPR International Workshop on Structural, Syntactic, and Statistical Pattern Recognition
Use of Positional Information in Sequence Alignment for Multiple Classifier Combination

MCS '01 Proceedings of the Second International Workshop on Multiple Classifier Systems
Fast Median Search in Metric Spaces

SSPR '98/SPR '98 Proceedings of the Joint IAPR International Workshops on Advances in Pattern Recognition
The consensus string problem for a metric is NP-complete

Journal of Discrete Algorithms
A Stochastic Approach to Median String Computation

SSPR & SPR '08 Proceedings of the 2008 Joint IAPR International Workshop on Structural, Syntactic, and Statistical Pattern Recognition
Graph-Based k-Means Clustering: A Comparison of the Set Median versus the Generalized Median Graph

CAIP '09 Proceedings of the 13th International Conference on Computer Analysis of Images and Patterns
Generalized median graph computation by means of graph embedding in vector spaces

Pattern Recognition
A generic framework for median graph computation based on a recursive embedding approach

Computer Vision and Image Understanding
Transforming strings to vector spaces using prototype selection

SSPR'06/SPR'06 Proceedings of the 2006 joint IAPR international conference on Structural, Syntactic, and Statistical Pattern Recognition
Median strings

Pattern Recognition Letters

Evolutionary weighted mean based framework for generalized median computation with application to strings

SSPR'12/SPR'12 Proceedings of the 2012 Joint IAPR international conference on Structural, Syntactic, and Statistical Pattern Recognition
A clustering-based ensemble technique for shape decomposition

SSPR'12/SPR'12 Proceedings of the 2012 Joint IAPR international conference on Structural, Syntactic, and Statistical Pattern Recognition
Ensemble clustering by means of clustering embedding in vector spaces

Pattern Recognition
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

In structural pattern recognition the median string has been established as a useful tool to represent a set of strings. However, its exact computation is complex and of high computational burden. In this paper we propose a new approach for the computation of median string based on string embedding. Strings are embedded into a vector space and the median is computed in the vector domain. We apply three different inverse transformations to go from the vector domain back to the string domain in order to obtain a final approximation of the median string. All of them are based on the weighted mean of a pair of strings. Experiments show that we succeed to compute good approximations of the median string.