On Measuring Similarity for Sequences of Itemsets

Elias Egho 1 Chedy Raïssi 1 Toon Calders 2 Nicolas Jay 1 Amedeo Napoli 1
1 ORPAILLEUR - Knowledge representation, reasonning
LORIA - NLPKD - Department of Natural Language Processing & Knowledge Discovery, Inria Nancy - Grand Est
Abstract : Computing the similarity between sequences is a very important challenge for many different data mining tasks. There is a plethora of similarity measures for sequences in the literature, most of them being designed for sequences of items. In this work, we study the problem of measuring the similarity between sequences of itemsets. We present new combinatorial results for efficiently counting distinct and common subsequences. These theoretical results are the cornerstone of an effective dynamic programming approach to deal with this problem. Experiments on healthcare trajectories and synthetic datasets, show that our measure of similarity produces competitive scores and indicates that our method is relevant for large scale sequential data analysis.
Document type :
[Research Report] RR-8086, INRIA. 2012, pp.19

Contributor : Elias Egho <>
Submitted on : Friday, March 1, 2013 - 4:44:35 PM
Last modification on : Thursday, September 22, 2016 - 2:33:32 PM


Files produced by the author(s)


  • HAL Id : hal-00740231, version 2


Elias Egho, Chedy Raïssi, Toon Calders, Nicolas Jay, Amedeo Napoli. On Measuring Similarity for Sequences of Itemsets. [Research Report] RR-8086, INRIA. 2012, pp.19. <hal-00740231v2>




Record views


Document downloads