CN109191318A - A kind of target seeking method and device that effective contribution excitation information is propagated - Google Patents
A kind of target seeking method and device that effective contribution excitation information is propagated Download PDFInfo
- Publication number
- CN109191318A CN109191318A CN201810828138.9A CN201810828138A CN109191318A CN 109191318 A CN109191318 A CN 109191318A CN 201810828138 A CN201810828138 A CN 201810828138A CN 109191318 A CN109191318 A CN 109191318A
- Authority
- CN
- China
- Prior art keywords
- node
- contribution
- propagation
- propagated
- effective
- Prior art date
- Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
- Granted
Links
Classifications
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06Q—INFORMATION AND COMMUNICATION TECHNOLOGY [ICT] SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES; SYSTEMS OR METHODS SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES, NOT OTHERWISE PROVIDED FOR
- G06Q50/00—Systems or methods specially adapted for specific business sectors, e.g. utilities or tourism
- G06Q50/01—Social networking
Landscapes
- Business, Economics & Management (AREA)
- Engineering & Computer Science (AREA)
- Primary Health Care (AREA)
- Strategic Management (AREA)
- Economics (AREA)
- General Health & Medical Sciences (AREA)
- Human Resources & Organizations (AREA)
- Marketing (AREA)
- Computing Systems (AREA)
- Health & Medical Sciences (AREA)
- Tourism & Hospitality (AREA)
- Physics & Mathematics (AREA)
- General Business, Economics & Management (AREA)
- General Physics & Mathematics (AREA)
- Theoretical Computer Science (AREA)
- Data Exchanges In Wide-Area Networks (AREA)
- Management, Administration, Business Operations System, And Electronic Commerce (AREA)
Abstract
The present invention provides a kind of target seeking method and device that effectively contribution excitation information is propagated, and can be improved information propagation efficiency and accuracy.The described method includes: judging whether the propagation contribution margin of node is more than or equal to preset transmission threshold；If so, the node is effectively to contribute node, award to the information source node of effective contribution node, to promote the message in network to propagate to more valuable node.The present invention relates to information in social networks to propagate and building field.
Description
Technical field
Field is propagated and constructed the present invention relates to information in social networks, particularly relates to a kind of effectively contribution excitation information biography
The target seeking method and device broadcast.
Background technique
In recent years, social networks has been developed as unprecedented information and propagates platform.Self network (wherein, self
Network is the abbreviation of the social networks centered on self (ego)) between interaction can make the wide-scale distribution of information, this
The facilitated method for solving particular problem can be provided, such as find missing crew, but its solution needs a large amount of participants to pass
Information is broadcast, and the directionality propagated is also critically important during close to target.
In the prior art, destination node is generally found using node aspiration circulation way, information propagation efficiency is low and accurate
Rate is low.
Summary of the invention
The technical problem to be solved in the present invention is to provide a kind of target seeking method that effectively contribution excitation information is propagated and
Device, to solve to cause information propagation efficiency low using node aspiration circulation way searching destination node present in the prior art
And the problem that accuracy rate is low.
In order to solve the above technical problems, the embodiment of the present invention provides a kind of goal seeking that effectively contribution excitation information is propagated
Method, comprising:
Judge whether the propagation contribution margin of node is more than or equal to preset transmission threshold；
If so, the node is effectively to contribute node, award to the information source node of effective contribution node,
To promote the message in network to propagate to more valuable node.
Further, before whether the propagation contribution margin for judging node is more than or equal to preset transmission threshold, the side
Method further include:
For the same message, judge whether certain node can receive the propagation from different central nodes；
If cannot, using the unique center node to spread news to certain described node as the unique information of certain node
Source node；
If can, it is common node by certain described node sets, the central node in self each network is to common node
It is at war with one by one, is chosen at the common node that the maximum central node of cost of working hard in competition process is competed as this
Unique information source node.
Further, competition process uses full auction mechanism.
Further, the unique information source node v of common nodewinIt indicates are as follows:
Wherein, n indicates actual participation center of competition interstitial content,It indicates to participate in center of competition's node viIt wins
The optimal effort cost paid must be competed,To participate in center of competition's node viObtain the effort journey that reward is actually paid
Degree,zi To participate in center of competition's node viThe minimal effort degree that reward need to be paid is obtained, λ indicates to participate in this competition
Heart node can participate in center of competition's node total number estimated value to this, and e indicates that natural constant, F (z) are level of effort z's
Distribution function, F-1(z) indicate that the inverse of F (z), F ' (z) indicate the first derivative of F (z), central node viIt is paid to obtain reward
Level of effort ziWith reward wi(M) relation function between is zi=wi(M),For wi(M) inverse function.
Further, whether the propagation contribution margin for judging node is more than or equal to preset transmission threshold and includes:
Determine that node is propagated institute's energy bring to message and is worth；
Determine that the propagation of node is efficient；
Using node to message propagate institute can bring be worth and its propagate the product between effective percentage as the propagation of node
Contribution margin；
Judge whether the propagation contribution margin of node is more than or equal to preset transmission threshold.
Further, if viFor any node in self network G, node viPropagating institute to message can bring valueAre as follows:
Wherein, ωIAnd ωsRespectively indicate the weight of node influence power and attributes similarity, IiIndicate node viInfluence
Power,Indicate node viWith destination node vtarAttributes similarity, kiFor node viOut-degree, kjIndicate self network G
The out-degree of middle jth node, | G | indicate the node total number in self network G, att () indicates the attribute set of node.
Further, node viPropagation effective percentage qiAre as follows:
qi=p (θi,ρi|Si=s)=p (θi|Si=s) p (ρi|Si=s)
Wherein, p (θi|Si=s) it is to propagate successful probability, p (ρi|Si=s) it is the probability for propagating wish, θiIndicate node
viProbability of spreading, ρiIndicate node viPropagation wish, s indicate node viCentral node to node viPropagation whether at
Function, SiThe stochastic variable for being s for value.
Further, if viFor the information source node for effectively contributing node in self network, then viReward function M (vi)
Are as follows:
Wherein, KL is divergence, for indicating central node viInitial contribution and the difference degree finally contributed are to propagate journey
Degree, and corresponding reward is given for its propagation；The remuneration that k is paid by unit difference degree；For center node viIt has neither part nor lot in
Initial contribution amount when propagation； Indicate central node viWhen stopping propagating, central node viIt passes
All neighbor node v being multicast tojHave effect spread contribution amountThe sum of, t indicates to have the neighbours of effect spread contribution amount to save
The number of point.
The embodiment of the present invention also provides a kind of goal seeking device that effectively contribution excitation information is propagated, comprising: effective tribute
Excitation module is offered, effective contribution excitation module includes: judging submodule and actuation sub-module；
Judging submodule, for judging whether the propagation contribution margin of node is more than or equal to preset transmission threshold；
Actuation sub-module, if the propagation contribution margin for node is more than or equal to preset transmission threshold, the node is
Effectively contribution node awards to the information source node of effective contribution node, to promote the message in network to more having
The node of value is propagated.
Further, the system also includes: nodes to compete module；
The node competes module, for for the same message, judging whether certain node can receive from difference
The propagation of central node；If cannot, using the unique center node to spread news to certain described node as certain node
Unique information source node；If can, it is common node by certain described node sets, the central node in self each network is to altogether
It is at war with one by one with node, is chosen at the maximum central node of cost of working hard in competition process and is total to as what this was competed
With the unique information source node of node.
The advantageous effects of the above technical solutions of the present invention are as follows:
In above scheme, judge whether the propagation contribution margin of node is more than or equal to preset transmission threshold；If so, described
Node is effectively to contribute node, is awarded to the information source node of effective contribution node, to promote the message in network
It is propagated to more valuable node, in this way, can be avoided using effectively contribution node incoming direction in message communication process
The blind passage of message is conducive to quickly find destination node, while incentive mechanism is used in communication process, relative to node will
It is willing to circulation way, increases the participation of node and propagates enthusiasm, to improves information propagation efficiency and accuracy.
Detailed description of the invention
Fig. 1 is the process signal for the target seeking method that effective contribution excitation information provided in an embodiment of the present invention is propagated
Figure；
Fig. 2 is the logic diagram for the target seeking method that effective contribution excitation information provided in an embodiment of the present invention is propagated；
Fig. 3 is the schematic illustration that node provided in an embodiment of the present invention competes module；
Fig. 4 is the schematic illustration of effective contribution excitation module provided in an embodiment of the present invention；
Fig. 5 is that platform provided in an embodiment of the present invention pays trend schematic diagram；
Fig. 6 is the structural representation for the goal seeking device that effective contribution excitation information provided in an embodiment of the present invention is propagated
Figure.
Specific embodiment
To keep the technical problem to be solved in the present invention, technical solution and advantage clearer, below in conjunction with attached drawing and tool
Body embodiment is described in detail.
The present invention for it is existing using node aspiration circulation way find destination node cause information propagation efficiency low and
The low problem of accuracy rate provides a kind of target seeking method and device that effectively contribution excitation information is propagated.
Embodiment one
As shown in Figure 1, the target seeking method that effective contribution excitation information provided in an embodiment of the present invention is propagated, comprising:
S101, judges whether the propagation contribution margin of node is more than or equal to preset transmission threshold；
S102 gives the information source node of effective contribution node if so, the node is effectively to contribute node
Reward, to promote the message in network to propagate to more valuable node.
The target seeking method that effective contribution excitation information is propagated described in the embodiment of the present invention, judges the propagation tribute of node
Offer whether value is more than or equal to preset transmission threshold；If so, the node is effectively to contribute node, effective contribution is saved
The information source node of point is awarded, to promote the message in network to propagate to more valuable node, in this way, utilizing effective tribute
Node incoming direction in message communication process is offered, the blind passage of message is can be avoided, is conducive to quickly find destination node,
Incentive mechanism is used in communication process simultaneously, circulation way is volunteered relative to node, increases the participation and propagation of node
Enthusiasm, to improve information propagation efficiency and accuracy.
The target seeking method that effective contribution excitation information is propagated described in the embodiment of the present invention, cannot be only used for social network
Network can also be used in searching of other complex networks to destination node, such as transportation network, crime net, has use scope wide, leads to
With the strong advantage of property.
In the specific embodiment for the target seeking method that aforementioned effective contribution excitation information is propagated, further,
Judge whether the propagation contribution margin of node is more than or equal to before preset transmission threshold, the method also includes:
For the same message, judge whether certain node can receive the propagation from different central nodes；
If cannot, using the unique center node to spread news to certain described node as the unique information of certain node
Source node；
If can, it is common node by certain described node sets, the central node in self each network is to common node
It is at war with one by one, is chosen at the common node that the maximum central node of cost of working hard in competition process is competed as this
Unique information source node.
In the present embodiment, node competitive model can establish, the common section of competition is utilized by the node competitive model of foundation
The form of point determines the unique information source node of common node, so that message be avoided to repeat inefficient propagation；Specific steps include:
Step 1-1), using the node competitive model of foundation, determine common node collection:
For the same message, judge whether certain node can receive the propagation from different central nodes, if cannot,
Then using the unique center node to spread news to certain described node as the unique information source node of certain node；If can,
It is common node by certain described node sets, the collection of common node composition is collectively referred to as common node collection.
Step 1-2), determine information source node:
Central node in self each network is at war with one by one to each common node that common node is concentrated, competition
Process uses full auction mechanism, and participation center of competition's node is participant, is chosen in competition process and works hard cost most
Big central node becomes the unique information source node of the common node of this competition as winner.
The reward for giving winner in competition every time is M, participant viIt is z to obtain reward to pay corresponding level of effortiAnd
ziThe relation function of ∈ [0,1], level of effort and reward is zi=wi(M), wherein w is increasing function that can be micro-.Actual participation is competing
The number n for the central node striven is unknown to each participant, and n obeys Poisson distribution, then each participation center of competition node energy
Enough win the probability of competition are as follows:
Wherein, λ is the Estimate of Total Number value for participating in this center of competition's node and participating in center of competition's node to this, F
(zi) it is level of effort ziDistribution function.
In the present embodiment, it is assumed that each participant is individual rationality in competition, and the cost paid is also that participation is competing
The optimal cost striven can then win the probability of competition according to each participation center of competition's node, determine that each participant wins
The optimal effort cost paid must be competed are as follows:
Wherein,It indicates to participate in center of competition's node viThe optimal effort cost that competition is paid is won,For ginseng
With center of competition node viThe level of effort that reward is actually paid is obtained,zi To participate in center of competition's node viIt is rewarded
The minimal effort degree that need to be paid, λ indicate that center of competition's node can be participated in this by participating in this center of competition's node
Estimate of Total Number value, e indicate that natural constant, F (z) are the distribution function of level of effort z, F-1(z) inverse of F (z), F ' (z) are indicated
Indicate the first derivative of F (z), central node viTo obtain the level of effort z that reward is paidiWith reward wi(M) the relationship letter between
Number is zi=wi(M),For wi(M) inverse function.
In the present embodiment, the number of actual participation center of competition node is n, then the unique information source node of common node
It indicates are as follows:
In the specific embodiment for the target seeking method that aforementioned effective contribution excitation information is propagated, further, institute
It states and judges whether the propagation contribution margin of node is more than or equal to preset transmission threshold and includes:
Determine that node is propagated institute's energy bring to message and is worth；
Determine that the propagation of node is efficient；
Using node to message propagate institute can bring be worth and its propagate the product between effective percentage as the propagation of node
Contribution margin；
Judge whether the propagation contribution margin of node is more than or equal to preset transmission threshold.
In the present embodiment, after information source node has been determined to each common node, the biography of message will be carried out in a network
It broadcasts, in order to improve the efficiency and accuracy of message propagation, incentive mechanism is introduced in communication process, can specifically include:
Step 2-1), establish node value models, measure node by the node value models of foundation and institute propagated to message
It can bring value.
In the present embodiment, the assessment of the value of a node is mainly accounted in terms of two, the influence power of node and
Attributes similarity.
In the present embodiment, for self network G, if viFor any node in network, node viInfluence power IiIt can be with
It indicates are as follows:
Wherein, kiFor node viOut-degree, kjIndicate the out-degree of jth node in self network G, | G | it indicates in network G
Node total number.
On the other hand, attributes similarity mainly reflects the similarity degree of the attribute of existing node and destination node, common
Attribute include source of students, location, work, a series of attributes being easily obtained relevant to people's information of gender etc..Node vi
With destination node vtarAttributes similarityIt can indicate are as follows:
Wherein, att () indicates the attribute set of node.
According to more weight distribution thoughts, node viPropagating institute to message can bring valueAre as follows:
Wherein, ωIAnd ωsRespectively indicate the weight of node influence power and attributes similarity, ωI,ωs>=0 and ωI+ωs=
1。
Step 2-2), determine that the propagation of node is efficient.
Message will not only consider that message successful spread to the probability of spreading of node, will also be examined during Internet communication
Consider whether the node being transmitted has a mind to continue to propagate, i.e. the propagation of node is efficient, node viPropagation effective percentage qiIt can be with table
It is shown as:
qi=p (θi,ρi|Si=s)=p (θi|Si=s) p (ρi|Si=s)
Wherein, p (θi|Si=s) it is to propagate successful probability, p (ρi|Si=s) it is the probability for propagating wish, both take
It is distributed from beta (Beta), θi∈ [0,1] indicates node viProbability of spreading, s ∈ { 0,1 } indicate node viCentral node arrive
Node viPropagation whether succeed, SiThe stochastic variable for being s for value, ρiThe propagation wish of ∈ [0,1] expression node.
Step 2-3), building effectively contribution excitation model.
Node viPropagation contribution margin beSet transmission thresholdTo be done to node
Contribution is screened, and will be greater than transmission thresholdContribution margin regard effective contribution as, it may be assumed that only as node viPropagation contribution margin
More than or equal to transmission thresholdWhen, just will be considered that it is to have effect spread, claims node v at this timeiEffectively to contribute node,It is effective
Propagate contribution amount
In the present embodiment, award to the information source node that can make effectively contribution node, to promote message to more
Valuable node is propagated.
In the present embodiment, viIt can indicate any node in self network, viIt can also be specially effective in self network
The information source node for contributing node, if viFor the information source node for effectively contributing node in self network, then viReward function M
(vi) are as follows:
Wherein, KL is divergence, for indicating central node viInitial contribution and the difference degree finally contributed are to propagate journey
Degree, and corresponding reward is given for its propagation；The remuneration that k is paid by unit difference degree；For center node viIt has neither part nor lot in
Initial contribution amount when propagation； Indicate central node viWhen stopping propagating, central node viIt passes
All neighbor node v being multicast tojHave effect spread contribution amountThe sum of, t indicates to have the neighbours of effect spread contribution amount to save
The number of point.
The target seeking method that effective contribution excitation information is propagated described in embodiment for a better understanding of the present invention, knot
Fig. 2 and Fig. 3 is closed the method is described in detail:
As shown in Figure 2 and Figure 3, a node, which whether can, be first determined whether in node competition module for the same message
The propagation from different central nodes is enough received, if it is not, the unique center section that will be spread news to certain described node
Unique information source node of the point as certain node；If it can, being then common node by the node sets, and common section is added
Point set.
After common node collection determines, the central node in self each network successively carries out the node that common node is concentrated
Competition, until each common node was competed once.Each reward for participating in center of competition's node and being obtained according to expectation
Pay corresponding level of effortThe effort cost paid is calculated as follows:
For participating in center of competition's node viM=0.8 is encouraged if winning competition and winning a prize, is setλ
=3, ziTo be uniformly distributed i.e. distribution function F (zi)=zi, competition number scale obedience Poisson distribution minimal effort degree zi=0,
The level of effort actually paid isThen node viThe effort cost paid is
The effort cost for participating in competition node is successively calculated according to optimal effort cost formula, is chosen and is made great efforts cost maximum
Node be information source node vwin, i.e.,
After the information source node of each node has been determined, effectively excitation module is contributed to utilize node valence according to historical data
It is worth the value of model calculate node.If node viOut-degree be ki, | G | the node total number in self network G is indicated, using as follows
Formula calculate node influence power:
Utilize following formula calculate node viWith destination node vtarAttributes similarity are as follows:
As shown in figure 4, comprehensively considering node influence power and attributes similarity, the weight for setting the two is respectively ωIAnd ωs,
And 0≤ωI,ωs≤ 1, ωI+ωs=1, according to more weight distribution thought calculate node viValue are as follows:
Node self-value is assessed using node value models, determines the value of each node itself, then is led to
The propagation for crossing calculate node is efficient, determines the contribution that node can be done in the air.
In a network, node receives message and propagates certain probability again, this probability is represented by the propagation of node
Wish.Use parameter θi∈ [0,1] indicates node viProbability of spreading, parameter θiBernoulli Jacob is obeyed to be distributed, and its prior probability distribution
Beta distribution is obeyed, i.e., For the successful number of Initial travel,For time of Initial travel failure
Number.Parameter s ∈ { 0,1 } indicates node viCentral node to node viPropagation whether succeed, SiThe stochastic variable for being s for value；
Use parameter ρi∈ [0,1] indicates the propagation wish of node, still obeys Bernoulli Jacob's distribution, same parameter ρiPrior distribution obey
Beta distribution, i.e., To be initially identified as propagating the strong number of wish,For Initial travel wish
Weak number.After propagating r times, Indicate that central node propagates r to neighbor node
Successful number is propagated after secondary,It indicates to propagate the number to fail, can similarly obtainAccording to θiWith ρiConditional independence,
The propagation efficiency q of calculate nodeiIt is as follows:
It indicates to propagate contribution amount, therefore node v with the propagation efficiency of node value and the nodeiPropagation contribution amount
Are as follows:
One node propagates message different institute's energy bring contribution amounts of the value and propagation efficiency by its own
Have the difference of size.And to efficiently find destination node, it determines the direction of propagation, saves and propagate cost it is necessary to find propagation
Big node is contributed to be propagated.As shown in figure 4, the big node of contribution amount is selected in order to distinguish the difference of contribution amount size,
Transmission threshold is introduced in modelAssuming that transmission thresholdSpecific threshold value will be set according to the actual situation by platform
It is fixed, only as node viPropagation contribution not less than the threshold value when, just will be considered that it is to have effect spread, claim at this timeEffectively to pass
Contribution amount is broadcast, that is, propagates effective contribution amountAre as follows:
In self each network, all there is propagation of the central node to its neighbor node, the neighbor node that will be transmitted
It is considered as child node, this will generate a series of propagation contribution amount, according to transmission thresholdIt is screened, can select has
Effect spread contributes quantum nodes, has the sum of effect spread contribution amount as assessment all child nodes that the central node travels to
Standard, the difference degree for indicating central node initial contribution using KL divergence and finally contributing is prevalence, and is propagated for it
Give corresponding reward.For node viInitial contribution amount when having neither part nor lot in propagation, node viThere is child node when stopping propagating
The sum of effect spread contribution amount isRemuneration that unit difference degree is paid is set as k and k is greater than unit
The cost b that prevalence is paid, to node viPropagation reward:
In the present embodiment, awards to the information source node that can make effectively contribution node, be based on prize outcome, really
Set the goal node propagation path, propagate the information such as hop count.
As shown in figure 5, according to the property of reward function, becauseSo working asWhen being gradually increased, node vi
The reward of acquisition also can gradually increase, and this promotes nodes to strive to find effect spread to obtain higher reward
The neighbors of contribution amount.AgainThen to node v for platformiPayment will be a convex function.From there through
Node competition and effectively contribution incentive mechanism set up the propagation efficiency that can be improved information in a network and accuracy, faster look for
To the optimal path for finding destination node, to reduce propagation cost.
To sum up, the target seeking method that effective contribution excitation information is propagated described in the embodiment of the present invention, passes through building
Node competitive model determines the unique information source node of common node using full auction mechanism thought, so that message be avoided to repeat
Inefficient propagation；And effectively contribution excitation model is constructed, judge whether the propagation contribution margin of node is more than or equal to preset propagation threshold
Value；If so, the node is effectively to contribute node, award to the information source node of effective contribution node, to promote
Message in network access network is propagated to more valuable node, in this way, being introduced in message communication process using effectively contribution node
Directionality can be avoided the blind passage of message, be conducive to quickly find destination node, while excitation set is used in communication process
System volunteers circulation way relative to node, increases the participation of node and propagates enthusiasm, to improve information propagation efficiency
And accuracy.
Embodiment two
The present invention also provides a kind of specific embodiment of goal seeking device that effectively contribution excitation information is propagated, due to
The mesh that the goal seeking device and aforementioned effective contribution excitation information that effective contribution excitation information provided by the invention is propagated are propagated
The specific embodiment for marking finding method is corresponding, which can be by holding
Process step in row above method specific embodiment achieves the object of the present invention, therefore above-mentioned effective contribution excitation information
Explanation in the target seeking method specific embodiment of propagation is also applied for effective contribution excitation letter provided by the invention
The specific embodiment for ceasing the goal seeking device propagated will not be described in great detail in present invention specific embodiment below.
As shown in fig. 6, the embodiment of the present invention also provides a kind of goal seeking device that effectively contribution excitation information is propagated, packet
Include: effectively contribution excitation module, effective contribution excitation module includes: judging submodule and actuation sub-module；
Judging submodule 11, for judging whether the propagation contribution margin of node is more than or equal to preset transmission threshold；
Actuation sub-module 12, if the propagation contribution margin for node is more than or equal to preset transmission threshold, the node
Effectively to contribute node, award to the information source node of effective contribution node, to promote the message in network to more
Valuable node is propagated.
The goal seeking device that effective contribution excitation information is propagated described in the embodiment of the present invention, judges the propagation tribute of node
Offer whether value is more than or equal to preset transmission threshold；If so, the node is effectively to contribute node, effective contribution is saved
The information source node of point is awarded, to promote the message in network to propagate to more valuable node, in this way, utilizing effective tribute
Node incoming direction in message communication process is offered, the blind passage of message is can be avoided, is conducive to quickly find destination node,
Incentive mechanism is used in communication process simultaneously, circulation way is volunteered relative to node, increases the participation and propagation of node
Enthusiasm, to improve information propagation efficiency and accuracy.
In the specific embodiment for the goal seeking device that aforementioned effective contribution excitation information is propagated, further, institute
State system further include: node competes module；
The node competes module, for for the same message, judging whether certain node can receive from difference
The propagation of central node；If cannot, using the unique center node to spread news to certain described node as certain node
Unique information source node；If can, it is common node by certain described node sets, the central node in self each network is to altogether
It is at war with one by one with node, is chosen at the maximum central node of cost of working hard in competition process and is total to as what this was competed
With the unique information source node of node.
It should be noted that, in this document, relational terms such as first and second and the like are used merely to a reality
Body or operation are distinguished with another entity or operation, are deposited without necessarily requiring or implying between these entities or operation
In any actual relationship or order or sequence.
The above is a preferred embodiment of the present invention, it is noted that for those skilled in the art
For, without departing from the principles of the present invention, several improvements and modifications can also be made, these improvements and modifications
It should be regarded as protection scope of the present invention.
Claims (10)
1. a kind of target seeking method that effectively contribution excitation information is propagated characterized by comprising
Judge whether the propagation contribution margin of node is more than or equal to preset transmission threshold；
If so, the node is effectively to contribute node, award to the information source node of effective contribution node, to promote
Message in network access network is propagated to more valuable node.
2. the target seeking method that effective contribution excitation information according to claim 1 is propagated, which is characterized in that judging
Whether the propagation contribution margin of node is more than or equal to before preset transmission threshold, the method also includes:
For the same message, judge whether certain node can receive the propagation from different central nodes；
If cannot, it is saved the unique center node to spread news to certain described node as the unique information source of certain node
Point；
If can, be common node by certain described node sets, the central node in self each network to common node one by one
It is at war with, the common node for being chosen at the maximum central node of cost of working hard in competition process as this and competing is only
One information source node.
3. the target seeking method that effective contribution excitation information according to claim 2 is propagated, which is characterized in that competed
The full auction mechanism of Cheng Caiyong.
4. the target seeking method that effective contribution excitation information according to claim 2 is propagated, which is characterized in that common section
The unique information source node v of pointwinIt indicates are as follows:
Wherein, n indicates actual participation center of competition interstitial content,It indicates to participate in center of competition's node viIt wins competing
The optimal effort cost paid is striven,To participate in center of competition's node viThe level of effort that reward is actually paid is obtained,zi
To participate in center of competition's node viThe minimal effort degree that reward need to be paid is obtained, λ indicates to participate in this center of competition section
Point can participate in center of competition's node total number estimated value to this, and e indicates that natural constant, F (z) are the distribution of level of effort z
Function, F-1(z) indicate that the inverse of F (z), F ' (z) indicate the first derivative of F (z), central node viIt is exerted for what acquisition reward was paid
Range degree ziWith reward wi(M) relation function between is zi=wi(M),For wi(M) inverse function.
5. the target seeking method that effective contribution excitation information according to claim 1 is propagated, which is characterized in that described to sentence
Whether the propagation contribution margin of disconnected node, which is more than or equal to preset transmission threshold, includes:
Determine that node is propagated institute's energy bring to message and is worth；
Determine that the propagation of node is efficient；
Using node to message propagate institute can bring value and its propagate the product between effective percentage as node propagation contribution
Value；
Judge whether the propagation contribution margin of node is more than or equal to preset transmission threshold.
6. the target seeking method that effective contribution excitation information according to claim 5 is propagated, which is characterized in that set viFor
Any node in self network G, node viPropagating institute to message can bring valueAre as follows:
Wherein, ωIAnd ωsRespectively indicate the weight of node influence power and attributes similarity, IiIndicate node viInfluence power,Indicate node viWith destination node vtarAttributes similarity, kiFor node viOut-degree, kjIt indicates in self network G
The out-degree of j node, | G | indicate the node total number in self network G, att () indicates the attribute set of node.
7. the target seeking method that effective contribution excitation information according to claim 6 is propagated, which is characterized in that node vi
Propagation effective percentage qiAre as follows:
qi=p (θi,ρi|Si=s)=p (θi|Si=s) p (ρi|Si=s)
Wherein, p (θi|Si=s) it is to propagate successful probability, p (ρi|Si=s) it is the probability for propagating wish, θiIndicate node vi's
Probability of spreading, ρiIndicate node viPropagation wish, s indicate node viCentral node to node viPropagation whether succeed, Si
The stochastic variable for being s for value.
8. the target seeking method that effective contribution excitation information according to claim 6 is propagated, which is characterized in that set viFor
The information source node of node is effectively contributed in self network, then viReward function M (vi) are as follows:
Wherein, KL is divergence, for indicating central node viInitial contribution and the difference degree finally contributed are prevalence, and
Corresponding reward is given for its propagation；The remuneration that k is paid by unit difference degree；For center node viWhen having neither part nor lot in propagation
Initial contribution amount； Indicate central node viWhen stopping propagating, central node viIt travels to
All neighbor node vjHave effect spread contribution amountThe sum of, t indicates the number for having the neighbor node of effect spread contribution amount
Mesh.
9. a kind of goal seeking device that effectively contribution excitation information is propagated characterized by comprising effectively contribution excited modes
Block, effective contribution excitation module includes: judging submodule and actuation sub-module；
Judging submodule, for judging whether the propagation contribution margin of node is more than or equal to preset transmission threshold；
Actuation sub-module, if the propagation contribution margin for node is more than or equal to preset transmission threshold, the node is effective
Node is contributed, is awarded to the information source node of effective contribution node, to promote the message in network to more valuable
Node propagate.
10. the goal seeking device that effective contribution excitation information according to claim 9 is propagated, which is characterized in that described
Device further include: node competes module；
The node competes module, for judging whether certain node can receive from different centers for the same message
The propagation of node；If cannot, using the unique center node to spread news to certain described node as the unique of certain node
Information source node；If can, it is common node by certain described node sets, the central node in self each network is to common section
Point is at war with one by one, is chosen at the common section that the maximum central node of cost of working hard in competition process is competed as this
The unique information source node of point.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201810828138.9A CN109191318B (en) | 2018-07-25 | 2018-07-25 | Target searching method and device for effectively contributing to incentive information propagation |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201810828138.9A CN109191318B (en) | 2018-07-25 | 2018-07-25 | Target searching method and device for effectively contributing to incentive information propagation |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN109191318A true CN109191318A (en) | 2019-01-11 |
| CN109191318B CN109191318B (en) | 2022-03-22 |
Family
ID=64937365
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201810828138.9A Active CN109191318B (en) | 2018-07-25 | 2018-07-25 | Target searching method and device for effectively contributing to incentive information propagation |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN109191318B (en) |
Cited By (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN114746924A (en) * | 2019-12-04 | 2022-07-12 | 三菱电机株式会社 | Driving support device and driving support method |
Citations (6)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN101064649A (en) * | 2007-02-02 | 2007-10-31 | 华为技术有限公司 | Method, apparatus and system for selecting super node, searching network node or resource |
| CN102932460A (en) * | 2012-11-06 | 2013-02-13 | 北京交通大学 | Campus network peer-to-peer (P2P) incentive method based on contribution values |
| CN103051645A (en) * | 2011-10-11 | 2013-04-17 | 电子科技大学 | Packet-based incentive mechanism in P2P (Peer to Peer) network |
| CN104660677A (en) * | 2015-01-16 | 2015-05-27 | 北京邮电大学 | Tree CDN-P2P fusion network framework based on grid structure and method thereof |
| US20170357724A1 (en) * | 2016-06-14 | 2017-12-14 | International Business Machines Corporation | Model independent and network structure driven ranking of nodes for limiting the spread of misinformation through location based social networks |
| CN107609165A (en) * | 2017-09-27 | 2018-01-19 | 北京科技大学 | A kind of method for finding specific crowd |
-
2018
- 2018-07-25 CN CN201810828138.9A patent/CN109191318B/en active Active
Patent Citations (6)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN101064649A (en) * | 2007-02-02 | 2007-10-31 | 华为技术有限公司 | Method, apparatus and system for selecting super node, searching network node or resource |
| CN103051645A (en) * | 2011-10-11 | 2013-04-17 | 电子科技大学 | Packet-based incentive mechanism in P2P (Peer to Peer) network |
| CN102932460A (en) * | 2012-11-06 | 2013-02-13 | 北京交通大学 | Campus network peer-to-peer (P2P) incentive method based on contribution values |
| CN104660677A (en) * | 2015-01-16 | 2015-05-27 | 北京邮电大学 | Tree CDN-P2P fusion network framework based on grid structure and method thereof |
| US20170357724A1 (en) * | 2016-06-14 | 2017-12-14 | International Business Machines Corporation | Model independent and network structure driven ranking of nodes for limiting the spread of misinformation through location based social networks |
| CN107609165A (en) * | 2017-09-27 | 2018-01-19 | 北京科技大学 | A kind of method for finding specific crowd |
Cited By (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN114746924A (en) * | 2019-12-04 | 2022-07-12 | 三菱电机株式会社 | Driving support device and driving support method |
Also Published As
| Publication number | Publication date |
|---|---|
| CN109191318B (en) | 2022-03-22 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN109544334B (en) | Method for realizing network extensible block chain | |
| Li et al. | Game-theoretic analysis of cooperation incentive strategies in mobile ad hoc networks | |
| Condorelli | What money canʼt buy: Efficient mechanism design with costly signals | |
| Fu et al. | On disclosure policy in contests with stochastic entry | |
| CN109819022A (en) | A kind of block chain common recognition method based on credit appraisal | |
| CN109389485B (en) | Block chain dynamic excitation method based on information sharing contribution value in autonomous domain mode | |
| CN109492887B (en) | Mobile crowd sensing and exciting method based on potential game theory | |
| CN108805627A (en) | Media resource allocation method, device, system, medium and equipment | |
| CN109410054B (en) | Block chain consensus method based on information sharing contribution value in autonomous domain mode | |
| Liu et al. | Role of gifts in decision making: An endowment effect incentive mechanism for offloading in the IoV | |
| CN111130790A (en) | Block co-recognition method based on block chain node network | |
| Shen et al. | Multi-winner contests for strategic diffusion in social networks | |
| CN109191318A (en) | A kind of target seeking method and device that effective contribution excitation information is propagated | |
| Li et al. | Oxytocin and the punitive hub—dynamic spread of cooperation in human social networks | |
| Murto et al. | Common value auctions with costly entry | |
| Nath et al. | Mechanism design for time critical and cost critical task execution via crowdsourcing | |
| Yue et al. | A double auction-based approach for multi-user resource allocation in mobile edge computing | |
| CN113283778B (en) | Layered convergence federal learning method based on security evaluation | |
| CN114185995A (en) | Block chain consensus mechanism based on contribution value and credit degree | |
| CN113298668A (en) | Mobile crowd-sourcing aware user large-scale rapid recruitment method considering social network | |
| CN103824195A (en) | Excitation method based on three-round bargaining in opportunity network | |
| Shi et al. | Social sourcing: Incorporating social networks into crowdsourcing contest design | |
| Sodagari et al. | Strategies to achieve truthful spectrum auctions for cognitive radio networks based on mechanism design | |
| CN108337263B (en) | Sybil attack prevention incentive method based on mobile crowd sensing system | |
| Au et al. | Effects of group size uncertainty and protocol of play in a common pool resource dilemma |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| PB01 | Publication | ||
| PB01 | Publication | ||
| SE01 | Entry into force of request for substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| GR01 | Patent grant | ||
| GR01 | Patent grant |