1. Home
  2. Material Detail: DIGDAG, a first algorithm to mine closed frequent embedded sub-DAGs

Material Detail

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

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

This video was recorded at 5th International Workshop on Mining and Learning with Graphs (MLG), Firenze 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.
Keywords:
videolectures, ocwc, oec
Disciplines:
Go to Material 
Bookmark / Add to Course ePortfolio
Create a Learning Exercise
Add Accessibility Information
Rate
Add a Comment

Quality

  • User Rating
  • Comments
  • Learning Exercises
  • Bookmark Collections
  • Course ePortfolios
  • Accessibility Info

More about this material

Material Type:
Presentation
Date Added to MERLOT:
February 10, 2015
Date Modified in MERLOT:
February 10, 2015
Author:
Submitter:
The Open Education Consortium
Primary Audience:
College General Ed, College Lower Division, College Upper Division
Technical Format:
Video
Mobile Compatibility:
Not specified at this time
Language:
English
Cost Involved:
No
Source Code Available:
No
Creative Commons:
Creative Commons License
This work is licensed under a Attribution-NonCommercial-NoDerivs 3.0 United States

Browse...

Disciplines with similar materials as DIGDAG, a first algorithm to mine closed frequent embedded sub-DAGs
People who viewed this also viewed
Other materials like DIGDAG, a first algorithm to mine closed frequent embedded sub-DAGs

Comments

Log in to participate in the discussions or sign up if you are not already a MERLOT member.