CN116016199B

CN116016199B - Information control method, system, electronic equipment and readable storage medium

Info

Publication number: CN116016199B
Application number: CN202310141739.3A
Authority: CN
Inventors: 闫瑞栋
Original assignee: Shandong Mass Institute Of Information Technology
Current assignee: Shandong Mass Institute Of Information Technology
Priority date: 2023-02-21
Filing date: 2023-02-21
Publication date: 2023-06-09
Anticipated expiration: 2043-02-21
Also published as: CN116016199A

Abstract

The application discloses an information control method, an information control system, electronic equipment and a readable storage medium, which relate to the field of information propagation, wherein the information control method is applied to an information transmission network and comprises the following steps: acquiring network topology information of an information transmission network; dividing each network node and other network nodes connected with the network node into a sub-network group in turn according to the sequence of the degree from high to low; determining key nodes in all network nodes in each sub-network group and/or key paths in all connection relations in each sub-network group according to the corresponding connection relations in each sub-network group; information control is performed by using the key nodes and/or the key paths. According to the method and the device, all network nodes are divided into a plurality of sub-network groups through network topology information, information control is carried out in each sub-network group by utilizing key nodes and/or key paths, and the scheme of distributed management by the sub-network groups is low in calculation difficulty, low in response delay and excellent in control effect.

Description

Information control method, system, electronic equipment and readable storage medium

Technical Field

The present invention relates to the field of information dissemination, and in particular, to an information control method, an information control system, an electronic device, and a readable storage medium.

Background

With the rapid development of big data, artificial intelligence, high-performance computing and internet technology, the data volume of network information published and forwarded has increased exponentially. In the process of data growth of information, iterative development of information content and transmission derivation of false information are also in a rapid development stage, and how to issue and transmit real and effective information with better timeliness in a network and replace or correct old or wrong information becomes an important research topic.

At present, a research scheme generally adopts a centralized design, namely, a central manager is utilized to control information of all nodes and transmission paths in a transmission network, and control means comprise means of throwing new information, blocking old information transmission paths and the like. However, the central manager has a very large range of the transmission network to be responsible, which results in high computational complexity and high control difficulty, and further has high control response delay and poor control effect.

Therefore, how to provide a solution to the above technical problem is a problem that needs to be solved by those skilled in the art.

Disclosure of Invention

In view of the above, the present invention aims to provide an information control method, system and related components with better control effect. The specific scheme is as follows:

an information control method applied to an information delivery network, comprising:

acquiring network topology information of the information transfer network; the network topology information comprises all network nodes in the information transmission network, connection relations among the network nodes and degrees of the network nodes determined according to the connection relations, wherein the degrees are the number of other network nodes connected with the network nodes;

according to the network topology information, dividing each network node and other network nodes connected with the network node into a sub-network group according to the sequence from high to low of the degree; the intersection between any two sub-network groups is empty;

determining key nodes in all network nodes in each sub-network group and/or key paths in all connection relations in each sub-network group according to the corresponding connection relations in each sub-network group;

and controlling information by utilizing the key nodes and/or the key paths.

Preferably, the process of dividing each of the network nodes and the other network nodes connected to the network node into a sub-network group sequentially according to the network topology information and the order of the degrees from high to low includes:

and according to the network topology information, dividing each network node and other network nodes which are connected with the network node and are not divided into other sub-network groups into one sub-network group according to the sequence from high to low of the degree.

and according to the network topology information, dividing each network node, other network nodes connected with the network node in a first stage and other network nodes connected with the network node in a second stage into a sub-network group according to the sequence of the degree from high to low.

Preferably, the determining a key node in all the network nodes in each sub-network group according to the corresponding connection relation in each sub-network group includes:

Performing the following actions for each of the sub-network groups:

determining a directed network diagram of the sub-network group according to the information transfer direction in the connection relation of the sub-network group, wherein the directed network diagram comprises directed connection paths between the network nodes of the sub-network group and the network nodes;

reversing all the directed connection paths in the directed network diagram to obtain a transposed network diagram;

for each network node, traversing all other determined network nodes in the transposed network graph to obtain a corresponding reverse reachable set;

and determining key nodes in all the network nodes which appear in all the reverse reachable sets corresponding to all the network nodes.

Preferably, the process of determining a key node among the network nodes appearing in all the reverse reachability sets corresponding to all the network nodes includes:

determining all the network nodes which appear in the reverse reachable sets corresponding to all the network nodes as seed nodes;

and determining key nodes corresponding to the preset number in all the seed nodes.

Preferably, the determining the corresponding preset number of key nodes in all the seed nodes includes:

And determining the first preset number of seed nodes as key nodes according to the order of the degrees from high to low.

determining the directional degree of each seed node in the directional network diagram, wherein the directional degree is the number of all the directional connection paths taking the seed node as a starting point;

and determining the first preset number of seed nodes as key nodes according to the sequence of the directional degrees from high to low.

determining all the network nodes with the occurrence times exceeding the preset times in the reverse reachable set corresponding to all the network nodes as seed nodes;

Preferably, the process of determining the critical path in all connection relations in each sub-network group includes:

performing the following actions for each of the sub-network groups:

determining the directional degree of each key node in the directional network diagram, wherein the directional degree is the number of all the directional connection paths taking the key node as a starting point;

Determining a connection path between the key nodes according to the corresponding network topology information in each sub-network group;

summing the directional degrees of the two key nodes on each connection path as an influence value of the connection path;

and determining a critical path from all the connection paths according to all the influence values.

Preferably, the process of determining a critical path from all the connection paths according to all the influence values includes:

and selecting a second preset number of connection paths to determine as critical paths according to the sequence of the influence values from high to low.

and determining the connection paths with the influence values exceeding the preset influence values in all the connection paths as critical paths.

Preferably, the preset influence value is determined according to the statistical characteristics of all the influence values.

Preferably, the preset influence value is specifically an average value of all the influence values.

Preferably, the preset influence value is specifically the first quartile of all the influence values.

Preferably, the process of using the key node and/or the key path to perform information control includes:

removing the key nodes and/or the key paths to prevent the original information from being transmitted in the information transmission network;

and/or the number of the groups of groups,

and releasing new information at the key node so as to update the original information in the information transmission network.

Preferably, the information delivery network includes:

an internet of things network, and/or a distributed storage network, and/or a distributed computing network, and/or a social information delivery network.

Preferably, the information delivery network includes:

a deep learning algorithm network and/or an engineering flow graph network.

Correspondingly, the application also discloses an information control system which is applied to the information transmission network and comprises the following components:

the acquisition module is used for acquiring the network topology information of the information transmission network; the network topology information comprises all network nodes in the information transmission network, connection relations among the network nodes and degrees of the network nodes determined according to the connection relations, wherein the degrees are the number of other network nodes connected with the network nodes;

The grouping module is used for dividing each network node and other network nodes connected with the network node into a sub-network group according to the network topology information and the sequence from high to low of the degree; the intersection between any two sub-network groups is empty;

the determining module is used for determining key nodes in all network nodes in each sub-network group and/or key paths in all connection relations in each sub-network group according to the corresponding connection relations in each sub-network group;

and the action module is used for controlling information by utilizing the key nodes and/or the key paths.

Correspondingly, the application also discloses electronic equipment, which comprises:

a memory for storing a computer program;

a processor for implementing the steps of the information control method as claimed in any one of the preceding claims when executing said computer program.

Accordingly, the present application also discloses a readable storage medium having stored thereon a computer program which, when executed by a processor, implements the steps of the information control method as described in any of the above.

According to the method and the device, all network nodes are divided into a plurality of sub-network groups through network topology information, information control is carried out in each sub-network group by utilizing key nodes and/or key paths, and compared with centralized management, the scheme of distributed management by the sub-network groups is low in calculation difficulty, low in response delay and excellent in control effect.

Drawings

In order to more clearly illustrate the embodiments of the present invention or the technical solutions in the prior art, the drawings that are required to be used in the embodiments or the description of the prior art will be briefly described below, and it is obvious that the drawings in the following description are only embodiments of the present invention, and that other drawings can be obtained according to the provided drawings without inventive effort for a person skilled in the art.

FIG. 1 is a flow chart of steps of an information control method according to an embodiment of the present invention;

FIG. 2 is a diagram showing a structure of an information delivery network according to an embodiment of the present invention;

FIG. 3a is a schematic diagram of a sub-network group of an information delivery network according to an embodiment of the present invention;

FIG. 3b is a schematic diagram of another exemplary sub-network group configuration of an information delivery network according to an embodiment of the present invention;

FIG. 4 is a diagram illustrating a structure of a transposed network diagram in accordance with an embodiment of the present invention;

FIG. 5 is a diagram showing a structure of an information control system according to an embodiment of the present invention;

fig. 6 is a structural diagram of an electronic device according to an embodiment of the present invention.

Detailed Description

The following description of the embodiments of the present invention will be made clearly and completely with reference to the accompanying drawings, in which it is apparent that the embodiments described are only some embodiments of the present invention, but not all embodiments. All other embodiments, which can be made by those skilled in the art based on the embodiments of the invention without making any inventive effort, are intended to be within the scope of the invention.

The embodiment of the invention discloses an information control method which is applied to an information transmission network, and is shown in fig. 1, and comprises the following steps:

s1: acquiring network topology information of an information transmission network; the network topology information comprises all network nodes in the information transmission network, connection relations among the network nodes and degrees of the network nodes determined according to the connection relations, wherein the degrees are the number of other network nodes connected with the network nodes;

s2: according to the network topology information, dividing each network node and other network nodes connected with the network node into a sub-network group in sequence according to the degree from high to low; the intersection between any two sub-network groups is empty;

s3: determining key nodes in all network nodes in each sub-network group and/or key paths in all connection relations in each sub-network group according to the corresponding connection relations in each sub-network group;

s4: information control is performed by using the key nodes and/or the key paths.

It will be appreciated that the information delivery network mentioned in this embodiment includes various types of node networks having a mesh structure information delivery relationship, including physical, virtual space, and algorithmic information delivery networks, such as networks with obvious information delivery relationships, and the information delivery networks include, but are not limited to: an internet of things network, and/or a distributed storage network, and/or a distributed computing network, and/or a social information delivery network. The node in the internet of things network can be agent equipment, a wireless sensor and even a vehicle processor, the distributed storage network comprises a plurality of distributed storage devices, the distributed operation network comprises a plurality of distributed operation devices, the social information transmission network mainly refers to a transmission network formed by taking all user sites on social information release platforms such as information software APP, information web pages and forums as network nodes, and of course, as the information release platforms differ, the rules of information release and forwarding on each information release platform differ, so that the network topology information in each information transmission network is different, and the adaptability adjustment is needed; as another example, the information transfer relationship is not obvious but various information transfer algorithm flow diagrams are implied internally, and the information transfer network includes, but is not limited to, a deep learning algorithm network and/or an engineering flow diagram network, and the algorithm flow diagrams can also use the information control method in the scheme for information control.

It can be understood that the original information of the information transmission network is relatively complicated, and the original topology information of the original information transmission network needs to be initialized, preprocessed and standardized to obtain the accurate network topology information required in the embodiment.

It should be understood that in step S2, the corresponding sub-network group is determined for each network node according to the degree, specifically, the network node with the highest degree is selected, the network node and other network nodes connected with the network node are divided into the same sub-network group, then the network node with the high degree is selected for the same sub-network group division action, and it should be noted that, in general, after each sub-network group is divided, the network node in the sub-network group is deleted from the network nodes to be divided, and does not participate in the division of other network nodes, that is, according to the network topology information, the process of dividing each network node and other network nodes connected with the network node into one sub-network group in turn according to the order of the degree from high to low includes: according to the network topology information, each network node and other network nodes connected by the network nodes and not divided into other sub-network groups are divided into one sub-network group in turn according to the order of the degrees from high to low.

Further, the range of the sub-network group may consider, in addition to the central network node and other network nodes directly connected thereto, a two-level connected network node or a network node of a next level, for example, a process of dividing each network node and other network nodes connected to the network node into one sub-network group in turn according to the degree from high to low according to the network topology information, including: according to the network topology information, each network node, other network nodes connected with the first level of the network node and other network nodes connected with the second level of the network node are sequentially divided into a sub-network group according to the order of the degrees from high to low. It is understood that, where a primary connection refers to a direct connection between two network nodes, a secondary connection refers to a third network node on the shortest connection path between two network nodes, which are connected by the third network node. Specifically, the range of the sub-network group may be selected according to the size, topology and complexity of the actual information delivery network, which is not limited herein.

It will be appreciated that the determination of the critical nodes and critical paths in each sub-network group in step S3 is to determine critical nodes with greater influence from all known network nodes, and determine critical paths with greater influence from all existing connection relations, and the specific determination method may be selected according to the characteristics of the actual sub-network, which is not limited herein.

Further, the process of performing information control by using the key node and/or the key path in step S4 may include:

and/or the number of the groups of groups,

new information is published at the critical node to update the original information in the information delivery network.

It can be understood that the removal of the key nodes or the key paths is a direct modification of the network topology information, so that the transmission of the original information in the information transmission network, especially in the corresponding sub-network group, can be effectively prevented; correspondingly, when the key node issues information, the original information which is transmitted to other network nodes is updated in a mode of issuing new information under the condition that the network topology information is not changed, the transmission path of the original information is not changed, and the new information can update the original information along with the original transmission path, so that the purpose of reducing the influence of the original information on an information transmission network is achieved.

It will be appreciated that both the original information and the new information can be transferred from one network node to another along with the connection path, in order to reduce the influence of the original information, the original information can be selectively prevented from being transferred or the original information can be covered by the new information, for example, the management of rumors can be selected and removed when the original information is rumor information, the key node and/or the key path can be selectively removed, the propagation speed of the rumor information can be reduced, the influence of the rumor information can be reduced, and the new information of the rumor can be directly released at the key node, so that the original rumor information can be updated, and the negative influence of the rumor information can be reduced.

The embodiment of the invention discloses a specific information control method, and compared with the previous embodiment, the technical scheme of the embodiment is further described and optimized.

Specifically, according to the network topology information, the process of dividing each network node and other network nodes connected with the network node into a sub-network group in turn according to the order of the degrees from high to low includes:

according to the network topology information, each network node and other network nodes connected by the network nodes and not divided into other sub-network groups are divided into one sub-network group in turn according to the order of the degrees from high to low.

Specifically, taking the information delivery network in fig. 2 as an example, the information delivery network includes network nodes P1-P11, where the link relationship between the network nodes is shown in fig. 2, and each network node and its degree correspond to: P11/P8-4, P3/P4/P5/P6-3, P1/P2/P7-2, P9/P10-1, dividing each network node in turn in the order of the degree from high to low.

It can be understood that when network nodes with the same degree exist, the network nodes with the same degree can simultaneously perform the action of dividing the sub-network groups, or the network nodes with the same degree can be randomly arranged and then sequentially perform the action of dividing the sub-network groups according to the sequence, and it is noted that one network node can only correspond to one sub-network group, and the intersection between any two sub-network groups is an empty set, even if the network nodes with the same degree divide the sub-network groups at the same time, and a third network node is located between the two network nodes, and the third network node can only divide one sub-network group with one of the two network nodes into the same sub-network group.

Specifically, after the degrees of all the network nodes in fig. 2 are randomly ordered from high to low and the degrees are the same, the obtained execution sequence may be P11, P8, P3, P4, P5, P6, P1, P2, P7, P9, P10, so that the network node P11 and the network nodes P4, P5, P6, P7 connected to the network node P11 are firstly divided into a sub-network group A1; the remaining network nodes include P8, P3, P1, P2, P9, and P10, and the degrees of the remaining network nodes respectively correspond to: p8-3, P3-3, P1/P2-2, P9/P10-1, it can be seen that the degrees of the network node P8 are not changed except that the degrees of the network node P8 are changed along with the removal of the sub-network group A1, and the degrees of the network node P8 and the degrees of the network node P3 can be randomly ordered, taking P8 as an example, P3 first and then, the network nodes P3, P9 and P10 connected with the network nodes P8 and P8 are divided into a sub-network group A2; the remaining network nodes comprise P1 and P2, and the corresponding degrees are 1, so that the sub-network groups are randomly ordered and divided, and the sub-network group A3 can be obtained to comprise the network nodes P1 and P2; three sub-network groups are obtained at this time, as shown in fig. 3 a:

A1：P11、P4、P5、P6、P7；

A2：P8、 P3、P9、P10；

A3：P1、P2。

Similarly, taking the network node in fig. 2 as an example, the replacement execution sequence is P8, P11, P3, P4, P5, P6, P1, P2, P7, P9, P10, and at this time, the network node P8 and the network nodes P3, P6, P9, P10 connected to P8 are first divided into a sub-network group B1; the remaining network nodes include P11, P4, P5, P1, P2, and P7, and the degrees after updating the remaining network nodes and the remaining network nodes correspond to: P11/P5-3, P4/P7-2, P1/P2-1, the number of network nodes with degree change is more at this moment, the network nodes P11 and P5 have the same degree and can be randomly ordered, taking P5 as an example, P11 first and then, the network nodes P4, P7 and P11 connected with the network nodes P5 and P5 are divided into a sub-network group B2; the remaining network nodes comprise P1 and P2, and the corresponding degrees are 1, so that the sub-network groups are randomly ordered and divided, and the sub-network group B3 can be obtained to comprise the network nodes P1 and P2; three sub-network groups are obtained at this time, as shown in fig. 3 b:

B1：P8、P3、P6、P9、P10；

B2：P5、P4、P7、P11；

B3：P1、P2。

in addition to the above two examples, the network node of fig. 2 may perform the division of the sub-network groups according to other execution sequences, where the division manner has a substantially stable division result, for example, the network nodes P1 and P2 belong to the same group, the network nodes P3, P8, P9 and P10 belong to the same group, and the network nodes P4, P5, P7 and P11 belong to the same group, so that the method has a relatively strong stability. If the random ordering with the same degree is further defined as the ordering mode which is unchanged, the dividing result is more stable.

It can be understood that the division of the network node in this embodiment is based on a simple degree, and compared with other sub-division strategies using the feature weight attribute as the division basis, the implementation complexity of this embodiment is lower, and the fast division can be implemented by using a simple arithmetic logic, so that the operation is easier.

Specifically, the process of determining key nodes in all network nodes in each sub-network group according to the corresponding connection relationship in each sub-network group includes:

the following actions are performed for each sub-network group:

determining a directed network diagram of the sub-network group according to the information transfer direction in the connection relation of the sub-network group, wherein the directed network diagram comprises network nodes of the sub-network group and directed connection paths between the network nodes;

And determining key nodes in all network nodes appearing in all reverse reachable sets corresponding to all network nodes.

It can be understood that the directional connection path is obtained by adding the attribute of the information transmission direction to the connection path on the basis of the connection relationship, and the directional connection path with the information transmission direction can be used in the connection relationship in the above embodiment, so that more effective control is realized.

Further, assuming that the information transfer direction of the network node u and the network node v is u-v propagation, the directional connection paths are reversed to obtain v-u propagation, and all the directional connection paths are reversed to obtain the transposed network diagram. And traversing each network node in the transposed network graph, wherein the traversing method can be breadth-first traversing or depth-first traversing, and determining all the network nodes which can be traversed as a reverse reachable set.

Taking the transposed network diagram of fig. 4 as an example, assume that the reverse reachable set RRSet (v) of the network node v includes the network node P4/P5/P6/P7, the reverse reachable set RRSet (u) of the network node u includes the network node P7/P8, the reverse reachable set RRSet (z) of the network node z includes the network node P7/P8/P9P1/P2/P3, and at this time, a key node may be determined in all the reverse reachable sets RRSet (v), RRSet (u), and RRSet (z), where the key node may be an intersection of all the reverse reachable sets, and at this time, the intersection is the network node P7. Obviously, in fig. 4, the network node P7 may affect 3 network nodes, while other network nodes affect 1 or 2 network nodes, so P7 is more critical than other network nodes.

Further, the process of determining the key node in the network nodes appearing in all reverse reachable sets corresponding to all the network nodes includes:

determining all network nodes which appear in all reverse reachable sets corresponding to all network nodes as seed nodes;

Or, the process of determining the key node in all the network nodes in all the reverse reachable sets corresponding to all the network nodes comprises:

determining all network nodes with the occurrence times exceeding the preset times in all reverse reachable sets corresponding to all network nodes as seed nodes;

It will be appreciated that seed nodes are a preliminary screening of reverse reachable centralized network nodes before key nodes. For the determination of the seed node, two schemes are provided, one is to use the network node in the intersection of all the reverse reachable sets as the seed node, and the other is to use the network node with the occurrence times exceeding the preset times in all the reverse reachable sets as the seed node, so that the situation that the whole network is over emphasized and the local network is ignored is avoided, and the specific determination mode can be selected according to the situations of different information transmission networks, which is not limited herein.

Further, the process of determining the key nodes corresponding to the preset number in all the seed nodes comprises the following steps: and determining the first preset number of seed nodes as key nodes according to the order of the degrees from high to low.

Or determining a process of key nodes corresponding to the preset number in all seed nodes, wherein the process comprises the following steps:

determining the directional degree of each seed node in the directional network diagram, wherein the directional degree is the number of all directional connection paths taking the seed node as a starting point;

It can be understood that the network node with higher influence is selected from the plurality of seed nodes as the key node, the influence can be determined by the degree or the directional degree, and the directional degree has the characteristics of more obvious propagation direction and more effective propagation purpose relative to the degree, so that the key node for information control is more accurately determined.

Further, the process of determining the critical path in all connection relations in each sub-network group includes:

the following actions are performed for each sub-network group:

determining the directional degree of each key node in the directional network diagram, wherein the directional degree is the number of all directional connection paths taking the key node as a starting point;

Determining connection paths among the key nodes according to the corresponding network topology information in each sub-network group;

summing the directional degrees of two key nodes on each connecting path to be used as an influence value of the connecting path;

from all the impact values, a critical path is determined from all the connection paths.

Specifically, for two key nodes u and v, the influence of the key path e (u, v) is the sum of the directional degree of the key node u and the directional degree of the key node v.

It will be appreciated that there are a plurality of connection paths in the sub-network group, but considering that the critical path is a connection path with a higher impact value and the impact value is a connection path with a preceding impact value, the impact value is mostly contributed by the critical nodes, so that the critical path is determined from the connection paths between the critical nodes, and it is generally no longer time-consuming to calculate the impact value of the connection path containing other non-critical nodes.

Further, the process of determining the critical path from all the connection paths according to all the influence values includes:

and selecting a second preset number of connection paths to determine as critical paths according to the order of the influence values from high to low.

Or, determining a critical path from all connection paths according to all the influence values, including:

It will be appreciated that the preset influence value is generally determined according to the statistical characteristics of all influence values, for example, the preset influence value is specifically an average value of all influence values, or the preset influence value is specifically the first quartile of all influence values, which may be specifically set according to the actual situation, and is not limited herein.

It can be understood that the critical path selects a connection path with a higher influence value, and a specific selection method may be a sorting count, or a connection path with an influence value exceeding a certain statistical characteristic, or other selection methods, which are not limited herein and may be set according to actual situations.

Correspondingly, the embodiment of the application also discloses an information control system, which is applied to an information transmission network, and is shown in fig. 5, and comprises:

an acquisition module 1, configured to acquire network topology information of the information delivery network; the network topology information comprises all network nodes in the information transmission network, connection relations among the network nodes and degrees of the network nodes determined according to the connection relations, wherein the degrees are the number of other network nodes connected with the network nodes;

A grouping module 2, configured to divide each of the network nodes and other network nodes connected to the network node into a sub-network group in sequence according to the network topology information and the degree from high to low; the intersection between any two sub-network groups is empty;

a determining module 3, configured to determine, according to the connection relationships corresponding to each of the sub-network groups, a critical node in all the network nodes in each of the sub-network groups and/or a critical path in all the connection relationships in each of the sub-network groups;

and the action module 4 is used for controlling information by utilizing the key nodes and/or the key paths.

In some specific embodiments, the process of dividing each of the network nodes and the other network nodes connected to the network node into a sub-network group sequentially according to the network topology information and the degree from high to low by the grouping module 2 includes:

In some specific embodiments, the determining module 3 determines, according to the connection relationship corresponding to each sub-network group, a procedure of determining a key node in all the network nodes in each sub-network group, including:

performing the following actions for each of the sub-network groups:

In some specific embodiments, the determining module 3 determines a key node in the network nodes that occur in all the reverse reachability sets corresponding to all the network nodes, including:

In some specific embodiments, the determining the corresponding preset number of key nodes in all the seed nodes includes:

In some specific embodiments, the determining module 3 determines a process of determining a corresponding preset number of key nodes in all the seed nodes, including:

In some specific embodiments, the determining module 3 determines a key node among the network nodes appearing in all the reverse reachability sets corresponding to all the network nodes includes:

In some specific embodiments, the determining module 3 determines a critical path in all connection relationships in each of the sub-network groups, including:

performing the following actions for each of the sub-network groups:

In some specific embodiments, the determining module 3 determines, according to all the impact values, a critical path from all the connection paths, including:

In some specific embodiments, the preset influence value is determined according to a statistical feature of all the influence values.

In some specific embodiments, the preset influence value is specifically an average value of all the influence values.

In some specific embodiments, the preset influence value is specifically the first quartile of all the influence values.

In some specific embodiments, the process of performing information control by using the key node and/or the key path by the action module 4 includes:

and/or the number of the groups of groups,

In some specific embodiments, the information delivery network comprises:

a deep learning algorithm network and/or an engineering flow graph network.

The embodiment of the application also discloses an electronic device, which is shown in fig. 6 and comprises a processor 11 and a memory 12; wherein the process 11, when executing the computer program stored in the memory 12, implements the following steps:

and controlling information by utilizing the key nodes and/or the key paths.

In the embodiment of the application, all network nodes are divided into a plurality of sub-network groups through network topology information, and information control is performed in each sub-network group by utilizing key nodes and/or key paths.

In some specific embodiments, the following steps may be implemented when the processor 11 executes the computer subroutine stored in the memory 12:

performing the following actions for each of the sub-network groups:

And/or the number of the groups of groups,

In some specific embodiments, the information delivery network comprises:

a deep learning algorithm network and/or an engineering flow graph network.

Further, the electronic device in this embodiment may further include:

the input interface 13 is configured to acquire an externally imported computer program, store the acquired computer program in the memory 12, and also be configured to acquire various instructions and parameters transmitted by an external terminal device, and transmit the various instructions and parameters to the processor 11, so that the processor 11 uses the various instructions and parameters to develop corresponding processing. In this embodiment, the input interface 13 may specifically include, but is not limited to, a USB interface, a serial interface, a voice input interface, a fingerprint input interface, a hard disk reading interface, and the like.

And an output interface 14 for outputting various data generated by the processor 11 to a terminal device connected thereto, so that other terminal devices connected to the output interface 14 can acquire various data generated by the processor 11. In this embodiment, the output interface 14 may specifically include, but is not limited to, a USB interface, a serial interface, and the like.

And the communication unit 15 is used for establishing a remote communication connection between the electronic equipment and the external server so that the electronic equipment can mount the image file to the external server. In this embodiment, the communication unit 15 may specifically include, but is not limited to, a remote communication unit based on a wireless communication technology or a wired communication technology.

A keyboard 16 for acquiring various parameter data or instructions inputted by a user by tapping the key cap in real time.

And the display 17 is used for displaying the related information of the information control process in real time so that a user can know the control condition of the current information in time.

The mouse 18 may be used to assist the user in inputting data and to simplify the user's operation.

Further, embodiments of the present application disclose a computer readable storage medium, where the computer readable storage medium includes Random Access Memory (RAM), memory, read Only Memory (ROM), electrically programmable ROM, electrically erasable programmable ROM, registers, hard disk, a removable disk, a CD-ROM, or any other form of storage medium known in the art. A computer readable storage medium having stored therein a computer program which when executed by a processor performs the steps of:

and controlling information by utilizing the key nodes and/or the key paths.

In some specific embodiments, the computer subroutine stored in the computer readable storage medium may specifically implement the following steps when executed by a processor:

performing the following actions for each of the sub-network groups:

and/or the number of the groups of groups,

In some specific embodiments, the information delivery network comprises:

a deep learning algorithm network and/or an engineering flow graph network.

Finally, it is further noted that relational terms such as first and second, and the like are used solely to distinguish one entity or action from another entity or action without necessarily requiring or implying any actual such relationship or order between such entities or actions. Moreover, the terms "comprises," "comprising," or any other variation thereof, are intended to cover a non-exclusive inclusion, such that a process, method, article, or apparatus that comprises a list of elements does not include only those elements but may include other elements not expressly listed or inherent to such process, method, article, or apparatus. Without further limitation, an element defined by the phrase "comprising one … …" does not exclude the presence of other like elements in a process, method, article, or apparatus that comprises the element.

The above detailed description of the information control method, system, electronic device and readable storage medium provided by the present invention applies specific examples to illustrate the principles and embodiments of the present invention, and the above examples are only used to help understand the method and core idea of the present invention; meanwhile, as those skilled in the art will have variations in the specific embodiments and application scope in accordance with the ideas of the present invention, the present description should not be construed as limiting the present invention in view of the above.

Claims

1. An information control method, applied to an information delivery network, comprising:

information control is carried out by utilizing the key nodes and/or the key paths;

and determining key nodes in all the network nodes in each sub-network group according to the corresponding connection relation in each sub-network group, wherein the process comprises the following steps: performing the following actions for each of the sub-network groups: determining a directed network diagram of the sub-network group according to the information transfer direction in the connection relation of the sub-network group, wherein the directed network diagram comprises directed connection paths between the network nodes of the sub-network group and the network nodes; reversing all the directed connection paths in the directed network diagram to obtain a transposed network diagram; for each network node, traversing all other determined network nodes in the transposed network graph to obtain a corresponding reverse reachable set; determining key nodes in all the network nodes in the reverse reachable set corresponding to all the network nodes;

A process for determining critical paths in all connection relationships in each of the sub-network groups, comprising: performing the following actions for each of the sub-network groups: determining the directional degree of each key node in the directional network diagram, wherein the directional degree is the number of all the directional connection paths taking the key node as a starting point; determining a connection path between the key nodes according to the corresponding network topology information in each sub-network group; summing the directional degrees of the two key nodes on each connection path as an influence value of the connection path; and determining a critical path from all the connection paths according to all the influence values.

2. The information control method according to claim 1, wherein the process of sequentially dividing each of the network nodes and the other network nodes to which the network node is connected into a sub-network group in order of the degree from high to low according to the network topology information, comprises:

3. The information control method according to claim 1, wherein the process of sequentially dividing each of the network nodes and the other network nodes to which the network node is connected into a sub-network group in order of the degree from high to low according to the network topology information, comprises:

4. The information control method according to claim 1, wherein the process of determining a key node among the network nodes appearing in all the reverse reachability sets corresponding to all the network nodes includes:

5. The information control method according to claim 4, wherein the determining the corresponding preset number of key nodes among all the seed nodes includes:

6. The information control method according to claim 4, wherein the determining the corresponding preset number of key nodes among all the seed nodes includes:

7. The information control method according to claim 1, wherein the process of determining key nodes among the network nodes appearing in all the reverse reachability sets corresponding to all the network nodes includes:

8. The information control method according to claim 1, wherein the process of determining a critical path from among all the connection paths based on all the influence values includes:

9. The information control method according to claim 1, wherein the process of determining a critical path from among all the connection paths based on all the influence values includes:

10. The information control method according to claim 9, wherein the preset influence value is determined based on statistical characteristics of all the influence values.

11. The information control method according to claim 10, wherein the preset influence value is specifically an average value of all the influence values.

12. The information control method according to claim 10, wherein the preset influence value is specifically the first quartile of all the influence values.

13. The information control method according to claim 1, wherein the process of information control using the critical node and/or the critical path includes:

And/or the number of the groups of groups,

14. The information control method according to any one of claims 1 to 13, characterized in that the information delivery network includes:

15. The information control method according to any one of claims 1 to 13, characterized in that the information delivery network includes:

a deep learning algorithm network and/or an engineering flow graph network.

16. An information control system, for use in an information delivery network, comprising:

the action module is used for controlling information by utilizing the key nodes and/or the key paths;

the determining module determines the key nodes in all the network nodes in each sub-network group according to the corresponding connection relation in each sub-network group, and the determining module comprises the following steps: performing the following actions for each of the sub-network groups: determining a directed network diagram of the sub-network group according to the information transfer direction in the connection relation of the sub-network group, wherein the directed network diagram comprises directed connection paths between the network nodes of the sub-network group and the network nodes; reversing all the directed connection paths in the directed network diagram to obtain a transposed network diagram; for each network node, traversing all other determined network nodes in the transposed network graph to obtain a corresponding reverse reachable set; determining key nodes in all the network nodes in the reverse reachable set corresponding to all the network nodes;

The determining module determines a critical path in all connection relations in each sub-network group, including: performing the following actions for each of the sub-network groups: determining the directional degree of each key node in the directional network diagram, wherein the directional degree is the number of all the directional connection paths taking the key node as a starting point; determining a connection path between the key nodes according to the corresponding network topology information in each sub-network group; summing the directional degrees of the two key nodes on each connection path as an influence value of the connection path; and determining a critical path from all the connection paths according to all the influence values.

17. An electronic device, comprising:

a memory for storing a computer program;

processor for implementing the steps of the information control method according to any one of claims 1 to 15 when executing said computer program.

18. A readable storage medium, characterized in that the readable storage medium has stored thereon a computer program which, when executed by a processor, implements the steps of the information control method according to any one of claims 1 to 15.