广义关联规则挖掘技术在图书馆新书推荐服务中的应用研究.pdfVIP

摘要 网络经济与信息技术的发展，使得高校图书馆的服务空间日益扩大，个性化 信息服务也逐渐成为新型服务模式的主流。新书推荐是图书馆为读者提供个性化 信息服务的一个重要方面，新书推荐服务改变传统图书馆被动服务方式，能根据 用户的兴趣偏好主动地向用户推荐图书。 本文对广义关联规则和多最小支持度关联规则等挖掘算法进行了研究和分 析，发现这些算法无法很好满足图书馆新书推荐服务关联规则挖掘的需求。针对 图书馆新书推荐服务的特点，本文基于 MMS_Cumulate 算法和 GP-Apriori 算法 设计了 BASIC 算法，但 BASIC 算法性能较低，接下来对 BASIC 算法进行分析 改进提出了 MAR_LCR 算法，该算法不仅能挖掘形如“读者- 图书”的广义关联 规则，允许用户能为不同的项设置不同的最小支持度，而且性能有了较大的提高。 我们用虚拟数据对 MAR_LCR 算法作性能评估，结果证明 MAR_LCR 算法是很 有效的。接下来本文讨论如何确定借阅记录中与借阅图书类型相关的读者属性并 应用 MAR_LCR 算法对借阅记录进行关联规则的挖掘。最后本文定义了规则的 兴趣度度量方法并提出了去除无趣规则的算法。 关键字：广义关联规则；多最小支持度；图书馆；信息服务；新书推荐 I Abstract Recommending new books plays an important role in providing personalization information service for readers which changes the passive service means to an active one by recommending new books according to reader’s profile. After investigating conventional Generalized Association Rule mining algorithms, it is found that these algorithms are unable to satisfy the demand of association rule mining for the library new book recommendation. Therefore, a BASIC algorithm based on the MMS_Cumulate and GP-Apriori algorithm according to the characteristics of library new book recommendation is proposed first which is not very fast. Then based on the BASIC algorithm, a novel algorithm is presented, namely, MAR_LCR which is capable of finding generalized association rules in the form of patron-book and allowing users to specify multiple minimum supports to different items. Synthetic dataset is used to evaluate the performance of MAR_LCR algorithm. Experimental result shows that the algorithm is very effective. A discussion is made on how to identify relevant reader attributes in regard of the books they checked out and MAR_LCR algorithm is a