Carregant...
Carregant...

Vés al contingut (premeu Retorn)

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

Autor
Jiang, X.; Wentker, J.; Ferrer, M.
Tipus d'activitat
Article en revista
Revista
Pattern recognition letters
Data de publicació
2012-11-01
Volum
33
Número
7
Pàgina inicial
842
Pàgina final
852
DOI
https://doi.org/10.1016/j.patrec.2011.07.006 Obrir en finestra nova
Repositori
http://hdl.handle.net/2117/19430 Obrir en finestra nova
URL
http://dx.doi.org/10.1016/j.patrec.2011.07.006 Obrir en finestra nova
Resum
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 or...
Citació
Jiang, X.; Wentker, J.; Ferrer, M. Generalized median string computation by means of string embedding in vector spaces. "Pattern recognition letters", 01 Novembre 2012, vol. 33, núm. 7, p. 842-852.
Paraules clau
Embedding, Generalized median, Lower bound, String, Vector space
Grup de recerca
DAMA-UPC - Data Management Group

Participants

  • Jiang, Xiaoyi  (autor)
  • Wentker, Jöran  (autor)
  • Ferrer Sumsi, Miquel  (autor)