DIGDAG,第一个挖掘封闭频繁嵌入式子DAG的算法DIGDAG, a first algorithm to mine closed frequent embedded sub-DAGs |
|
课程网址: | http://videolectures.net/mlg07_termier_digdag/ |
主讲教师: | Alexandre Termier |
开课单位: | 统计数学研究所 |
开课时间: | 2007-09-05 |
课程语种: | 英语 |
中文简介: | 虽然树和图挖掘吸引了很多注意,几乎没有专门用于DAGmining的算法,而许多应用程序迫切需要这样的算法。 我们在本文中提出DIGDAG,第一种算法能够挖掘封闭的频繁嵌入子DAG的。 该算法结合了高效的封闭频繁项目集算法采用新技术进行扩展最多复杂的输入数据。 |
课程简介: | 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. |
关 键 词: | 应用程序; 封闭频繁项目集算法; 输入数据 |
课程来源: | 视频讲座网 |
最后编审: | 2019-06-30:cjy |
阅读次数: | 45 |