Please wait a minute...
J4  2013, Vol. 47 Issue (10): 1753-1757    DOI: 10.3785/j.issn.1008-973X.2013.10.008
自动化技术、电信技术     
基于用户阅读行为的图书自动评测算法
戴和忠1, 王秀昕2, 张磊3
1.浙江大学 管理学院,浙江 杭州 310058;2.浙江大学城市学院 商学院,浙江 杭州 310015; 3.北京邮电大学 网络与交换技术国家重点实验室,北京 100876
User behavior based automatic book rating algorithm
DAI He-zhong1, WANG Xiu-xin2, ZHANG lei3
1. School of Management, Zhejiang University, Hangzhou 310058, China; 2. School of Business, Zhejiang University City College, Hangzhou 310015, China; 3. State Key Laboratory of Networking and Switching Technology, Beijing University of Posts and Telecommunications, Beijing 100876,China
 全文: PDF  HTML
摘要:

针对图书质量较难量化的问题,以用户在阅读过程中的流失和留存数据为基础,对各个关键行为节点设置评测权重,通过用户阅读图书的深度来量化图书质量.在分析在线阅读平台特点的基础上,根据用户阅读图书深度到达的难度来量化用户的阅读行为,提出基于用户阅读行为的图书自动评测算法.图书的最终综合评测值考虑图书半衰期和用户分群对图书评分的影响,能够根据图书的多个评测指标对图书进行自动评测,帮助用户选择更符合自身喜好的图书,提高用户满意度和用户体验.

Abstract:

In order to tackle with the difficulty of book quality quantification, evaluation weight was set for each critical behavior node based on user’s churn/retention data in the reading process, and an automatic book rating method was presented based on users’ reading behavior. User segmentation was considered due to the difference of users’ behavior before and after the half-life of books. The daily score of each book was used to fine-tune the comprehensive score of books in order to differentiate the preference of user segmentations. The effectiveness of the algorithm was tested on a mobile reading platform which has tens of millions of readers. Results show that multiple indexes can automatically model the quality of books and help the users to find the book they like.

出版日期: 2013-10-01
:  C 93  
基金资助:

浙江省社科规划课题资助项目(12JCGL05YB).

通讯作者: 王秀昕,女,讲师.     E-mail: wangxiuxin@Zucc.edu.cn
作者简介: 戴和忠(1975—),男,博士生,高级经济师,从事电子商务、信息消费、产品创新等研究.E-mail: 13958080393@139.com
服务  
把本文推荐给朋友
加入引用管理器
E-mail Alert
RSS
作者相关文章  

引用本文:

戴和忠, 王秀昕, 张磊. 基于用户阅读行为的图书自动评测算法[J]. J4, 2013, 47(10): 1753-1757.

DAI He-zhong, WANG Xiu-xin, ZHANG lei. User behavior based automatic book rating algorithm. J4, 2013, 47(10): 1753-1757.

链接本文:

http://www.zjujournals.com/eng/CN/10.3785/j.issn.1008-973X.2013.10.008        http://www.zjujournals.com/eng/CN/Y2013/V47/I10/1753

[1] GEDIMINAS A, ALEXANDER T. Toward the next generation of recommender systems: a survey of the state-of-the-art and possible extensions [J]. IEEE Transactions on Knowledge and Data Engineering, 2005, 17(6): 734-749.

[2] 邓爱林,朱扬勇,施伯乐,基于项目评分预测的协同过滤推荐算法[J].软件学报,2003,14(9): 1621-1628.

DENG Ai-lin, ZHU Yang-yong, SHI Bo-le. Collaborative filtering algorithm based on item [J]. Journal of Software, 2003, 14(9): 1621-1628.

[3] 王茜,杨莉云.面向用户偏好的属性值评分分布协同过滤推荐算法[J].系统工程学报,2010, 25(4): 561-568.

WANG qian, YANG Li-yun. Collaborative filtering algorithm based on rating distribution of attributes faced user preference [J]. Journal of Systems Engineering, 2010, 25(4): 561-568.

[4] ISAAC S, SHILAD S. Rating: how difficult is it? [C] ∥Proceedings of the 5th ACM Conference on Recommender Systems. Washington: ACM, 2011: 149-156.

[5] HARPER F M, LI X, CHEN Y, et al. An economic model of user rating in an online recommender system [M]∥User Modeling. Berlin Heidelberg: Springer, 2005: 307-316.

[6] BENNETT J, LANNING S. The netflix prize [C]∥ Proceedings of KDD Cup and Workshop. California:[s. n.], 2007, 9(2): 51-52.

[7] BURTON R E, KEBLER R W. The “half-life” of some scientific and technical literatures [J]. American Document, 1960, 11(1): 18-22.

No related articles found!