期刊文献+

基于谱聚类和隐语义模型的智能协同推荐方法 被引量:6

Intelligent collaborative recommendation method based on spectral clustering and latent factor model
下载PDF
导出
摘要 随着云计算及移动互联网技术的迅速发展,网络中可选服务信息呈爆炸性增长,信息过载问题日益严重。针对推荐系统中存在的数据稀疏性问题及冷启动问题,提出一种基于谱聚类和隐语义模型的智能协同推荐方法。该方法基于提取的用户标签特征信息,利用谱聚类算法对相似用户进行聚类,将原始高维评分矩阵转化为多个较低维的子评分矩阵。然后在子评分矩阵中利用隐语义模型对缺失评分进行局部预测。最后在获得缺失评分后利用改进的基于邻域的协同推荐算法对目标用户进行全局评分预测。所提算法有效解决了数据稀疏性问题和冷启动问题,在提高预测准确度的同时加快了推荐算法效率。 With the rapid development of cloud computing and mobile Internet technique,the amount of cloud offers and online information has been growing explosively,which yields information overload.To deal with the data sparsity problem and the cold start problem in recommender systems,an intelligent collaborative recommendation method based on spectral clustering and latent factor model was proposed.Similar users were clustered with the spectral clustering scheme according to the label features of users.The original rating matrix was transformed into multiple low-dimensional sub-matrix where the factorization-based latent factor model was employed to predict the missing data locally.Afterwards,the final predictions could be made globally based on the improved neighbor-based collaborative recommendation algorithm.The proposed method was effective in dealing with the data sparsity problem and the cold start problem.Experimental results validated that the proposed method was improved in recommendation accuracy and efficiency.
作者 高子建 张晗睿 窦万春 徐江民 孟顺梅 GAO Zijian;ZHANG Hanrui;DOU Wanchun;XU Jiangmin;MENG Shunmei(Department of Computer Science and Engineering, Nanjing University of Science and Technology, Nanjing 210094, China;State Key Laboratory for Novel Software Technology, Nanjing University, Nanjing 210023, China)
出处 《计算机集成制造系统》 EI CSCD 北大核心 2021年第9期2517-2524,共8页 Computer Integrated Manufacturing Systems
基金 国家自然科学基金资助项目(61702264) 南京理工大学自主科研专项计划基金资助项目(30919011282) 中国博士后科学基金面上资助项目(2019M651835)。
关键词 协同推荐 谱聚类 隐语义模型 矩阵分解 collaborative recommendation spectral clustering latent factor model matrix factorization
  • 相关文献

参考文献15

二级参考文献201

  • 1周军锋,汤显,郭景峰.一种优化的协同过滤推荐算法[J].计算机研究与发展,2004,41(10):1842-1847. 被引量:102
  • 2Jain A, Murty M, Flynn P. Data clustering.. A Review[J]. ACM Computing Surveys, 1999,31 (3) : 264-323.
  • 3Fiedler M. Algebraic connectivity of graphs. Czech, Math. J. , 1973,23: 298-305.
  • 4Malik J,Belongie S,Leung T, et al. Contour and texture analysis for image segmentation In Perceptual Organization for Artificial Vision Systems. Kluwer, 2000.
  • 5Weiss Y. Segmentation using eigenvectors: A unified view//International Conference on Computer Vision 1999.
  • 6Shi J,Malik J. Normalized cuts and image segmentation. IEEE Transactions on Pattern Analysis and Machine Intelligence, 2000,22 (8) : 888-905.
  • 7Wu Z, Leahy R. An optimal graph theoretic approach to data clustering: theory and its application to image segmentation [J]. IEEE Trans on PAMI,1993, 15(11):1101-1113.
  • 8Hagen L, Kahng A 13. New spectral methods for ratio cut partitioning and clustering. IEEE Trans. Computer-Aided Design, 1992,11 (9) : 1074-1085.
  • 9Sarkar S, Soundararajan P. Supervised learning of large perceptual organization: Graph spectral partitioning and learning automata. IEEE Transaction on Pattern Analysis and Machine Intelligence, 2000,22(5) : 504- 525.
  • 10Ding C, He X, Zha H, et al. Spectral Min Max cut for Graph Partitioning and Data Clustering[C]//Proc. of the IEEE Intl Conf. on Data Mining. 2001 : 107-114.

共引文献910

同被引文献82

引证文献6

二级引证文献4

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

内容加载中请稍等...
;
使用帮助 返回顶部