###
DOI:
计算机系统应用英文版:2015,24(12):196-203
本文二维码信息
码上扫一扫!
基于有向图分割的推荐算法
(福建师范大学数学与计算机科学学院, 福州 350007)
Recommendation Algorithm Based on the Partition of Directed Graph
(School of Mathematics and Computer Science, Fujian Normal University, Fuzhou 350007, China)
摘要
图/表
参考文献
相似文献
本文已被:浏览 2267次   下载 2867
Received:April 08, 2015    Revised:May 28, 2015
中文摘要: 利用资源分配的原理提出一个基于有向图分割的推荐算法.通过二部图网络结构与资源分配方法的结合,建立了物品间关系的有向图,再利用非对称非负矩阵分解(Asymmetric Nonnegative Matrix Factorization, ANMF)分割此有向图,并将物品根据分割结果得出的物品间关联关系进行分类,并以此设置物品间的关联权重,最终实现对用户的Top-N物品推荐方案.实验结果表明,提出的算法提高了推荐准确率,并且能在一定程度上提高推荐多样性,降低推荐物品的流行性.
中文关键词: 推荐算法  有向图  ANMF  推荐权重
Abstract:By using the principle of resource allocation, we propose a recommendation algorithm which is based on the partition of directed graph. The items directed graph is established by combining with the bipartite graphs network structure and resource allocation method, and is partitioned by the method of Asymmetric Nonnegative Matrix Factorization. Then we classify items by the relationship between them, set connection weights between the items and implement a recommendation from the Top-N items to the user. Experimental results show that the proposed algorithm can improve the recommendation accuracy and the recommendation diversity, and reduce the popularity of recommendation to a certain extent.
文章编号:     中图分类号:    文献标志码:
基金项目:
引用文本:
黄波,严宣辉,林建辉.基于有向图分割的推荐算法.计算机系统应用,2015,24(12):196-203
HUANG Bo,YAN Xuan-Hui,LIN Jian-Hui.Recommendation Algorithm Based on the Partition of Directed Graph.COMPUTER SYSTEMS APPLICATIONS,2015,24(12):196-203