计算机科学 ›› 2018, Vol. 45 ›› Issue (11A): 398-401.

• 大数据与数据挖掘 • 上一篇    下一篇

基于PageRank和谱方法的个性化推荐算法

常家伟, 戴牡红   

  1. 湖南大学信息科学与工程学院 长沙410082
  • 出版日期:2019-02-26 发布日期:2019-02-26
  • 通讯作者: 戴牡红(1964-),男,硕士生,研究员,主要研究方向为数据科学,E-mail:dmh@hnu.edu.cn
  • 作者简介:常家伟(1992-),男,硕士生,主要研究方向为数据挖掘,E-mail:1106573682@qq.com
  • 基金资助:
    本文受湖南省自然科学基金(2015JJ2027)资助。

Personalized Recommendation Algorithm Based on PageRank and Spectral Method

CHANG Jia-wei, DAI Mu-hong   

  1. College of Information Science and Engineering,Hunan University,Changsha 410082,China
  • Online:2019-02-26 Published:2019-02-26

摘要: 传统的PageRank推荐算法的可扩展性较差。针对这一问题,提出融合PageRank和谱方法的个性化推荐算法。通过在PageRank算法迭代过程中加入候选集节点数来控制迭代的次数,同时利用阈值来修剪参与迭代的节点个数,从而得到候选节点集;采用谱聚类对候选集进行排序,归一化候选节点邻接矩阵,使用矩阵的特征值与特征向量来评估图中节点与目标节点之间的距离,从而产生最终的推荐列表。实验结果表明,所提推荐算法在保证推荐质量的前提下,提高了处理效率。

关键词: PageRank, 谱聚类, 推荐系统

Abstract: Traditional PageRank recommendation algorithm is less scalable.To solve this problem,a personalized recom-mendation algorithm based on PageRank and spectral method was proposed.The number of iterations is controlled by adding the number of nodes in the PageRank algorithm to obtain the candidate set,threshold is ued to trim the number of nodes participating in the iteration to get the candidate node set.Spectral clustering is utilized to sort the candidate nodes.The candidate node adjacency matrix is normalized,and eigenvalues and eigenvectors of matrices are used to eva-luate the distance between nodes and target nodes in a graph.At last,a final list of recommendations is produced.Experi-mental results show that the proposed recommendation algorithm improves the processing efficiency on the premise of ensuring the recommendation quality.

Key words: PageRank, Recommendation system, Spectral clustering

中图分类号: 

  • TP311.5
[1]阮光册,夏磊.互联网推荐系统研究综[J].情报学报,2015,34(9):999-1008.
[2]ADOMAVICIUS G,TUZHILIN A.Toward the next generation of recommender systems:A survey of the state-of-the-art and possible extensions[J].IEEE Transactions on Knowledge & Data Enineering,2005,17(6):734-749.
[3]PAGE L.The PageRank citation ranking:Bringing order to the web[J].Stanford Digital Libraries Working Paper,1998,9(1):1-14.
[4]HAVELIWALA T H.Topic-Sensitive PageRank:A Context-Sensitive Ranking Algorithm for Web Search[J].IEEE Educational Activities Department,2003,15(4):784-796.
[5]TONG H H,FALOUTSOS C,PAN J Y.Fast Random Walk with Restart and Its Applications[C]∥Proceedings of the Sixth International Conference on Data Mining(ICDM 06).IEEE Computer Society,2006:613-622.
[6]HERLOCKER J L,KONSTAN J A,TERVEEN L G,et al. Evaluating collaborative filtering recommender systems[J].2004,22(1):5-53.
[7]BOBADILLA J,SERRADILLA F.A new collaborative filtering metric that improves the behavior of recommender systems [J].Knowledge-Based Systems,2010,23(6):520-528.
[8]王成,朱志刚,张玉侠,等.基于用户的协同过滤算法的推荐效率和个性化改进[J].小型微型计算机系统,2016,37(3):428-432.
[9]VINODHINI S,RAJALAKSHMI V,GOVINDARAJULU B. Building Personalised Recommendation System With Big Data and Hadoop Mapreduce [J].Metabolism Clinical & Experimental,2009,58(1):38-46.
[10]RODRIGUES C M,RATHI S,PATIL G.An efficient system using item & user-based CF techniques to improve recommendation[J].International Conference on Next Generation Computing Technologies,2017,10(1):569-574.
[11]LIAO C L,LEE S J.A clustering based approach to improving the efficiency of collaborative filtering recommendation [J].Electronic Commerce Research & Applications,2016,18:1-9.
[12]FERNNDEZ P.Google’s pagerank and beyond:The science of search engine rankings[J].Mathematical Intelligencer,2008,30(1):68-69.
[13]BRIN S,PAGE L.The anatomy of a large-scale hypertextual Web search engine[J].International Conference on World Wide Web,1998,56(18):107-117.
[14]ANDERSON R,FAN C,LANG K.Local Graph Partitioning using PageRank Vectors[J].IEEE Symposium on Foundations of Computer Science,2006,47(5):475-486.
[15]SPIELMAN D,TENG S H.Nearly-linear time algorithms for graph partitioning,graphsparsification,and solving linear systems[J].Data Structures and Algorithms,2004,2(3):81-90.
[16]FERRAGINA P.A personalized search engine based on web-snippet hierarchical clustering[J].Software Practice & Expe-rience,2010,38(2):189-225.
[17]VERMA D,MEILA M.A comparison of spectral clustering algorithms[D].Washington:University of Washington,1997.
[18]SHI J,MALIK J.Normalized cuts and image segmentation[J].IEEE Transactions on Pattern Analysis and Machine Intelligence,2000,22(8):888-905.
[19]KANNAN R,VEMPALA S,VETA A.On clusterings-good, bad and spectral[C]∥Proceedings of the IEEE Symposium on Foundations of Computer Science.2000:367-377.
[1] 程章桃, 钟婷, 张晟铭, 周帆.
基于图学习的推荐系统研究综述
Survey of Recommender Systems Based on Graph Learning
计算机科学, 2022, 49(9): 1-13. https://doi.org/10.11896/jsjkx.210900072
[2] 王冠宇, 钟婷, 冯宇, 周帆.
基于矢量量化编码的协同过滤推荐方法
Collaborative Filtering Recommendation Method Based on Vector Quantization Coding
计算机科学, 2022, 49(9): 48-54. https://doi.org/10.11896/jsjkx.210700109
[3] 秦琪琦, 张月琴, 王润泽, 张泽华.
基于知识图谱的层次粒化推荐方法
Hierarchical Granulation Recommendation Method Based on Knowledge Graph
计算机科学, 2022, 49(8): 64-69. https://doi.org/10.11896/jsjkx.210600111
[4] 方义秋, 张震坤, 葛君伟.
基于自注意力机制和迁移学习的跨领域推荐算法
Cross-domain Recommendation Algorithm Based on Self-attention Mechanism and Transfer Learning
计算机科学, 2022, 49(8): 70-77. https://doi.org/10.11896/jsjkx.210600011
[5] 帅剑波, 王金策, 黄飞虎, 彭舰.
基于神经架构搜索的点击率预测模型
Click-Through Rate Prediction Model Based on Neural Architecture Search
计算机科学, 2022, 49(7): 10-17. https://doi.org/10.11896/jsjkx.210600009
[6] 齐秀秀, 王佳昊, 李文雄, 周帆.
基于概率元学习的矩阵补全预测融合算法
Fusion Algorithm for Matrix Completion Prediction Based on Probabilistic Meta-learning
计算机科学, 2022, 49(7): 18-24. https://doi.org/10.11896/jsjkx.210600126
[7] 蔡晓娟, 谭文安.
一种改进的融合相似度和信任度的协同过滤算法
Improved Collaborative Filtering Algorithm Combining Similarity and Trust
计算机科学, 2022, 49(6A): 238-241. https://doi.org/10.11896/jsjkx.210400088
[8] 何亦琛, 毛宜军, 谢贤芬, 古万荣.
基于点割集图分割的矩阵变换与分解的推荐算法
Matrix Transformation and Factorization Based on Graph Partitioning by Vertex Separator for Recommendation
计算机科学, 2022, 49(6A): 272-279. https://doi.org/10.11896/jsjkx.210600159
[9] 洪志理, 赖俊, 曹雷, 陈希亮, 徐志雄.
基于遗憾探索的竞争网络强化学习智能推荐方法研究
Study on Intelligent Recommendation Method of Dueling Network Reinforcement Learning Based on Regret Exploration
计算机科学, 2022, 49(6): 149-157. https://doi.org/10.11896/jsjkx.210600226
[10] 郭亮, 杨兴耀, 于炯, 韩晨, 黄仲浩.
基于注意力机制和门控网络相结合的混合推荐系统
Hybrid Recommender System Based on Attention Mechanisms and Gating Network
计算机科学, 2022, 49(6): 158-164. https://doi.org/10.11896/jsjkx.210500013
[11] 熊中敏, 舒贵文, 郭怀宇.
融合用户偏好的图神经网络推荐模型
Graph Neural Network Recommendation Model Integrating User Preferences
计算机科学, 2022, 49(6): 165-171. https://doi.org/10.11896/jsjkx.210400276
[12] 余皑欣, 冯秀芳, 孙静宇.
结合物品相似性的社交信任推荐算法
Social Trust Recommendation Algorithm Combining Item Similarity
计算机科学, 2022, 49(5): 144-151. https://doi.org/10.11896/jsjkx.210300217
[13] 陈壮, 邹海涛, 郑尚, 于化龙, 高尚.
基于用户覆盖及评分差异的多样性推荐算法
Diversity Recommendation Algorithm Based on User Coverage and Rating Differences
计算机科学, 2022, 49(5): 159-164. https://doi.org/10.11896/jsjkx.210300263
[14] 陈晋鹏, 胡哈蕾, 张帆, 曹源, 孙鹏飞.
融合时间特性和用户偏好的卷积序列化推荐
Convolutional Sequential Recommendation with Temporal Feature and User Preference
计算机科学, 2022, 49(1): 115-120. https://doi.org/10.11896/jsjkx.201200192
[15] 詹皖江, 洪植林, 方路平, 吴哲夫, 吕跃华.
基于对抗性学习的协同过滤推荐算法
Collaborative Filtering Recommendation Algorithm Based on Adversarial Learning
计算机科学, 2021, 48(7): 172-177. https://doi.org/10.11896/jsjkx.200600077
Viewed
Full text


Abstract

Cited

  Shared   
  Discussed   
No Suggested Reading articles found!