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

► Generalized median string is an important concept in structural pattern recognition. ► We present an approximate method for the np-hard generalized median string problem. ► Superior performance is demonstrated against other methods in a series of experiments. In structural pattern recognition the...

Celý popis

Uloženo v:
Podrobná bibliografie
Vydáno v:Pattern recognition letters Ročník 33; číslo 7; s. 842 - 852
Hlavní autoři: Jiang, Xiaoyi, Wentker, Jöran, Ferrer, Miquel
Médium: Journal Article Publikace
Jazyk:angličtina
Vydáno: Elsevier B.V 01.05.2012
Témata:
Algorismes computacionals
Algorithms and architectures for advanced scientific computing
Algorísmica i teoria de la complexitat
Anàlisi numèrica
Computer algorithms
Embedding
Generalized median
Informàtica
Informàtica teòrica
Lower bound
Matemàtiques i estadística
Modelització matemàtica
Percepció de les estructures
Processament de dades
String
Vector space
Àrees temàtiques de la UPC
Lower bound
Embedding
String
Vector space
Generalized median
ISSN:0167-8655, 1872-7344
On-line přístup:Získat plný text
Tagy: Přidat tag
Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!
Popis
Shrnutí:► Generalized median string is an important concept in structural pattern recognition. ► We present an approximate method for the np-hard generalized median string problem. ► Superior performance is demonstrated against other methods in a series of experiments. 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.
ISSN:0167-8655
1872-7344
DOI:10.1016/j.patrec.2011.07.006