Weighted Path as a Condensed Pattern in a Single Attributed DAG

Abstract : 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.
Document type :
Conference papers
Liste complète des métadonnées

Cited literature [13 references]  Display  Hide  Download

https://hal.archives-ouvertes.fr/hal-01151561
Contributor : Claude Pasquier <>
Submitted on : Wednesday, May 13, 2015 - 10:20:28 AM
Last modification on : Thursday, February 7, 2019 - 2:59:12 PM
Document(s) archivé(s) le : Monday, September 14, 2015 - 11:50:30 PM

File

IJCAI13-244.pdf
Publisher files allowed on an open archive

Identifiers

  • HAL Id : hal-01151561, version 1

Citation

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), Sep 2013, Beijing, China. 〈hal-01151561〉

Share

Metrics

Record views

346

Files downloads

95