资源分类
》 资源 》论文》Weighted Path as a Condensed Pattern in a Single Attributed DAG

Weighted Path as a Condensed Pattern in a Single Attributed DAG

2019-11-11 | |  82 |   48 |   0

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 speci?ed collections. It leads to a condensed representation setting whose ef?ciency and scalability are empirically studied.

上一篇：Machine-Learning-Based Circuit Synthesis Lior Rokach1 and Meir Kalech1 and Gregory Provan2 and Alexander Feldman2

下一篇：Multi-Dimensional Causal Discovery Ulrich Schaechtle and Kostas Stathis Stefano Bromuri

用户评价
全部评价

热门资源

  • Learning to Predi...

    Much of model-based reinforcement learning invo...

  • Stratified Strate...

    In this paper we introduce Stratified Strategy ...

  • The Variational S...

    Unlike traditional images which do not offer in...

  • A Mathematical Mo...

    Direct democracy, where each voter casts one vo...

  • Rating-Boosted La...

    The performance of a recommendation system reli...