0


有效的闭合模式挖掘在强可及集系统

Efficient Closed Pattern Mining in Strongly Accessible Set Systems
课程网址: http://videolectures.net/mlg07_horvath_ecpm/  
主讲教师: Tamás Horváth
开课单位: 弗劳恩霍夫协会
开课时间: 2007-09-04
课程语种: 英语
中文简介:
数据挖掘中的许多问题可以看作是列举独立系统的封闭元素的一个特例。我们考虑将此问题推广到高度可访问的集系统和任意闭合运算符。对于这种更一般的问题设置, 如果可以在多项式时间内确定集合系统的隶属度并计算闭合运算符, 则可以用多项式延迟枚举闭合集。我们讨论了图形挖掘中的潜在应用。
课程简介: 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.
关 键 词: 数据挖掘; 计数系统; 封闭元件; 闭包算子
课程来源: 视频讲座网
最后编审: 2020-06-01:吴雨秋(课程编辑志愿者)
阅读次数: 45