| 基于集合运算的频繁集挖掘优化算法 |
| |
| 引用本文： | 娄兰芳,潘庆先.基于集合运算的频繁集挖掘优化算法[J].山东大学学报(理学版),2008,43(11):54-57. |
| |
| 作者姓名： | 娄兰芳 潘庆先 |
| |
| 作者单位： | 烟台大学计算机科学技术学院,山东,烟台,264000 |
| |
| 基金项目： | 烟台大学青年基金资助项目 |
| |
| 摘 要： | 挖掘关联规则是数据挖掘中一个重要的课题,产生频繁项目集是其中的一个关键步骤。 提出了一种基于集合运算的频繁项目集挖掘算法,并将该算法与经典算法Apriori进行比较。该算法只需要对数据库扫描一遍。实验表明该算法的效率较好。
|
| 关 键 词： | 数据挖掘 关联规则 频繁项目集 |
An improved algorithm based on sets operation for mining frequent itemsets |
| |
| LOU Lan-fang,PAN Qing-xian.An improved algorithm based on sets operation for mining frequent itemsets[J].Journal of Shandong University,2008,43(11):54-57. |
| |
| Authors: | LOU Lan-fang PAN Qing-xian |
| |
| Institution: | School of Computer Science and Technology, Yantai University, Yantai 264000, Shandong, China |
| |
| Abstract: | Mining association rules is an important issue in data mining and one of its key steps is generating frequent itemsets.A frequent itemsets mining algorithm based on sets operation was presented and compared with the classical algorithms apriori.This algorithm needs only to scan the database once.Experiments indicate the new algorithm is very efficient. |
| |
| Keywords: | data mining association rules frequent itemsets |
| 本文献已被 CNKI 维普 万方数据 等数据库收录！ |
| 点击此处可从《山东大学学报(理学版)》浏览原始摘要信息 |
| 点击此处可从《山东大学学报(理学版)》下载免费的PDF全文 |
