摘要
The problem of mining frequent set is a key issue in data mining. In this paper, a new method of miningfrequent set based on the frequent link is proposed. The algorithm constructs alternate frequent link from the transac-tion, the alternate link is yielded by adding up the alternate frequent link which constructed by scanning the transac-tion database in proper order. The frequent link that comprises all the information is constructed with the frequentnode which is selected according requirement. Our algorithm need to scan the transaction database only once and easysupervises the change of frequent set in order to guarantee the right of association rule.
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.
出处
《计算机科学》
CSCD
北大核心
2003年第7期165-166,共2页
Computer Science
