Material Detail
Efficient Closed Pattern Mining in Strongly Accessible Set Systems
This video was recorded at 5th International Workshop on Mining and Learning with Graphs (MLG), Firenze 2007. Many problems in data mining can be viewed as a special case of the problem of enumerating the closed elements of an independence system w.r.t. some specific closure operator. We consider a generalization of this problem to strongly accessible set systems and arbitrary closure operators. For this more general problem setting, the closed sets can be enumerated with polynomial delay if deciding membership in the set system and computing the closure operator can be solved in polynomial time. We discuss potential applications in graph mining.
Quality
- User Rating
- Comments
- Learning Exercises
- Bookmark Collections
- Course ePortfolios
- Accessibility Info
More about this material
- Mobile Compatibility:
- Not specified at this time
- Language:
- English
- Cost Involved:
- No
- Source Code Available:
- No
- Creative Commons:
-
This work is licensed under a Attribution-NonCommercial-NoDerivs 3.0 United States
