Skip to main content
Article thumbnail
Location of Repository

Proceedings of the Twenty-Third International Joint Conference on Artificial Intelligence Weighted Path as a Condensed Pattern in a Single Attributed DAG ∗

By Jérémy Sanhes, Frédéric Flouvat, Nazha Selmaoui-folcher and Claude Pasquier

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.

Year: 2014
OAI identifier: oai:CiteSeerX.psu:10.1.1.417.6149
Provided by: CiteSeerX
Download PDF:
Sorry, we are unable to provide the full text but you may find it at the following location(s):
  • http://citeseerx.ist.psu.edu/v... (external link)
  • http://ijcai.org/papers13/Pape... (external link)
  • Suggested articles


    To submit an update or takedown request for this paper, please submit an Update/Correction/Removal Request.