Selection Of Competitive Seeds Based On Time And Cost For Micro-blog Network

With the continuous innovation of the Internet model,the acceleration of online and offline services and the continuous enrichment of mobile Internet service scenarios,mobile Internet products have become the main way for people to obtain information.Weibo,one of them,has been popularized by a large number of users because of its fast information update,diverse information sources,and clear development of events and topics.It has also become a research hotspot for many scholars in recent years.The issue of influence communication in Weibo network is a research hotspot for scholars in recent years.And finding the set of seed nodes in the problem of maximizing the impact is one of the important branches.It has been widely used in information dissemination and viral marketing.This paper aims at the propagation of two kinds of competitive information in the microblog network.Considering both time and cost,this paper proposes a competitive species selection algorithm based on time and minimum cost.The algorithm selects the competitive seed collection for the information B that enters the network at a minimum cost,so that the final propagation influence range of the information exceeds the impact range of the competition information,then,the competition is obtained.The algorithm is divided into two parts:information A alone propagation part,information A and information B simultaneous propagation part.A part of the information A is propagated separately,the individual information is propagated using the independent cascade model.This paper calculates the influence of the information A alone based on the time when the information B enters the Weibo network;the second part,after information B enters the microblog network,the two kinds of competitive information propagate simultaneously.This paper calculates the initial node of information B that takes the least cost based on the time-and-minimum-cost competitive seed collection selection algorithm.And this kind of nodes make the influence range of information B larger than the influence range of information A.In order to prove the feasibility and correctness of this algorithm,this paper uses real Weibo data to demonstrate the algorithm.Firstly,we analyzes the algorithm itself,and finds that the latter information enters the network at different times,the cost is different,and the selected competition seed set is also different.And if the entry time exceeds a certain range,the latter information will not be able to win the competition.Then the CELF algorithm is compared with the CELF algorithm based on the minimum cost,and it is found that the total cost required for the competition seed set obtained by the CELF algorithm based on the minimum cost is smaller.There are two main points of innovation in this article:First,this article improves on the basis of the simultaneous dissemination of two types of competitive information.This paper considers the time difference between two kinds of competing information entering the network,and selects the competition type set that takes the least cost to make the latter information win the competition.Second,in order to facilitate the calculation of the scope of influence of the former's information spread independently in the microblog network,this paper selects the CELF algorithm based on the extended independent concatenation model,first selects the possible graph and then calculates the influence range.However,this article also has some deficiencies.In order to ensure the experimental results,CELF algorithm is selected as the basic algorithm in this paper,but the final results show that the algorithm has a high time complexity.The next step of the research in this paper needs to improve the competition selection algorithm and reduce the time complexity to make it more suitable for large social networks.