%0 Journal Article
%T Multi-relational frequent pattern mining algorithm<br>一种多关系频繁模式挖掘算法*
%A DENG Zuo-xiang
%A LIU Lian-fang
%A LIANG Yi-ping
%A ZHOU Xiao-ping
%A <br>邓左祥
%A 刘连芳
%A 梁一平
%A 周小平
%J 计算机应用研究
%D 2009
%I 
%X While dealing with multi-relation, traditional data mining algorithms used the way of physical join. In order to solve this problem, this paper proposed a multi-relational frequent pattern mining algorithm. By taking advantage of tuple ID propagation approach, this algorithm could directly mine frequent pattern in multi-relation without physical join. Experiment demonstrates that, this algorithm has high efficiency.
%K multi-relational data mining
%K frequent pattern
%K tuple ID propagation<br>多关系数据挖掘
%K 频繁模式
%K 元组ID传播
%U http://www.alljournals.cn/get_abstract_url.aspx?pcid=5B3AB970F71A803DEACDC0559115BFCF0A068CD97DD29835&cid=8240383F08CE46C8B05036380D75B607&jid=A9D9BE08CDC44144BE8B5685705D3AED&aid=5FEF5477801A35A227AAB8808AC113F3&yid=DE12191FBD62783C&vid=96C778EE049EE47D&iid=9CF7A0430CBB2DFD&sid=C896EC751F74EB88&eid=1DFCEAFAF489C144&journal_id=1001-3695&journal_name=计算机应用研究&referenced_num=0&reference_num=11