DIGDAG, a first algorithm to mine closed frequent embedded sub-DAGs

author: Alexandre Termier, Institute of Statistical Mathematics
published: Sept. 5, 2007,   recorded: August 2007,   views: 2940

Related Open Educational Resources

Related content

Report a problem or upload files

If you have found a problem with this lecture or would like to send us extra material, articles, exercises, etc., please use our ticket system to describe your request and upload the data.
Enter your e-mail into the 'Cc' field, and we will keep you updated with your request's status.
Lecture popularity: You need to login to cast your vote.


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.

Link this page

Would you like to put a link to this lecture on your homepage?
Go ahead! Copy the HTML snippet !

Write your own review or comment:

make sure you have javascript enabled or clear this field: