%0 Journal Article
%T Mining frequent pattern tree in Web data<br>Web数据中频繁模式树的挖掘
%A WANG Zi-qiang
%A FENG Bo-qin
%A <br>王自强
%A 冯博琴
%J 控制理论与应用
%D 2005
%I 
%X To efficiently mine all frequent pattern trees from the semi-structured web data,the semi-structured data were modeled as labeled-ordered tree and an algorithm for mining all frequent pattern trees in an ordered data tree was proposed.This algorithm used rightmost path expansion technique,which started with pattern trees with only one node and nodes were added only to the rightmost path to generate new pattern trees.Furthermore,this algorithm maintained only the occurrences of the rightmost leaves to efficiently implement incremental computation of support.The theoretical analysis and experimental results show that this algorithm scales linearly in the total size of maximal tree pattern and works efficiently in practice.
%K data mining
%K Web data
%K frequent pattern tree
%K ordered tree<br>数据挖掘
%K Web数据
%K 频繁模式树
%K 有序树
%U http://www.alljournals.cn/get_abstract_url.aspx?pcid=5B3AB970F71A803DEACDC0559115BFCF0A068CD97DD29835&cid=8240383F08CE46C8B05036380D75B607&jid=970898A57DFC021F93AB51667BAED7F7&aid=B8FB0954CADB20D5&yid=2DD7160C83D0ACED&vid=BC12EA701C895178&iid=38B194292C032A66&sid=9BA67A0B76A3DBA8&eid=DDEED1BDDBFAA8A7&journal_id=1000-8152&journal_name=控制理论与应用&referenced_num=0&reference_num=7