Detection of Sequential Outliers using a Variable Length Markov Model

Abstract : The problem of mining for outliers in sequential datasets is crucial to forward appropriate analysis of data. Therefore, many approaches for the discovery of such anomalies have been proposed. However, most of them use a sample of known typical sequences to build the model. Besides, they remain greedy in terms of memory usage. In this paper we propose an extension of one such approach, based on a Probabilistic Suffix Tree and on a measure of similarity. We add a pruning criterion which reduces the size of the tree while improving the model, and a sharp inequality for the concentration of the measure of similarity, to better sort the outliers. We prove the feasability of our approach through a set of experiments over a protein database.
Document type :
Conference papers
Complete list of metadatas

Cited literature [19 references]  Display  Hide  Download

https://hal-lirmm.ccsd.cnrs.fr/lirmm-00324526
Contributor : Cécile Low-Kam <>
Submitted on : Monday, October 7, 2019 - 4:20:31 PM
Last modification on : Monday, October 7, 2019 - 4:48:30 PM

File

lirmm-00324526v1.pdf
Files produced by the author(s)

Identifiers

Citation

Cécile Low-Kam, Anne Laurent, Maguelonne Teisseire. Detection of Sequential Outliers using a Variable Length Markov Model. ICMLA: International Conference on Machine Learning and Applications, Dec 2008, San Diego, CA, United States. pp.571-576, ⟨10.1109/ICMLA.2008.137⟩. ⟨lirmm-00324526⟩

Share

Metrics

Record views

144

Files downloads

11