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 compactness constraints), and algorithms that can compute the specified collections. It leads to a condensed representation setting whose efficiency and scalability are empirically studied.

Cite

Text

Sanhes et al. "Weighted Path as a Condensed Pattern in a Single Attributed DAG." International Joint Conference on Artificial Intelligence, 2013.

Markdown

[Sanhes et al. "Weighted Path as a Condensed Pattern in a Single Attributed DAG." International Joint Conference on Artificial Intelligence, 2013.](https://mlanthology.org/ijcai/2013/sanhes2013ijcai-weighted/)

BibTeX

@inproceedings{sanhes2013ijcai-weighted,
  title     = {{Weighted Path as a Condensed Pattern in a Single Attributed DAG}},
  author    = {Sanhes, Jérémy and Flouvat, Frédéric and Pasquier, Claude and Selmaoui-Folcher, Nazha and Boulicaut, Jean-François},
  booktitle = {International Joint Conference on Artificial Intelligence},
  year      = {2013},
  pages     = {1642-1648},
  url       = {https://mlanthology.org/ijcai/2013/sanhes2013ijcai-weighted/}
}