{"type":"ScholarlyArticle","title":"Weighted Path as a Condensed Pattern in a Single Attributed DAG","authors":[{"name":"Jérémy Sanhes","slug":"jeremy-sanhes","given":"Jérémy","family":"Sanhes","affiliation":""},{"name":"Frédéric Flouvat","slug":"frederic-flouvat","given":"Frédéric","family":"Flouvat","affiliation":""},{"name":"Claude Pasquier","slug":"claude-pasquier","given":"Claude","family":"Pasquier","affiliation":""},{"name":"Nazha Selmaoui-Folcher","slug":"nazha-selmaoui-folcher","given":"Nazha","family":"Selmaoui-Folcher","affiliation":""},{"name":"Jean-François Boulicaut","slug":"jean-francois-boulicaut","given":"Jean-François","family":"Boulicaut","affiliation":""}],"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.","doi":null,"url":"https://ijcai.org/proceedings/2013/244","pdf":"https://ijcai.org/proceedings/2013/0244.pdf","markdown":"https://ijcai.org/proceedings/2013/244.md","bibtex":"https://ijcai.org/proceedings/2013/bibtex/244","volume":{"slug":"2013","title":"Proceedings of the Twenty-Third International Joint Conference on Artificial Intelligence","short_title":"IJCAI 2013","url":"https://ijcai.org/proceedings/2013/","year":2013,"location":"Beijing, China","dates":"3–9 August 2013","editors":"Francesca Rossi","isbn":"978-1-57735-633-2","publisher":"AAAI Press / International Joint Conferences on Artificial Intelligence","doi_prefix":""},"section":null,"track":"","number":244,"pages":{"first":1642,"last":1647},"keywords":[],"videos":[],"references":[],"license_note":"Copyright International Joint Conferences on Artificial Intelligence."}