| 基于频繁链表的频繁集的挖掘算法 |
| |
| 引用本文： | 袁鼎荣,张师超.基于频繁链表的频繁集的挖掘算法[J].计算机科学,2003,30(7):165-166. |
| |
| 作者姓名： | 袁鼎荣 张师超 |
| |
| 作者单位： | 广西师范大学数学与计算机科学学院,桂林,541004 |
| |
| 摘 要： | 自从1989年提出KDD以来,关联规则的挖掘一直是人工智能及数据库领域关注的焦点,尤其是项目决策者渴求的制胜法宝。挖掘关联规则的前提是频繁集的挖掘,目前典型的频繁集挖掘算法以Appriori算法为代表。在Appriori算法的基础上提出了一些可行的方法,所有这些算法不外乎达到两个目的:①在穷举的基础上,设法删除对关联规则不太有效的频繁集,减少候选频繁集的数量,达到提高挖掘算法性能的目的。②直接挖掘最大频繁集,以最大频繁集为基础挖掘感兴趣
|
| 关 键 词： | 数据库 频繁集 数据挖掘算法 频繁链表 事物数据库 FL－Generation算法 |
An Algorithm of Mining Frequent Set Based on Frequent Link |
| |
| YUAN Ding-Rong ZHANG Shi-Chao.An Algorithm of Mining Frequent Set Based on Frequent Link[J].Computer Science,2003,30(7):165-166. |
| |
| Authors: | YUAN Ding-Rong ZHANG Shi-Chao |
| |
| Abstract: | 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. |
| |
| Keywords: | Frequent link Frequent set Transaction database Data mining |
| 本文献已被 CNKI 维普 万方数据 等数据库收录！ |
|
点击此处可从《计算机科学》下载全文 |
