Smoothing and compression with stochastic k-testable tree languages
Por favor, use este identificador para citar o enlazar este ítem:
http://hdl.handle.net/10045/14022
Registro completo de metadatos
Campo DC | Valor | Idioma |
---|---|---|
dc.contributor | Transducens | en |
dc.contributor.author | Rico-Juan, Juan Ramón | - |
dc.contributor.author | Calera Rubio, Jorge | - |
dc.contributor.author | Carrasco, Rafael C. | - |
dc.contributor.other | Universidad de Alicante. Departamento de Lenguajes y Sistemas Informáticos | en |
dc.date.accessioned | 2010-05-07T11:04:24Z | - |
dc.date.available | 2010-05-07T11:04:24Z | - |
dc.date.issued | 2005-04-02 | - |
dc.identifier.citation | RICO JUAN, Juan Ramón; CALERA RUBIO, Jorge; CARRASCO JIMÉNEZ, Rafael Carlos. "Smoothing and compression with stochastic k-testable tree languages". Pattern Recognition. Vol. 38, No. 9 (Sept. 2005). ISSN 0031-3203, pp. 1420-1430 | en |
dc.identifier.issn | 0031-3203 (Print) | - |
dc.identifier.issn | 1873-5142 (Online) | - |
dc.identifier.uri | http://hdl.handle.net/10045/14022 | - |
dc.description.abstract | In this paper, we describe some techniques to learn probabilistic k-testable tree models, a generalization of the well known k-gram models, that can be used to compress or classify structured data. These models are easy to infer from samples and allow for incremental updates. Moreover, as shown here, backing-off schemes can be defined to solve data sparseness, a problem that often arises when using trees to represent the data. These features make them suitable to compress structured data files at a better rate than string-based methods. | en |
dc.description.sponsorship | The Spanish Comisión Interministerial de Ciencia y Tecnología through Grants TIC2003-08681-C02 and TIC2003-08496-C04. | en |
dc.language | eng | en |
dc.publisher | Elsevier | en |
dc.subject | Tree grammars | en |
dc.subject | Stochastic models | en |
dc.subject | Ssmoothing | en |
dc.subject | Backing-off | en |
dc.subject | Data compression | en |
dc.subject.other | Lenguajes y Sistemas Informáticos | en |
dc.title | Smoothing and compression with stochastic k-testable tree languages | en |
dc.type | info:eu-repo/semantics/article | en |
dc.peerreviewed | si | en |
dc.identifier.doi | 10.1016/j.patcog.2004.03.024 | - |
dc.relation.publisherversion | http://dx.doi.org/10.1016/j.patcog.2004.03.024 | en |
dc.rights.accessRights | info:eu-repo/semantics/restrictedAccess | - |
Aparece en las colecciones: | INV - TRANSDUCENS - Artículos de Revistas |
Archivos en este ítem:
Archivo | Descripción | Tamaño | Formato | |
---|---|---|---|---|
pr04.pdf | Preprint (acceso libre) | 215,85 kB | Adobe PDF | Abrir Vista previa |
smoothing_compression.pdf | Versión final (acceso restringido) | 393,6 kB | Adobe PDF | Abrir Solicitar una copia |
Todos los documentos en RUA están protegidos por derechos de autor. Algunos derechos reservados.