| 基于关联规则的图书馆个性化服务研究 |
| |
| 引用本文： | 苏坤. 基于关联规则的图书馆个性化服务研究[J]. 农业图书情报学刊, 2010, 22(6): 246-249 |
| |
| 作者姓名： | 苏坤 |
| |
| 作者单位： | 南京工业职业技术学院图书馆,江苏,南京,210046 |
| |
| 摘 要： | 关联规则挖掘技术是一种新兴的数据处理技术,其算法及应用在图书馆中起着非常重要的作用。Apriori算法是关联规则挖掘的经典算法,在分析Apriori算法的基础上,提出利用FP-tree生成树技术来减少候选集的数量,克服Apriori算法的弱点,以提高图书馆个性化服务的效率。
|
| 关 键 词： | 关联规则 Apriori算法 个性化服务 |
Study on Library Individualized Service Based on Association Rule |
| |
| SU Kun. Study on Library Individualized Service Based on Association Rule[J]. Journal of Library and Information Sciences in Agriculture, 2010, 22(6): 246-249 |
| |
| Authors: | SU Kun |
| |
| Affiliation: | Library/a>;Nanjing Vocational College of Industrial Technology/a>;Nanjing 210046/a>;China |
| |
| Abstract: | Association rule mining technology is a new information process technology,its algorithm and application plays a very important role in the library.The Apriori algorithm is a classical method of association rules mining,Based on analysis of this theory,the paper puts forward with algorithm combines FP-Tree technique and reduction of candidate item sets to enhance the efficiency of individualized service of the library. |
| |
| Keywords: | Association rule Apriori algorithm Individualized service |
| 本文献已被 CNKI 维普 万方数据 等数据库收录！ |
