| 挖掘关联规则的Apriori_OAR算法 |
| |
| 引用本文： | 姜彬,李逸波,高明.挖掘关联规则的Apriori_OAR算法[J].海军航空工程学院学报,2005,20(2):272-274. |
| |
| 作者姓名： | 姜彬 李逸波 高明 |
| |
| 作者单位： | 海军航空工程学院研究生管理大队，海军航空工程学院控制工程系，山东师范大学 烟台，264001，济南，250014 |
| |
| 摘 要： | 阐述了Apriori算法是挖掘关联规则的一个经典算法,但算法效率不高,通过分析、研究该算法的基本思想,提出了采用项集的有序性特性和减少扫描数据库记录个数两种方法的 Apriori_OAR算法,以提高挖掘效率。
|
| 关 键 词： | 数据挖掘 关联规则 Apriori算法 频繁项集 Apriori_OAR算法 |
| 修稿时间： | 2004年10月14 |
Apriori_OAR Algorithm for Data Mining Association Rule |
| |
| JIANG Bin,LI Yi-bo,GAO Ming Graduate Students'Brigade of NAEI.Apriori_OAR Algorithm for Data Mining Association Rule[J].Journal of Naval Aeronautical Engineering Institute,2005,20(2):272-274. |
| |
| Authors: | JIANG Bin LI Yi-bo GAO Ming Graduate Students'Brigade of NAEI |
| |
| Institution: | JIANG Bin,LI Yi-bo,GAO Ming Graduate Students'Brigade of NAEI Department of Control Engineering,NAEI,Yantai,264001, Shandong Normal University,Ji'nan,250014 |
| |
| Abstract: | The Apriori algorithm is a classical algorithm for mining association, but its efficiency is not very high. In this paper, we deeply study the idea of the Apriori algorithm. And through presenting an improved algorithm by ordering itemsets and reducing the number of Database scanning, this paper gives an improved algorithm Apriori_OAR, and improves the efficiency of data mining. |
| |
| Keywords: | data raining association rule Apriori algorithm frequent itemsets Apriori_OAR algorithm |
| 本文献已被 CNKI 万方数据 等数据库收录！ |
|
