1. Department of Computer and Technology, Tongji University, Shanghai 201804, China;
2. The Key Laboratory of Embedded System and Service Computing, Ministry of Education, Tongji University, Shanghai 201804, China;
3. College of Information, Mechanical and Electrical Engineering, Shanghai Normal University, Shanghai 200234, China
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.
黄震华, 张波, 方强, 向阳. 一种社交网络群组间信息推荐的有效方法[J]. 电子学报, 2015, 43(6): 1090-1093.
HUANG Zhen-hua, ZHANG Bo, FANG Qiang, XIANG Yang. An Efficient Algorithm of Information Recommendation Between Groups in Social Networks. Chinese Journal of Electronics, 2015, 43(6): 1090-1093.
[1] S Cohen, L Ebel, B Kimelfeld.Asocial network database that learns how to answer queries[A].Proceedings of the Biennial Conference on Innovative Data Systems Research[C].Asilomar:ACM Press, 2013.1-4.
[2] SP Borgatti, A Mehra, DJ Brass, G Labianca.Network analysis in the social sciences[J].Science, 2009, 323(5916):892-895.
[3] SAmershi, J Fogarty, D Weld.Regroup:interactive machine learning for on-demand group creation in social networks[A].Proceedings of the SIGCHI Conference on Human Factors in Computing Systems[C].Austin:ACM Press, 2012.21-30.
[4] L Backstrom, D Huttenlocher, J Kleinberg, X Lan.Group formation in large social networks:membership, growth, and evolution[A].Proceedings of the 12th International Conference on Knowledge Discovery and Data Mining[C].Philadelphia:ACM Press, 2006.44-54.
[5] A Patil, J Liu, J Gao.Predicting group stability in online social networks[A].Proceedings of the 22nd International Conference on World Wide Web[C].Rio:ACM Press, 2013.1021-1030.
[6] 冷作福.基于贪婪优化技术的网络社区发现算法研究[J].电子学报, 2014, 42(4):723-729. ZF Leng.Community detection in complex networks based on greedy optimization[J].Acta Electronica Sinica, 2014, 42(4):723-729.(in Chinese)
[7] A Mislove, M Marcon, P Gummadi, B Bhattacharjee.Measurement and analysis of online social networks[A].Proceedings of the 7th ACM SIGCOMM Conference on Internet Measurement[C].Kyoto:ACM Press, 2007.29-42.
[8] 梁东敏, 马绍汉.一类扩展的Steiner树优化问题及其应用[J].计算机学报, 1996, 19(12):895-902. DM Liang, SH Ma.An extended steiner tree optimization problem and its applications[J].Chinese Journal of Computers, 1996, 19(12):895-902.(in Chinese)
2015, Vol. 43 
