Efficient algorithms for segmentation of item-set time series
Data Mining and Knowledge Discovery
A statistical comparison of tag and query logs
Proceedings of the 32nd international ACM SIGIR conference on Research and development in information retrieval
Recurrent predictive models for sequence segmentation
IDA'07 Proceedings of the 7th international conference on Intelligent data analysis
| Hi-index | 0.00 |
Sequence data are abundant in application areas such as computational biology, environmental sciences, and telecommunication. Many real-life sequences have a strong segmental structure, with segments of different complexities. In this paper we study the description of sequence segments using variable length Markov chains (VLMCs), also known as tree models. We discover the segment boundaries of a sequence and at the same time we obtain a VLMC for each segment. Such a context tree contains the probability distribution vectors that capture the essential features of the corresponding segment. We use the Bayesian Information Criterion (BIC) and the Krichevsky-Trofimov Probability (KT) to select the number of segments of a sequence. On DNA data the method selects segments that closely correspond to the annotated regions of the genes.