基于主题的Web文本聚类方法

doi:10.11772/j.issn.1001-9081.2014.11.3140

计算机应用 ›› 2014, Vol. 34 ›› Issue (11): 3140-3143.DOI: 10.11772/j.issn.1001-9081.2014.11.3140

• 2014年全国开放式分布与并行计算学术年会(DPCS 2014)论文 • 上一篇下一篇

基于主题的Web文本聚类方法

王雪霞,李青,李季红

上海大学计算机工程与科学学院,上海 200444

收稿日期:2014-07-16 修回日期:2014-07-30 出版日期:2014-11-01 发布日期:2014-12-01
通讯作者: 王雪霞
作者简介:王雪霞(1988-),女,山东烟台人,硕士研究生,主要研究方向:推荐系统、复杂网络;李青(1962-),男,湖北嘉鱼人,教授,博士生导师,CCF会员,主要研究方向:并行计算、复杂网络、复杂系统建模、计算机模拟;李季红(1987-),男,浙江杭州人,硕士,主要研究方向:并行计算、推荐系统。

Collaborative filtering recommendation based on number of common items and common rating interest of users

WANG Xuexia,LI Qing,LI Jihong

School of Computer Engineering and Science, Shanghai University, Shanghai 200444, China

Received:2014-07-16 Revised:2014-07-30 Online:2014-11-01 Published:2014-12-01
Contact: WANG Xuexia

摘要/Abstract

摘要：

在推荐系统中,为了在一定程度上减少用户评分数据稀疏对推荐效果的负面影响,提出了一种基于用户共同评分项目数和用户兴趣的协同过滤推荐算法。此算法将用户共同评分项目数和用户兴趣相似度相结合,使用户之间的相似度计算更加准确,为目标用户提供更好的推荐结果。仿真实验结果表明:所提算法比基于Pearson相似度计算方法的算法推荐效果更优，具有更小的平均绝对误差(MAE),表明了其有效性和可行性。

Abstract:

In order to reduce the negative impacts of sparse data, a new collaborative filtering recommendation algorithm was put forward based on the number of common rating items among users and the similarity of user interests. The similarity calculations were made to be more credible by combing the number of common rating items among users with the similarity of user interests, so as to provide better recommendation results for the target user. Compared with the method based on Pearson similarity, the new algorithm provides better recommendation results with smaller Mean Absolute Error (MAE). In conclusion, the new algorithm is effective and feasible.

中图分类号:

TP301.6

王雪霞李青李季红. 基于主题的Web文本聚类方法[J]. 计算机应用, 2014, 34(11): 3140-3143.

WANG Xuexia LI Qing LI Jihong. Collaborative filtering recommendation based on number of common items and common rating interest of users[J]. Journal of Computer Applications, 2014, 34(11): 3140-3143.

参考文献

[1]ZHANG X. Search engine technology and research [J]. Modern Information, 2004,24(4):142-146.(张兴华.搜索引擎技术及研究[J].现代情报,2004,24(4): 142-146.)
[2]ADOMAVICIUS G, TUZHILIN A. Toward the next generation of recommender system: a survey of the state-of-the-art and possible extensions [J]. IEEE Transactions on Knowledge and Data Engineering, 2005, 17(6):734-749.
[3]LI Y, WU C, LAI C. A social recommender mechanism for e-com-merce: Combining similarity, trust and relationship [J]. Decision
Support Systems, 2013, 55(3):740-752.
[4]HERLOCKER L J, KONSTAN A J, RIEDL T J. An empirical analysis of design choices in neighborhood-based collaborative filtering algorithms [J]. Information Retrieval, 2002, 5(4):287-310.
[5]BOBADILLA J, ORTEGA F, HERNANDO A, et al. A collaborative filtering approach to mitigate the new user cold start problem [J]. Knowledge-Based Systems, 2012, 26: 225-238.
[6]BOBADILLA J, ORTEGA F, HERNANDO A, et al. Improving collaborative filtering recommender system results and performance using genetic algorithms [J]. Knowledge-Based Systems, 2011, 24: 1310-1316.
[7]MASSA P, AVESANI P. Trust-aware collaborative filtering for recommender systems[C]// Proceedings of the 2004 OTM Confederated International Conferences on the Move to Meaningful Internet Systems: CoopIS, DOA, and ODBASE, LNCS 3290. Berlin: Springer-Verlag, 2004: 492-508.
[8]MASSA P, AVESANI P. Trust metrics on controversial users: balancing between tyranny of the majority and echo chambers [J]. International Journal on Semantic Web and Information Systems, 2007, 3(1): 39-64.
[9]WANG X, LI X, CHEN G. Complex network theory and its application [M]. Beijing: Tsinghua University Press, 2006:18-46.(汪小帆,李翔,陈关荣. 复杂网络理论及其应用[M].北京:清华大学出版社,2006:18-46.)
[10]ZHAO X, NIU Z, CHEN W. Interest before liking: two-step recommendation approaches [J]. Knowledge-Based Systems, 2013, 48: 46-56.
[11]GAN M, JIANG R. Improving accuracy and diversity of personalized recommendation through power law adjustments of user similarities [J]. Decision Support Systems, 2013, 55(3): 811-821.
[12]LL, MEDO M, YEUNG H C, et al. Recommender systems [J]. Physics Reports, 2012,519(1): 1-49.
[13]XIANG L. Researches on the key technologies of dynamic recommendation system [D]. Beijing: Chinese Academy of Sciences, 2009.(项亮. 动态推荐系统关键技术研究[D].北京:中国科学院,2009.)

[1]	肖智豪胡志华朱琳. 求解冷链物流时间依赖型车辆路径问题的混合自适应大邻域搜索算法[J]. 计算机应用, 0, (): 0-0.
[2]	沙林秀，聂凡，高倩，孟号. 基于布朗运动与梯度信息的交替优化算法[J]. 计算机应用, 0, (): 0-0.
[3]	董永峰孙跃华高立超韩鹏季海鹏. 基于改进一维卷积和双向长短期记忆神经网络的故障诊断方法[J]. 计算机应用, 0, (): 0-0.
[4]	李大海刘庆腾艾志刚王振东. 基于动态D向分割和混沌扰动的阴阳对算法[J]. 计算机应用, 0, (): 0-0.
[5]	雷鹰郑万波魏嵬夏云霓李晓波刘诚武谢洪. 基于概率性能感知演化博弈策略的混合“云+边”环境中任务卸载方法 [J]. 计算机应用, 0, (): 0-0.
[6]	乔钢柱王瑞孙超利. 基于分解的高维多目标改进进化算法[J]. 计算机应用, 0, (): 0-0.
[7]	朱诚潘旭华张勇. 基于趋化校正的哈里斯鹰优化算法[J]. 计算机应用, 0, (): 0-0.
[8]	平凡汤小春潘彦宇李战怀. 不规则任务在图形处理器集群上的调度策略[J]. 计算机应用, 0, (): 0-0.
[9]	杨杰张名扬芮晓彬王志晓. 融合节点覆盖范围和结构洞的影响力最大化算法[J]. 计算机应用, 0, (): 0-0.
[10]	汤安迪, 韩统, 徐登武, 谢磊. 混沌精英哈里斯鹰优化算法[J]. 计算机应用, 2021, 41(8): 2265-2272.
[11]	李蒙蒙, 秦伟, 刘艺, 刁兴春. 结合头脑风暴优化的混合蚁群优化算法[J]. 计算机应用, 2021, 41(8): 2412-2417.
[12]	张闻强, 邢征, 杨卫东. 基于多区域采样策略的混合粒子群优化求解多目标柔性作业车间调度问题[J]. 计算机应用, 2021, 41(8): 2249-2257.
[13]	张祥飞, 鲁宇明, 张平生. 基于协同进化的约束多目标优化算法[J]. 计算机应用, 2021, 41(7): 2012-2018.
[14]	张萌, 李维华. 用户互动表示下的影响力最大化算法[J]. 计算机应用, 2021, 41(7): 1964-1969.
[15]	王宇, 刘燕丽, 陈劭武. 基于顶点冲突学习的最大公共子图算法[J]. 计算机应用, 2021, 41(6): 1756-1760.

基于主题的Web文本聚类方法

Collaborative filtering recommendation based on number of common items and common rating interest of users

PDF

可视化

摘要/Abstract

引用本文

使用本文

参考文献

相关文章 15

编辑推荐

Metrics