Directed acyclic graphs can be used across many application domains. In this paper, we study a new pattern domain for supporting their analysis. Therefore, we propose the pattern language of weighted paths, primitive constraints that enable to specify their relevancy (e.g., frequency and compactness constraints), and algorithms that can compute the specified collections. It leads to a condensed representation setting whose efficiency and scalability are empirically studied.
['Jérémy Sanhes', 'Frédéric Flouvat', 'Nazha Selmaoui-Folcher', 'Claude Pasquier', 'Jean-François Boulicaut']
Weighted path as a condensed pattern in a single attributed DAG