Detection of common subtrees with identical label distribution - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Journal Articles Theoretical Computer Science Year : 2024

Detection of common subtrees with identical label distribution

Abstract

Frequent pattern mining is a relevant method to analyse structured data, like sequences, trees or graphs. It consists in identifying characteristic substructures of a dataset. This paper deals with a new type of patterns for tree data: common subtrees with identical label distribution. Their detection is far from obvious since the underlying isomorphism problem is graph isomorphism complete. An elaborated search algorithm is developed and analysed from both theoretical and numerical perspectives. Based on this, the enumeration of patterns is performed through a new lossless compression scheme for trees, called DAG-RW, whose complexity is investigated as well. The method shows very good properties, both in terms of computation times and analysis of real datasets from the literature. Compared to other substructures like topological subtrees and labelled subtrees for which the isomorphism problem is linear, the patterns found provide a more parsimonious representation of the data.
Fichier principal
Vignette du fichier
main.pdf (606.29 Ko) Télécharger le fichier
Origin Files produced by the author(s)
Licence

Dates and versions

hal-04171279 , version 1 (26-07-2023)

Licence

Identifiers

Cite

Romain Azaïs, Florian Ingels. Detection of common subtrees with identical label distribution. Theoretical Computer Science, 2024, 988, ⟨10.1016/j.tcs.2023.114366⟩. ⟨hal-04171279⟩
60 View
37 Download

Altmetric

Share

Gmail Mastodon Facebook X LinkedIn More