Compression guidée par automate et noyaux rationnels

Abstract : Due to the expansion of datas, compression algorithms are now crucial algorithms. We address here the problem of finding an optimal compression algorithm with respect to a given Markovian source. To this purpose, we extend the classical Huffman algorithm. The kernels are popular methods to measure the similarity between words for classication and learning. We generalize the definition of rational kernels in order to apply kernels to the comparison of languages. We study this generalization for factor and subsequence kerneland prove that these kernels are defined for parameters chosen in an appropriate interval. We give different methods to build weighted transducers which compute these kernels
Document type :
Theses
Liste complète des métadonnées

Cited literature [35 references]  Display  Hide  Download

https://pastel.archives-ouvertes.fr/tel-01270750
Contributor : Abes Star <>
Submitted on : Monday, February 8, 2016 - 2:26:49 PM
Last modification on : Thursday, July 5, 2018 - 2:46:00 PM
Document(s) archivé(s) le : Saturday, November 12, 2016 - 12:59:45 PM

File

TH2015PEST1002.pdf
Version validated by the jury (STAR)

Identifiers

  • HAL Id : tel-01270750, version 1

Citation

Ahmed Amarni. Compression guidée par automate et noyaux rationnels. Informatique et langage [cs.CL]. Université Paris-Est, 2015. Français. ⟨NNT : 2015PESC1002⟩. ⟨tel-01270750⟩

Share

Metrics

Record views

449

Files downloads

238