%0 Journal Article
%T Frequent subgraphs mining algorithm based on prefix node<br>一种基于前缀节点的频繁子图挖掘算法
%A LI Hai-bo
%A WANG Yuan-zhen
%A <br>李海波
%A 王元珍
%J 计算机应用研究
%D 2010
%I 
%X Based on the prefix node method in frequent tree mining algorithms, adopting core-braches-connecting vector partition on graphs, this paper provided a new algorithm CBE. The CBE algorithm could accomplish canonical determining in constant time on candidate pattern graphs expanded from branches. Performance testing proves that the efficiency of subgraphs mining is improved by CBE algorithm.
%K data mining
%K frequent subgraph
%K isomorphism class
%K canonical form
%K prefix node<br>数据挖掘
%K 频繁子图
%K 同构类
%K 规范化形式
%K 前缀节点
%U http://www.alljournals.cn/get_abstract_url.aspx?pcid=5B3AB970F71A803DEACDC0559115BFCF0A068CD97DD29835&cid=8240383F08CE46C8B05036380D75B607&jid=A9D9BE08CDC44144BE8B5685705D3AED&aid=8F11C5DC232A92423B28FCB59F87F60A&yid=140ECF96957D60B2&vid=DB817633AA4F79B9&iid=DF92D298D3FF1E6E&sid=8B1A65A1F8CED536&eid=2768654D5F8E2AA3&journal_id=1001-3695&journal_name=计算机应用研究&referenced_num=0&reference_num=12