A new iterative algorithm for computing a quality approximate median of strings based on edit operations
Por favor, use este identificador para citar o enlazar este ítem:
http://hdl.handle.net/10045/37803
Registro completo de metadatos
Campo DC | Valor | Idioma |
---|---|---|
dc.contributor | Reconocimiento de Formas e Inteligencia Artificial | es |
dc.contributor.author | Abreu Salas, José Ignacio | - |
dc.contributor.author | Rico-Juan, Juan Ramón | - |
dc.contributor.other | Universidad de Alicante. Departamento de Lenguajes y Sistemas Informáticos | es |
dc.date.accessioned | 2014-06-03T09:14:34Z | - |
dc.date.available | 2014-06-03T09:14:34Z | - |
dc.date.issued | 2014-01-15 | - |
dc.identifier.citation | Pattern Recognition Letters. 2014, 36: 74-80. doi:10.1016/j.patrec.2013.09.014 | es |
dc.identifier.issn | 0167-8655 (Print) | - |
dc.identifier.issn | 1872-7344 (Online) | - |
dc.identifier.uri | http://hdl.handle.net/10045/37803 | - |
dc.description.abstract | This paper presents a new algorithm that can be used to compute an approximation to the median of a set of strings. The approximate median is obtained through the successive improvements of a partial solution. The edit distance from the partial solution to all the strings in the set is computed in each iteration, thus accounting for the frequency of each of the edit operations in all the positions of the approximate median. A goodness index for edit operations is later computed by multiplying their frequency by the cost. Each operation is tested, starting from that with the highest index, in order to verify whether applying it to the partial solution leads to an improvement. If successful, a new iteration begins from the new approximate median. The algorithm finishes when all the operations have been examined without a better solution being found. Comparative experiments involving Freeman chain codes encoding 2D shapes and the Copenhagen chromosome database show that the quality of the approximate median string is similar to benchmark approaches but achieves a much faster convergence. | es |
dc.description.sponsorship | This work is partially supported by the Spanish CICYT under project DPI2006-15542-C04-01, the Spanish MICINN through project TIN2009-14205-CO4-01 and by the Spanish research program Consolider Ingenio 2010: MIPRCV (CSD2007-00018). | es |
dc.language | eng | es |
dc.publisher | Elsevier | es |
dc.subject | Approximate median string | es |
dc.subject | Edit distance | es |
dc.subject | Edit operations | es |
dc.subject.other | Lenguajes y Sistemas Informáticos | es |
dc.title | A new iterative algorithm for computing a quality approximate median of strings based on edit operations | es |
dc.type | info:eu-repo/semantics/article | es |
dc.peerreviewed | si | es |
dc.identifier.doi | 10.1016/j.patrec.2013.09.014 | - |
dc.relation.publisherversion | http://dx.doi.org/10.1016/j.patrec.2013.09.014 | es |
dc.rights.accessRights | info:eu-repo/semantics/openAccess | es |
Aparece en las colecciones: | INV - GRFIA - Artículos de Revistas |
Archivos en este ítem:
Archivo | Descripción | Tamaño | Formato | |
---|---|---|---|---|
2014_Abreu_Rico_PRL_final.pdf | Versión final (acceso restringido) | 639,85 kB | Adobe PDF | Abrir Solicitar una copia |
2014_Abreu_Rico_PRL.pdf | Versión revisada (acceso abierto) | 145,1 kB | Adobe PDF | Abrir Vista previa |
Todos los documentos en RUA están protegidos por derechos de autor. Algunos derechos reservados.