Proceedings

Weighted Path as a Condensed Pattern in a Single Attributed DAG

Download BibTeX Cite

Proceedings of the Twenty-Third International Joint Conference on Artificial Intelligence. Pages 1642-1647.

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.

Jérémy Sanhes, Frédéric Flouvat, Claude Pasquier, Nazha Selmaoui-Folcher, and Jean-François Boulicaut. 2013. Weighted Path as a Condensed Pattern in a Single Attributed DAG. In Proceedings of the Twenty-Third International Joint Conference on Artificial Intelligence, IJCAI-13. IJCAI, 1642–1647. https://ijcai.org/proceedings/2013/244
Welcome Future Conferences AI Journal Division IJCAI Proceedings About IJCAI IJCAI Awards