6th IARP -TC-15 Workshop on Graphbased Representations in Pattern Recognition

Mining Frequent Closed Unordered Trees Through Natural Representations

author: Albert Bifet, UPC- BARCELONA TECH

You might be experiencing some problems with Your Video player.

*Slides*
0:00	Mining Frequent Closed Unordered Trees Through Natural Representations
0:36	Introduction (1)
1:34	Introduction (2)
2:01	Introduction (3)
2:28	Introduction (4)
3:44	Introduction (5)
4:15	Introduction (6)
4:33	Related Work
5:40	Natural Representation (1)
6:56	Natural Representation (2)
8:09	Mining frequent subtrees in the ordered case (1)
8:34	Mining frequent subtrees in the ordered case (2)
9:15	Mining frequent subtrees in the ordered case (3)
9:25	Canonical Forms
10:01	Mining frequent subtrees in the unordered case (1)
10:07	Mining frequent subtrees in the unordered case (2)
10:17	Closure-based mining (1)
10:29	Closure-based mining (2)
10:50	Example: Ordered Case
11:22	Example: Unordered Case
11:39	Experiments: Gazelle Unordered Trees
12:55	Conclusions and Future Work
13:41	Future Work

Lecture rating

People found this lecture:
Worth seeing
because it is:
Valuable and informative
Well presented
Easily understandable
Acceptably recorded
You need to login to cast your vote.

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.