| 基于频繁叶模式的XML最大频繁查询模式挖掘算法 |
| |
| 引用本文： | 陈超祥,丁健龙,华成,金林樵.基于频繁叶模式的XML最大频繁查询模式挖掘算法[J].计算机应用与软件,2009,26(6):85-87,197. |
| |
| 作者姓名： | 陈超祥 丁健龙 华成 金林樵 |
| |
| 作者单位： | 1. 浙江树人大学信息科技学院,浙江,杭州,310015
2. 浙江大学计算机科学与技术学院,浙江,杭州,310027 |
| |
| 基金项目： | 浙江省科技计划重点项目(2007C21042) |
| |
| 摘 要： | 在XML频繁查询模式挖掘稠密数据集、长数据集中,为克服项目集挖掘过程中挖掘的项目过多、不利于结果利用等问题,提出基于频繁叶模式的最大频繁查询模式挖掘算法MFRSTMiner。该算法通过构造频繁模式扩展森林,在扩展森林的叶节点中挖掘出最大频繁子树。试验结果表明该算法能够有效地挖掘动态事务集的最大频繁查询模式。
|
| 关 键 词： | XML 数据挖掘 最大频繁查询模式 MFRSTMiner |
MINING ALGORITHM OF XML MAXIMAL FREQUENT QUERY PATTERN BASED ON FREQUENT LEAF PATTERN |
| |
| Chen Chaoxiang,Ding Jianlong,Hua Cheng,Jin Linqiao.MINING ALGORITHM OF XML MAXIMAL FREQUENT QUERY PATTERN BASED ON FREQUENT LEAF PATTERN[J].Computer Applications and Software,2009,26(6):85-87,197. |
| |
| Authors: | Chen Chaoxiang Ding Jianlong Hua Cheng Jin Linqiao |
| |
| Affiliation: | College of Information Science and Technology;Zhejiang Shuren University;Hangzhou 310015;Zhejiang;China;College of Computer Science and Technology;Zhejiang University;Hangzhou 310027;China |
| |
| Abstract: | When mining the dense data sets and long data sets with XML frequent XML query pattern,there are too many projects to be mined in the mining process of project sets and it does not conduce to the use of the results.To solve the problem,in this paper we proposed a mining algorithm of maximal frequent query pattern based on frequent leaf pattern(MFRSTMiner).The algorithm mines the maximal frequent sub-trees from the leaf nodes of the expansion forest by constructing frequent leaf pattern expansion forest.Expe... |
| |
| Keywords: | XML Data mining Maximal frequent query pattern MFRSTMiner |
| 本文献已被 CNKI 维普 万方数据 等数据库收录！ |
