|
|
A Fast Personalized Bibliographic Recommendation Method |
Xu Jiali1 Chen Jia2 |
1(School of Electronic and Information Engineering, Chengdu University,Chengdu 610106,China)
2(School of Computer Science and Engineering, University of Electronic Science and Technology of China, Chengdu 610054,China) |
|
|
Abstract Aimed at the shortcomings of the bibliographic recommended methods in digital library, a Fast Personalized Bibliographic Recommendation Method(FPBRM) is proposed. By using the technologies of matrix vector and compression, the method improves Apriori algorithm that it can enhance the efficiency of data mining.Then the correlation between the books can be mined from the loan records by using the Improved Apriori Algorithm(IAA),which can provide personalized bibliographic recommendation for the readers. Finally,the simulation results show the effectiveness of the method.
|
Received: 09 January 2010
Published: 25 February 2010
|
|
Corresponding Authors:
Xu Jiali
E-mail: lotussunnyx@163.com
|
About author:: Xu Jiali,Chen Jia |
[1] 钱力.数字图书馆个性化信息服务系统的研究与设计[D].北京:首都师范大学,2008.
[2] 陈定权,朱维凤.关联规则与图书馆书目推荐[J].情报理论与实践,2009,32(6):81-84.
[3] 彭仪普,熊拥军.关联挖掘在文献借阅历史数据分析中的应用[J].情报杂志,2005,24(8):40-44.
[4] 蔡会霞,朱洁,蔡瑞英.关联规则的数据挖掘在高校图书馆系统中的应用[J].南京工业大学学报,2005,27(1):85-88.
[5] 朱明.数据挖掘[M].合肥:中国科学技术大学出版社,2002:107-108.
[6] 王燕,温有奎.基于关联规则的推荐系统在数字图书馆中的应用[J].情报科学,2007,25(6):877-880.
[7] 陆觉民,郑宇.数据挖掘技术的改进在图书馆个性化服务中的应用[J].现代图书情报技术,2006(8):65-68.
[8] 姜志英.基于数据挖掘的数字图书馆个性化推荐算法研究[D].秦皇岛:燕山大学,2007.
[9] 张素兰.一种基于事务压缩的关联规则优化算法[J].计算机工程与设计,2006,27(18):3450-3453.
[10] 徐嘉莉.一种基于矩阵压缩的Apriori优化算法[J].微计算机信息,2009,25(12):213-215. |
|
Viewed |
|
|
|
Full text
|
|
|
|
|
Abstract
|
|
|
|
|
Cited |
|
|
|
|
|
Shared |
|
|
|
|
|
Discussed |
|
|
|
|