基于随机游走和多样性图排序的个性化服务推荐方法

doi:10.3969/j.issn.0372-2112.2018.11.027

电子学报 ›› 2018, Vol. 46 ›› Issue (11): 2773-2780.DOI: 10.3969/j.issn.0372-2112.2018.11.027

基于随机游走和多样性图排序的个性化服务推荐方法

方晨^1,2, 张恒巍^1,2, 王娜¹, 王晋东^1,2

1. 信息工程大学, 河南郑州 450001;
2. 数字工程与先进计算国家重点实验室, 河南郑州 450001

收稿日期:2017-05-16 修回日期:2018-01-01 出版日期:2018-11-25
- 通讯作者:
- 张恒巍
- 作者简介:
- 方晨男,1993年出生于安徽宿松.现为信息工程大学研究生.主要研究方向为服务推荐、数据挖掘等.E-mail:17756230629@163.com;王娜女,1970年出生于河南郑州.现为信息工程大学副教授.主要研究方向为服务计算、信息安全等;王晋东 男,1966年出生于山西洪洞.现为信息工程大学教授.主要研究方向为云计算、网络攻防等.
- 基金资助:
- 国家自然科学基金 (No.61309013，No.61303074）; 河南省科技攻关计划项目 (No.12210231003）

Personalized Service Recommendation Method Based on Random Walk and Diversified Graph Ranking

FANG Chen^1,2, ZHANG Heng-wei^1,2, WANG Na¹, WANG Jin-dong^1,2

1.Information Engineering University, Zhengzhou, Henan 450001, China;
2.State Key Laboratory of Mathematical Engineering and Advanced Computing, Zhengzhou, Henan 450001, China

Received:2017-05-16 Revised:2018-01-01 Online:2018-11-25 Published:2018-11-25
- Corresponding author:
- ZHANG Heng-wei

摘要/Abstract

摘要： 针对传统服务推荐算法由于数据稀疏性而导致推荐准确性不高，以及推荐结果缺乏多样性等缺陷，提出基于随机游走和多样性图排序的个性化服务推荐方法（PRWDR）.在分析直接相似关系稀疏性的基础上提出带权重的随机游走模型，通过在用户网络上进行随机游走来挖掘更多的相似关系；基于所有相似用户预测服务的QoS值，并给出服务图模型构建方法，以过滤大量性能过低的候选服务；提出最优节点集合选取策略，利用贪婪算法得到兼具推荐准确性和功能多样性的服务推荐列表.在公开发布的数据集上进行实验，并与多个经典算法进行比较，验证了本算法的有效性.

关键词: 服务推荐, 数据稀疏性, 多样性, 随机游走模型

Abstract: In view of the low recommendation accuracy due to the sparseness of data, and the lack of diversity in traditional service recommendation algorithms, personalized service recommendation method based on random walking and diversified graph ranking (PRWDR) is proposed. On the basis of analyzing the sparseness of direct similarity relationships, a weighted random walk model is proposed, which can excavate more similarity relationships by random walk on the user network. The QoS value of services is predicted based on all similar users, and then the service graph model construction method is presented to filter those services with low performance. By using the greedy algorithm, the optimal node collection selection strategy is proposed to obtain the service recommendation list with both accuracy and diversity. By testing the algorithm on the public dataset and also comparing with several classic algorithms, the validity of PRWDR is verified.

Key words: service recommendation, data sparseness, diversity, random walk model

中图分类号:

TP393

方晨, 张恒巍, 王娜, 王晋东. 基于随机游走和多样性图排序的个性化服务推荐方法[J]. 电子学报, 2018, 46(11): 2773-2780.

FANG Chen, ZHANG Heng-wei, WANG Na, WANG Jin-dong. Personalized Service Recommendation Method Based on Random Walk and Diversified Graph Ranking[J]. Acta Electronica Sinica, 2018, 46(11): 2773-2780.

参考文献

[1] 龙军,袁鑫攀,桂卫华.基于环境感知的可信QoS评价与服务选取策略[J].电子学报,2012,40(6):1133-1140. LONG Jun,YUAN Xin-pan,GUI Wei-hua.A policy for the trusted QoS evaluation and service selection with environment aware[J].Acta Electronica Sinica,2012,40(6):1133-1140.(in Chinese)
[2] 胡堰,彭启民,胡晓惠.一种基于隐语义概率模型的个性化Web服务推荐方法[J].计算机研究与发展,2014,51(8):1781-1793. HU Yan,PENG Qi-min,HU Xiao-hui.A personalized web service recommendation method based on latent semantic probabilistic model[J].Journal of Computer Research and Development,2014,51(8):1781-1793.(in Chinese)
[3] Liu X,Fulia I.Incorporating user,topic,and service related latent factors into web service recommendation[A].Proceedings of the IEEE International Conference on Web Services[C].New Work:IEEE,2015.185-192.
[4] 郭弘毅,刘功申,等.融合社区结构和兴趣聚类的协同过滤推荐算法[J].计算机研究与发展,2016,53(8):1664-1672. GUO Hong-yi,LIU Gong-shen,et al.Collaborative filtering recommendation algorithm combining community structure and interest clusters[J].Journal of Computer Research and Development,2016,53(8):1664-1672.(in Chinese)
[5] Zhang B,Li H,et al.Improving web search results using affinity graph[A].Proceedings of the ACM SIGIR International Conference on Research & Development in Information Retrieval[C].New Work:ACM,2005.504-511.
[6] Tong H,He J,Wen Z,et al.Diversified rankingon large graphs:An optimization viewpoint[A].Proceedings of the ACM SIGKDD International Conference on Knowledge Discovery and Data Mining[C].New Work:ACM,2011.1028-1036.
[7] Li R H,Yu J X.Scalablediversified ranking on large graphs[J].IEEE Transactions on Knowledge & Data Engineering,2013,25(9):2133-2146.
[8] 俞春花,刘学军,李斌,等.基于上下文相似度和社会网络的移动服务推荐方法[J].电子学报,2017,45(6):1530-1536. YU Chun-hua,LIU Xue-jun,LI Bin,et al.Mobile service recommendation based on context similarity and social network[J].Acta Electronica Sinica,2017,45(6):1530-1536.(in Chinese)
[9] Bagci H,Karagoz P.Context-aware location recommendation by using a random walk-based approach[J].Knowledge and Information Systems,2016,47(2):241-260.
[10] Kang G,Liu J,Tang M,et al.AWSR:Active web service recommendation based on usage history[A].Proceedings of the International Conference on Web Services[C].Washington:IEEE Computer Society,2012.186-193.
[11] Maiya A S,Berger-Wolf T Y.Expansion and search in networks[A].Proceedings of the 19th ACM International Conference on Information and Knowledge Management[C].New York:ACM,2010.239-248.
[12] Grouplens.MovieLens[DB/OL].https://grouplens.org/datasets/movielens/.2017-12-31.
[13] Xie Q,Zhao S,Zheng Z,et al.Asymmetriccorrelation regularized matrix factorization for web service recommendation[A].Proceedings of the IEEE International Conference on Web Services[C].New Work:IEEE,2016.204-211.
[14] Aytekin T,Karakaya M Ö.Clustering-based diversity improvement in top-N recommendation[J].Journal of Intelligent Information Systems,2014,42(1):1-18.
[15] Usunier N,Usunier N,Grandvalet Y.Acoverage-based approach to recommendation diversity on similarity graph[A].Proceedings of the 10th ACM Conference on Recommender Systems[C].New York:ACM,2016.15-22.

基于随机游走和多样性图排序的个性化服务推荐方法

Personalized Service Recommendation Method Based on Random Walk and Diversified Graph Ranking

PDF

可视化

摘要/Abstract

引用本文

使用本文

参考文献

相关文章 15

编辑推荐

Metrics

[1]	杨洁, 朱咸军, 周献中, 柳毅. 基于混杂社会网络的个性化Web服务推荐方法[J]. 电子学报, 2020, 48(2): 341-349.
[2]	廖祝华, 张健, 刘毅志, 肖浩, 赵肄江, 刘建勋. 基于稀疏轨迹数据的出租车载客区域推荐[J]. 电子学报, 2020, 48(11): 2178-2185.
[3]	何杰光, 彭志平, 林伟豪, 崔得龙. 一种矩形邻域结构的教学优化算法[J]. 电子学报, 2019, 47(8): 1768-1775.
[4]	韩红桂, 武淑君. 基于收敛速度和多样性的多目标粒子群种群规模优化设计[J]. 电子学报, 2018, 46(9): 2263-2269.
[5]	陈志敏, 吴盘龙, 薄煜明, 田梦楚, 岳聪, 顾福飞. 基于自控蝙蝠算法智能优化粒子滤波的机动目标跟踪方法[J]. 电子学报, 2018, 46(4): 886-894.
[6]	韩红桂, 卢薇, 乔俊飞. 一种基于多样性信息和收敛度的多目标粒子群优化算法[J]. 电子学报, 2018, 46(2): 315-324.
[7]	曹玉莲, 李文锋, 张煜. 基于拟熵自适应启动局部搜索策略的混合粒子群算法[J]. 电子学报, 2018, 46(1): 110-117.
[8]	陈侃松, 阮玉龙, 戴磊, 兰智高, 邵建设. 区域分割的自适应变异粒子群算法[J]. 电子学报, 2017, 45(8): 1849-1855.
[9]	俞海珍, 汪鹏君, 张会红, 万凯. 基于三值多样性粒子群算法的MPRM电路综合优化[J]. 电子学报, 2017, 45(7): 1601-1607.
[10]	俞春花, 刘学军, 李斌, 章玮. 基于上下文相似度和社会网络的移动服务推荐方法[J]. 电子学报, 2017, 45(6): 1530-1536.
[11]	康世泽, 马宏, 黄瑞阳. 一种基于Opinosis图和马尔科夫随机游走模型的多文本情感摘要框架[J]. 电子学报, 2017, 45(12): 3005-3011.
[12]	周凌云, 丁立新, 彭虎, 强小利. 一种邻域重心反向学习的粒子群优化算法[J]. 电子学报, 2017, 45(11): 2815-2824.
[13]	吴昊, 孙晓燕, 郭玉堂, 刘路路, 沈晶. 保持粒子多样性的非退化粒子滤波方法研究[J]. 电子学报, 2016, 44(7): 1734-1741.
[14]	申元霞, 曾传华, 王喜凤, 汪小燕. 并行协作骨干粒子群优化算法[J]. 电子学报, 2016, 44(7): 1643-1648.
[15]	谢静, 张健沛, 杨静, 张冰. 基于属性相关性划分的多敏感属性隐私保护方法[J]. 电子学报, 2014, 42(9): 1718-1723.