A Study on the Mining Algorithm of Fast Association Rules for the XML Data

被引:0
作者
Wu Gongxing [1 ]
机构
[1] Zhejiang Gongshang Univ, Coll Comp Sci & Informat Engn, Hangzhou, Zhejiang, Peoples R China
来源
PROCEEDINGS OF THE INTERNATIONAL CONFERENCE ON COMPUTER SCIENCE AND INFORMATION TECHNOLOGY | 2008年
关键词
D O I
暂无
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
It presents an efficient mining algorithm FreqtTree for discovering all frequent patterns from XML data, and then considers mining global frequent patterns from XML. data in distributed environment in this paper. First of all, the XML files are transferred to DOM tree, and then it mines all the frequent patterns from the DOM tree. It's a high efficient algorithm because it adopts the right extension technology and scans the DOM tree only one time. After that, it describes the distributed association rule data mining algorithm DFreqtTree based on DOM tree. At last, this algorithm is implemented and analyzed by Java language.
引用
收藏
页码:204 / 207
页数:4
相关论文
共 9 条
[1]  
Agarwal R., 1994, P 20 INT C VER LARG, V487, P499
[2]  
[Anonymous], 1993, PROC 1993 ACM SIGMOD
[3]  
EVANS C, 2007, COMPUT EDUC
[4]  
Fayyad U. M., 1996, ADV KNOWLEDGE DISCOV, P1, DOI DOI 10.1609/AIMAG.V17I3.1230
[5]  
FUKUDA T, 1996, P 1996 ACM SIGMOD IN, P12
[6]  
GAO L, 2007, 4 INT C FUZZ SYST KN
[7]  
[高丽 Gao li], 2003, [河南大学学报. 自然科学版, Journal of Henan University. Natural Science], V33, P55
[8]  
MUHLENBEIN, 1993, EVOLUTIONARY COMPUTA, V1, P25
[9]  
WU ZH, 2005, COMPUT APPL, V25, P1009