Method for minimizing network negative information influence based on blocked continuous boundary
The invention relates to a method for minimizing network negative information influence based on a blocked continuous boundary. The method comprises the following steps: representing spreading of information in a social network by adopting a directed graph at first, and finding out k boundaries in t...
Saved in:
Main Authors | , , , , |
---|---|
Format | Patent |
Language | English |
Published |
09.12.2015
|
Subjects | |
Online Access | Get full text |
Cover
Loading…
Summary: | The invention relates to a method for minimizing network negative information influence based on a blocked continuous boundary. The method comprises the following steps: representing spreading of information in a social network by adopting a directed graph at first, and finding out k boundaries in the directed graph by utilizing a greedy algorithm, so that a negative information influenced area is minimal when the k boundaries are removed, wherein k is a positive integer; and then, removing the k boundaries, so that the negative information spreading range is minimal. According to the invention, the k boundaries capable of minimizing a malicious information diffusion range can be found out through the greedy algorithm; the number of the k boundaries is far less than the total boundary number of a social network graph; a social network, malicious information in which is exploded, can be effectively controlled; therefore, the malicious information spreading range is greatly reduced; and, because of being closest to a theoretical optimal solution, the provided greedy algorithm is far better than other heuristic algorithms. |
---|---|
Bibliography: | Application Number: CN201510462971 |