An Efficient Algorithm of Information Recommendation Between Groups in Social Networks

HUANG Zhen-hua; ZHANG Bo; FANG Qiang; XIANG Yang

doi:10.3969/j.issn.0372-2112.2015.06.008

您当前的位置：

首页 >

文章列表页 >

An Efficient Algorithm of Information Recommendation Between Groups in Social Networks

更新时间：2025-07-16

- An Efficient Algorithm of Information Recommendation Between Groups in Social Networks
- Acta Electronica Sinica Vol. 43, Issue 6, Pages: 1090-1093(2015)
- 作者机构：
  
  1. 同济大学计算机科学与工程系,上海,201804
  2. 同济大学嵌入式系统与服务计算教育部重点实验室,上海,201804
  3. 上海师范大学信息与机电工程学院,上海,200234
  4. 同济大学计算机科学与工程系,上海,201804
  5. 同济大学嵌入式系统与服务计算教育部重点实验室,上海,201804
  6. 上海师范大学信息与机电工程学院,上海,200234
- 作者简介：
- 基金信息：
  
  National Natural Science Foundation of China (No.61272268, No.61103069, No.71171148);Program for New Century Excellent Talents in University of Ministry of Education of China (No.NCET-12-0413);Application Program of Fok Ying-Tong Education Foundation (No.142002)
- DOI：10.3969/j.issn.0372-2112.2015.06.008
  CLC： TP393
- Published：2015
- 稿件说明：
移动端阅览
HUANG Zhen-hua, ZHANG Bo, FANG Qiang, et al. An Efficient Algorithm of Information Recommendation Between Groups in Social Networks[J]. Acta Electronica Sinica, 2015, 43(6): 1090-1093.
DOI：

HUANG Zhen-hua, ZHANG Bo, FANG Qiang, et al. An Efficient Algorithm of Information Recommendation Between Groups in Social Networks[J]. Acta Electronica Sinica, 2015, 43(6): 1090-1093. DOI： 10.3969/j.issn.0372-2112.2015.06.008.

摘要

群组间信息推荐是社交网络中人们传递和分享资讯的重要途径

然而获取精确的最优推荐方案需要指数级时间开销.为此

本文提出一种有效算法EAOORS(Efficient Algorithm for Obtaining Optimal Recommendation Solution)

将该指数级时间开销问题等价归约为EST(Extended Steiner Tree

扩展Steiner树)问题

并在多项式时间复杂度内快速获取近似最优推荐方案.理论分析和仿真实验表明

本文所提的算法具有有效性和实用性.

Abstract

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.

关键词

Keywords

references

Views

1471

下载量

CSCD

Alert me when the article has been cited

提交

Tools

Publicity Resources

Noise Filtering and Feature Enhancement Based Graph Neural Network Method for Fraud Detection

Behavior Steganography in Social Networks Based on 0-1 Knapsack Algorithm

Network Dismantling Algorithm Based on Community Detection and Inverse Reinsertion of Edges

Research on Load Balancing of Distributed Control Plane in Polymorphic Network

PKUsim-86:A Cycle Level Full System Simulator for x86 Processor and AMBA-Based SoC

Related Author

HUANG Zhen-hua

LI Kang-he

GAO Peng

CHAI Peng-xiang

LANG Jun

WANG Zhi-xiao

ZHANG Lei

SUN Cheng-cheng

Related Institution

School of Computer Science， South China Normal University

School of Artificial Intelligence， South China Normal University

College of Computer Science and Engineering, Northeastern University

Mining Digital Engineering Research Center of Ministry of Education

Library of China University of Mining and Technology

⁰