Weighted Path as a Condensed Pattern in a Single Attributed DAG - Archive ouverte HAL Accéder directement au contenu
Communication Dans Un Congrès Année : 2013

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.

Mots clés

Fichier principal
Vignette du fichier
IJCAI13-244.pdf (489.28 Ko) Télécharger le fichier
Origine : Fichiers éditeurs autorisés sur une archive ouverte
Loading...

Dates et versions

hal-01151561 , version 1 (13-05-2015)

Identifiants

  • HAL Id : hal-01151561 , version 1

Citer

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. 23rd International Joint Conference on Artificial Intelligence (IJCAI'13), Aug 2013, Beijing, China. pp.1642-8. ⟨hal-01151561⟩
302 Consultations
121 Téléchargements

Partager

Gmail Facebook X LinkedIn More