首页> 外文OA文献 >Mining Closed and Maximal Frequent Subtrees from Databases of Labeled Rooted Trees

【2h】

Mining Closed and Maximal Frequent Subtrees from Databases of Labeled Rooted Trees

机译：从带标签的根树数据库中挖掘封闭和最大频率子树

页面导航

著录项
相似文献
相关主题

著录项

作者
Yun Chi; Yi Xia; Yirong Yang; Richard R. Muntz;
展开▼
作者单位

展开▼
年度 2004
总页数
原文格式 PDF
正文语种
中图分类

相似文献

外文文献
中文文献
专利

1. Mining closed and maximal frequent subtrees from databases of labeled rooted trees [J] . Yun Chi, Yi Xia, Yirong Yang, IEEE Transactions on Knowledge and Data Engineering . 2005,第2期

机译：从带标签的根树数据库中挖掘封闭的最大子树
2. Mining of closed frequent subtrees from frequently updated databases [J] . Viet Anh Nguyen, Akihiro Yamamoto Intelligent data analysis . 2012,第6期

机译：从频繁更新的数据库中挖掘封闭的频繁子树
3. EFFICIENT MINING OF CLOSED TREE PATTERNS FROM LARGE TREE DATABASES WITH SUBTREE CONSTRAINT [J] . VIET ANH NGUYEN, KOICHIRO DOI, AKIHIRO YAMAMOTO International Journal of Artificial Intelligence Tools: Architectures, Languages, Algorithms . 2012,第6期

机译：具有次约束的大型树数据库中闭合树模式的高效挖掘
4. Mining frequent rooted subtrees in XML data with Me-Tree [C] . Wansong Zhang, Daxin Liu, Jianpei Zhang . 2004

机译：使用Me-Tree挖掘XML数据中的频繁生根子树
5. Algorithms for Mining Maximal Quasi Frequent Subnetworks [D] . El Radie, Eihab Salah. 2018

机译：用于采矿最大准则频繁子网的算法
6. Enumerating all maximal frequent subtrees in collections of phylogenetic trees [O] . Akshay Deepak, David Fernández-Baca 2014

机译：枚举系统发育树集合中的所有最大频繁子树
7. Canonical forms for labelled trees and their applications in frequent subtree mining [O] . Yun Chi, Yirong Yang, Richard R. Muntz 2005

机译：标记树的规范形式及其在频繁子树挖掘中的应用

Mining Closed and Maximal Frequent Subtrees from Databases of Labeled Rooted Trees

著录项

相似文献

相关主题

期刊订阅