Weighted Path as a Condensed Pattern in a Single Attributed DAG
Résumé
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 com-pactness constraints), and algorithms that can compute the specified collections. It leads to a condensed representation setting whose efficiency and scalability are empirically studied.
| Origine | Fichiers éditeurs autorisés sur une archive ouverte |
|---|
Loading...