%0 Journal Article
%T An Algorithm of Mining Frequent Set Based on Frequent Link<br>基于频繁链表的频繁集的挖掘算法
%A YUAN Ding-Rong ZHANG Shi-Chao
%A <br>袁鼎荣
%A 张师超
%J 计算机科学
%D 2003
%I 
%X The problem of mining frequent set is a key issue in data mining. In this paper, a new method of mining frequent set based on the frequent link is proposed. The algorithm constructs alternate frequent link from the transaction, the alternate link is yielded by adding up the alternate frequent link which constructed by scanning the transaction database in proper order. The frequent link that comprises all the information is constructed with the frequent node which is selected according requirement. Our algorithm need to scan the transaction database only once and easy supervises the change of frequent set in order to guarantee the right of association rule.
%K Frequent link
%K Frequent set
%K Transaction database
%K Data mining<br>数据库
%K 频繁集
%K 数据挖掘算法
%K 频繁链表
%K 事物数据库
%K FL－Generation算法
%U http://www.alljournals.cn/get_abstract_url.aspx?pcid=5B3AB970F71A803DEACDC0559115BFCF0A068CD97DD29835&cid=8240383F08CE46C8B05036380D75B607&jid=64A12D73428C8B8DBFB978D04DFEB3C1&aid=1CFCE8B3FED35994&yid=D43C4A19B2EE3C0A&vid=340AC2BF8E7AB4FD&iid=DF92D298D3FF1E6E&sid=31611641D4BB139F&eid=43608FD2E15CD61B&journal_id=1002-137X&journal_name=计算机科学&referenced_num=4&reference_num=6