| 基于Disconnected Apriori算法的图书馆书目推荐服务 |
| |
| 引用本文： | 邓奇强.基于Disconnected Apriori算法的图书馆书目推荐服务[J].图书情报工作,2011,55(5):109-112. |
| |
| 作者姓名： | 邓奇强 |
| |
| 作者单位： | 怀化学院图书馆,怀化,418008 |
| |
| 基金项目： | 湖南省高校图工委科研课题 |
| |
| 摘 要： | 介绍一种Apriori的改进算法,该算法通过寻找大于最小支持计数的最大频繁项集,可以直接得到最终频繁项集,将改进算法应用到图书馆书目推荐服务中,并对改进算法与Apriori算法进行算法的性能分析及实验数据的运行时间对比,实验证明改进算法在运行速度和挖掘性能上较经典Apriori算法有显著提高。
|
| 关 键 词： | 数据挖掘 Apriori算法 最大频繁项集 最终频繁项集 |
Bibliographic Recommendation Service based on Disconnected Apriori Algorithm |
| |
| Deng Qiqiang.Bibliographic Recommendation Service based on Disconnected Apriori Algorithm[J].Library and Information Service,2011,55(5):109-112. |
| |
| Authors: | Deng Qiqiang |
| |
| Institution: | Deng Qiqiang Library of Huaihua University,Huaihua 418008 |
| |
| Abstract: | This paper presents an improved Apriori algorithm.The algorithm can directly get the final frequent set by finding the maximum frequent set which is greater than the minimum support count,and can be applied to bibliographic recommendation service.Meanwhile,the paper makes a comparison of algorithm performance and running time of experimental data between disconnected Apriori algorithm and Apriori algorithm.The results show that disconnected Apriori algorithm than the Apriori algorithm has significantly impr... |
| |
| Keywords: | data mining Apriori algorithm maximum frequent set final frequent set |
| 本文献已被 CNKI 万方数据 等数据库收录！ |
