EBSN中基于用户特征的社交事件规划与饥饿问题处理  

Social Event Planning Based on User Characteristic and Hungry Problem Processing in EBSN

作　　者：张翰林 丁琳琳[1] 王俊陆[1] 宋宝燕[1] ZHANG Han-lin;DING Lin-lin;WANG Jun-lu;SONG Bao-yan(School of Information,Liaoning University,Shenyang 110036,China)

机构地区：[1]辽宁大学信息学院

出　　处：《小型微型计算机系统》2020年第1期211-217,共7页Journal of Chinese Computer Systems

基　　金：国家自然科学基金项目(61472169,61502215,51704138)资助;辽宁省重点研发计划项目(2017231011)资助;辽宁省重点工程技术研究中心项目(2017051023)资助;沈阳市中青年科技创新人才支持计划项目(RC180244)资助;辽宁省教育厅基础研究项目(LQN201910,LJC201913)资助

摘　　要：社交事件发布参与平台越来越受到人们的关注,其主要功能是为对某个社交事件感兴趣的用户规划适合的社交活动.现有社交事件平台贪婪规划方法通常假设每个用户可以参与限定个数的事件,解决参加限定个数事件引起的时空冲突,但方法中没有考虑用户的特征,导致用户规划顺序不合理,同时,现有方法也没有考虑如何解决因资源占用出现用户无法获取事件的情况,导致用户对社交平台满意度下降.为解决上述问题,本文通过用户空闲时间与用户平均速度双重约束条件,提出一种基于用户特征的社交事件规划与饥饿问题处理方法,该方法首先提取用户特征排序的同时,结合贪心算法和Skyline思想再次排序,确定用户最佳处理顺序,在此基础上,针对社交网络事件规划中可能出现的用户饥饿问题提出救济算法,消除兴趣值不敏感的饥饿用户,在总效用值下降最小的前提下,保证了用户对社交网站的最大满意度.实验表明,本文提出的规划算法能够有效地进行社交事件规划并解决用户饥饿问题.Social event publishing participation platform has attracted more and more attention.Its main function is to plan suitable social activities for users interested in a social event.The existing greedy planning methods for social event platforms usually assume that each user can participate in a limited number of events to solve the temporal and spatial conflicts caused by participating in the limited number of events,but the characteristics of users are not taken into account in the methods,which leads to unreasonable user planning order.At the same time,the existing methods do not consider howto solve the problem that users can not obtain events due to resource occupation,which leads to the decline in users’satisfaction with social platforms.In order to solve the above problems,this paper proposes a social event planning and hunger problem processing method based on user characteristics through the dual constraints of user idle time and user average speed.This method first abstracts user feature sorting,combines greedy algorithm and Skyline idea to sort again,and determines the best processing order of users.Aiming at the possible problem of user hunger in social network event planning,a relief algorithm is proposed to eliminate the hungry users whose interest value is insensitive,and the maximum satisfaction of users to social networking sites are guaranteed under the premise of the minimum decrease of the total utility value.Experiments showthat the planning algorithm proposed to this paper can effectively plan social events and solve the problem of user hunger.

关 键 词：EBSN 效用值 全局规划 时间约束 饥饿问题 

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