CORC

浏览/检索结果: 共2条,第1-2条 帮助

限定条件                    
已选(0)清除 条数/页:   排序方式:
An efficient algorithm for mining both closed and maximal frequent free subtrees using canonical forms 会议论文
Wuhan, PEOPLES R CHINA, JUL 22-24, 2005
作者:  Guo, Ping[1];  Zhou, Yang[1];  Zhuang, Jun[1];  Chen, Ting[1];  Kang, Yan-Rong[1]
收藏  |  浏览/下载:0/0  |  提交时间:2019/11/28
Mining maximal and closed frequent free subtrees 会议论文
Magdalen Coll, Oxford, ENGLAND, SEP 16-18, 2004
作者:  Guo, Ping[1];  Hou, Yang Z.[1];  Zhuang, Jun[1]
收藏  |  浏览/下载:0/0  |  提交时间:2019/11/28


©版权所有 ©2017 CSpace - Powered by CSpace