Please use this identifier to cite or link to this item:
Title: Extended-alphabet finite-context models
Author: Carvalho, João M.
Brás, Susana
Pratas, Diogo
Ferreira, Jacqueline
Soares, Sandra C.
Pinho, Armando J.
Issue Date: 1-Sep-2018
Publisher: Elsevier
Abstract: The Normalized Relative Compression (NRC) is a recent dissimilarity measure, related to the Kolmogorov Complexity. It has been successfully used in different applications, like DNA sequences, images or even ECG (electrocardiographic) signal. It uses a compressor that compresses a target string using exclusively the information contained in a reference string. One possible approach is to use finite-context models (FCMs) to represent the strings. A finite-context model calculates the probability distribution of the next symbol, given the previous $k$ symbols. In this paper, we introduce a generalization of the FCMs, called extended-alphabet finite-context models (xaFCM), that calculates the probability of occurrence of the next $d$ symbols, given the previous $k$ symbols. We perform experiments on two different sample applications using the xaFCMs and the NRC measure: ECG biometric identification, using a publicly available database; estimation of the similarity between DNA sequences of two different, but related, species -- chromosome by chromosome. In both applications, we compare the results against those obtained by the FCMs. The results show that the xaFCMs use less memory and computational time to achieve the same or, in some cases, even more accurate results.
Peer review: yes
DOI: 10.1016/j.patrec.2018.05.026
Appears in Collections:DETI - Artigos
DEP - Artigos
IEETA - Artigos
CINTESIS - Artigos

Files in This Item:
File Description SizeFormat 
Carvalho_2018.pdf1.58 MBAdobe PDFrestrictedAccess

Formato BibTex MendeleyEndnote Degois 

Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.