On measuring similarity for sequences of itemsets

DOI10.1007/s10618-014-0362-1zbMath1405.68462OpenAlexW2064342721MaRDI QIDQ1715867

Toon Calders, Amedeo Napoli, Elias Egho, Chedy Raïssi, Nicolas Jay

Publication date: 29 January 2019

Published in: Data Mining and Knowledge Discovery (Search for Journal in Brave)

Full work available at URL: https://hal.inria.fr/hal-01094383/file/DAMI.pdf

Mathematics Subject Classification ID

Combinatorics on words (68R15) Algorithms on strings (68W32)

Related Items

Mining top-\(k\) motifs with a SAT-based framework

Uses Software

• R
• CloSpan

Cites Work

• Unnamed Item
• A survey of graph edit distance
• Approximate inclusion-exclusion
• Algorithms for subsequence combinatorics
• Learning stochastic edit distance: application in handwritten character recognition
• Introduction to Information Retrieval
• A linear space algorithm for computing maximal common subsequences