首页> 外文会议>Proceedings of the 2007 International Conference on Machine Learning and Cybernetics >BOOK RECOMMENDATION SERVICE BY IMPROVED ASSOCIATION RULE MINING ALGORITHM
【24h】

BOOK RECOMMENDATION SERVICE BY IMPROVED ASSOCIATION RULE MINING ALGORITHM

机译:改进的协会规则挖掘算法预订推荐服务

获取原文

摘要

With the extensive application of database system, a mass-circulation historical data is accumulated in university library.We applied data mining technology for discovering useful knowledge in circulation data analysis.There are some shortcomings in mining association rules via Apriori algorithm.This paper introduces two methods for improving the efficiency of algorithm, such as filtrating basic item set, or ignoring the transaction records that are useless for frequent items generated.In order to meet the requirement of personal book recommendation service, we applied the improved algorithm to mine association rules from circulation records in university library.A service model is introduced, and may be used for offering recommendation information to the readers.The recommendation model can also be used in other fields, for example, bookstore, information retrieval system, network reference database, etc.
机译:随着数据库系统的广泛应用,在大学图书馆中积累了大循环历史数据。我们应用数据挖掘技术发现了循环数据分析中的有用知识。通过Apriori算法挖掘关联规则存在一些不足。本文介绍了两个诸如过滤基本项目集或忽略对频繁生成的项目无用的交易记录等提高算法效率的方法。为了满足个人图书推荐服务的需求,我们将改进的算法应用于挖掘关联规则。高校图书馆的发行记录,介绍了一种服务模型,可以用于向读者提供推荐信息,推荐模型还可以用于其他领域,例如书店,信息检索系统,网络参考数据库等。

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号