| 基于粗糙集带结论域的关联规则挖掘算法及其优化 |
| |
| 引用本文： | 罗可,童舟.基于粗糙集带结论域的关联规则挖掘算法及其优化[J].长沙理工大学学报(自然科学版),2008,5(1):69-74. |
| |
| 作者姓名： | 罗可 童舟 |
| |
| 作者单位： | 长沙理工大学计算机与通信工程学院,湖南,长沙,410076 |
| |
| 基金项目： | 国家自然科学基金
,
湖南省教育厅资助项目 |
| |
| 摘 要： | 针对Apriori-Hybrid算法的瓶颈，提出了一种使用支持度矩阵对频繁2项集快速挖掘的方法，采用改进的Apriori-Hybrid算法来挖掘关联规则，试验证明该算法提高了关联规则挖掘的效率和质量．
|
| 关 键 词： | 粗糙集 关联规则 约简 结论域 AprioriHybrid算法 |
| 文章编号： | 1672-9331(2008)01-0069-06 |
| 修稿时间： | 2007年11月21 |
An algorithm of mining association rules with decision attributes based on rough set and its' optimization methods |
| |
| LUO Ke,TONG Zhou.An algorithm of mining association rules with decision attributes based on rough set and its' optimization methods[J].Journal of Changsha University of Science and Technology:Natural Science,2008,5(1):69-74. |
| |
| Authors: | LUO Ke TONG Zhou |
| |
| Institution: | (College of Computer and Communicatien Engineering,Changsha University of Science and Technology,Changsha 410076,China) |
| |
| Abstract: | A support-matrix method is put forward to rapidly verify the Z-frequent item set. The presented method adopts the improved Apriori-Hybrid algorithm to mine association rules. Experiment results show that the proposed algorithm do improve the performance on efficiency and quality of mining association rules. |
| |
| Keywords: | rough set association rule reduction decision attribute Apriori-Hybrid algorithm |
| 本文献已被 维普 万方数据 等数据库收录！ |
