检索规则说明:AND代表“并且”;OR代表“或者”;NOT代表“不包含”;(注意必须大写,运算符两边需空一格)
检 索 范 例 :范例一: (K=图书馆学 OR K=情报学) AND A=范并思 范例二:J=计算机应用与软件 AND (U=C++ OR U=Basic) NOT M=Visual
作 者:汪宏海[1]
出 处:《科学技术与工程》2012年第35期9537-9539,9551,共4页Science Technology and Engineering
摘 要:针对数据关联规则挖掘的不足,提出了一种基于免疫记忆克隆算法的关联规则挖掘方法。算法利用了免疫记忆特性,把挖掘的关联规则存入记忆库,加快了挖掘速度。在克隆扩增过程中,设计了一种基于矢量距的抗体浓度计算方法,保证克隆扩增过程中解的多样性。仿真实验结果表明,现算法具有较快的运行速度,提高了所得关联规则的准确性。For the shortcomings of data association rules mining, a new association rule mining method based on immune memory clonal algorithm is proposed. The algorithm takes advantage of the immunological memory char- acteristics and mining association rules are stored in the memory, which speed up the mining speed. In the process of clonal expansion, an antibody concentration calculation method based on the vector is designed to ensure the di- versity of solutions in the process of clonal expansion. The simulation results show that the algorithm has a faster running speed and improve the accuracy of the obtained association rules.
分 类 号:TP301.6[自动化与计算机技术—计算机系统结构]
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在链接到云南高校图书馆文献保障联盟下载...
云南高校图书馆联盟文献共享服务平台 版权所有©
您的IP:216.73.216.70