一种社交网络群组间信息推荐的有效方法  

An Efficient Algorithm of Information Recommendation Between Groups in Social Networks

作　　者：黄震华[1,2] 张波[3] 方强[1] 向阳[1] 

机构地区：[1]同济大学计算机科学与工程系,上海201804 [2]同济大学嵌入式系统与服务计算教育部重点实验室,上海201804 [3]上海师范大学信息与机电工程学院,上海200234

出　　处：《电子学报》2015年第6期1090-1093,共4页Acta Electronica Sinica

基　　金：国家自然科学基金(No.61272268;No.61103069;No.71171148);教育部新世纪优秀人才支持计划(No.NCET-12-0413);霍英东教育基金会应用研究课题(No.142002)

摘　　要：群组间信息推荐是社交网络中人们传递和分享资讯的重要途径,然而获取精确的最优推荐方案需要指数级时间开销.为此,本文提出一种有效算法EAOORS(Efficient Algorithm for Obtaining Optimal Recommendation Solution),将该指数级时间开销问题等价归约为EST(Extended Steiner Tree,扩展Steiner树)问题,并在多项式时间复杂度内快速获取近似最优推荐方案.理论分析和仿真实验表明,本文所提的算法具有有效性和实用性.Information recommendation between groups is one of the most important ways for information sharing and transmitting in social networks. However,it needs exponential time cost to achieve the exact optimal recommendation solution. Hence this paper proposed an efficient algorithm EAOORS（ Efficient Algorithm for Obtaining Optimal Recommendation Solution） which equivalently reduced this exponential time cost problem to extended steiner tree problem,and fast achieved the approximate optimal recommendation solution in the polynomial time complexity. The experimental result shows that the EAOORS algorithm is more efficient than the existing ones.

关 键 词：社交网络 信息推荐 近似算法 性能评估 

分 类 号：TP393[自动化与计算机技术—计算机应用技术]