DIGDAG, a First Algorithm to Mine Closed Frequent Embedded Sub-DAGs.
Alexandre Termier, Yoshinori Tamada, Kazuyuki Numata, Seiya Imoto, Takashi Washio, Tomoyuki Higuchi · 2007
Although tree and graph mining have attracted a lot of attention, there are nearly no algorithms devoted to DAGmining, whereas many applications are in dire need of such algorithms. We present in this paper DIGDAG, the first algorithm capable of mining closed frequent embedded sub-DAGs. This algorithm combines efficient closed frequent itemset algorithms with novel techniques in order to scale up to complex input data. 1.