Skip to Main content Skip to Navigation
New interface
Reports (Research report)

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
Inria Nancy - Grand Est, LORIA - NLPKD - Department of Natural Language Processing & Knowledge Discovery
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 :
Reports (Research report)
Complete list of metadata

Cited literature [21 references]  Display  Hide  Download
Contributor : Elias Egho Connect in order to contact the contributor
Submitted on : Friday, March 1, 2013 - 4:44:35 PM
Last modification on : Wednesday, October 26, 2022 - 8:16:20 AM
Long-term archiving on: : Sunday, April 2, 2017 - 7:35:16 AM


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


Files downloads