Skip to Main content Skip to Navigation

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 :
Complete list of metadata

Cited literature [35 references]  Display  Hide  Download
Contributor : ABES STAR :  Contact
Submitted on : Monday, February 8, 2016 - 2:26:49 PM
Last modification on : Saturday, January 15, 2022 - 3:55:59 AM
Long-term archiving on: : Saturday, November 12, 2016 - 12:59:45 PM


Version validated by the jury (STAR)


  • HAL Id : tel-01270750, version 1


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⟩



Record views


Files downloads