Efficient Closed Pattern Mining in Strongly Accessible Set Systems

author: Tamás Horváth, Fraunhofer IAIS
published: Sept. 4, 2007,   recorded: August 2007,   views: 3422


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.


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.

See Also:

Download slides icon Download slides: mlg07_horvath_tamas.ppt (175.0 KB)

Help icon Streaming Video Help

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: