首页> 外文会议>Conference on Information Technology and Applications >An improved Apriori algorithm based on Hash table for borrowing data of library
【24h】

An improved Apriori algorithm based on Hash table for borrowing data of library

机译:一种改进的基于哈希表的散读算法,用于借用图书馆数据

获取原文

摘要

Borrowing data of library contains a huge application value, and mining association rules contained in the data is beneficial to improve the resources utilization and service level of library. Oriented to the actual situation of library borrowing management and the shortcomings of the classic Apriori algorithm, an improved Apriori algorithm based on Hash table (Apriori-Hash Algorithm) was proposed in this paper. Based on the Apriori algorithm, the proposed algorithm applied Hash function to generate frequent 2-item sets directly, and used Hash table to record different width of the transaction identifiers. So the location of transaction can be achieved quickly. Finally, the algorithm was applied to mine the borrowing data of library to verify that the given algorithm can not only improve mining efficiency, but also raise the utilization rate of resources and the personalized service level of library.
机译:图书馆的借用数据包含巨大的应用程序值,数据中包含的挖掘关联规则有利于提高图书馆的资源利用率和服务级别。面向图书馆借用管理的实际情况和经典APRIORI算法的缺点,本文提出了一种改进的基于哈希表(APRIORI-HASH算法)的APRIORI算法。基于APRiori算法,所提出的算法应用散列函数直接生成频繁的2项集,并使用哈希表记录事务标识符的不同宽度。所以交易的位置可以快速实现。最后,应用了算法对图书馆的借用数据进行了验证,验证给定的算法不能仅提高采矿效率,还可以提高资源的利用率和图书馆的个性化服务级别。

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利
获取原文

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号