A rumor detection method based on a sliding window

Abstract

The present invention relates to the field of artificial intelligence technology, and provides a rumor detection method based on a sliding window, including obtaining a rumor source node, constructing a rumor propagation graph through the rumor source node; calculating a rumor propagation benchmark rate through an initial rumor window, dynamically adjusting the window and updating the rumor propagation benchmark rate to obtain a set of rumor windows; calculating node depth and matching window encoding, obtaining an initial memory bank, calculating node depth information through the matching window encoding and depth embedding vectors, obtaining a rumor event representation increment through the node depth information and a memory-enhanced attention mechanism, merging the rumor event representation increment into the initial memory bank and iterating the initial memory bank to obtain a rumor event representation; obtaining a deep neural network, inputting the rumor event representation into the deep neural network, and completing rumor detection through the deep neural network. The present invention can effectively improve the effect of rumor detection.

Description

Technical Field

[0001] The present invention relates to the field of artificial intelligence technology, and in particular to a rumor detection method based on a sliding window. Background Art

[0002] Social media has become the core platform for people to obtain information, express opinions and maintain social connections. Nevertheless, the potential risks behind it cannot be ignored. In particular, the disorderly spread and rapid proliferation of rumors have posed severe challenges to social stability, public trust and economic order. Therefore, how to efficiently and accurately identify and contain the spread of rumors on social media has become a key issue to be solved urgently.

[0003] Traditional rumor detection mainly relies on manually designed features and machine learning methods to identify rumors. With the development of deep learning, the emergence of various neural networks has improved the performance of rumor detection. Researchers have explored the static propagation graph of rumor events and achieved excellent detection performance. Further exploration of the temporal dynamics of events has been carried out, and dynamic graphs have been proposed to simulate the spread of events on social media. These methods are usually constructed by graph neural networks, emphasizing the transformation and aggregation of node features, but they cannot capture the detailed temporal features of the spread, such as speed, depth and breadth. In this way, rumors cannot be identified from the perspective of temporal features, so they may not be able to identify rumors in a timely and accurate manner, nor can they obtain the comprehensive propagation characteristics of rumors. Summary of the Invention

[0004] The present invention aims to solve at least one of the technical problems existing in the related art. For this purpose, the present invention provides a rumor detection method based on a sliding window to achieve efficient detection of rumors on social media.

[0005] The present invention provides a rumor detection method based on a sliding window, including:

[0006] S1: Obtain rumor content data, obtain a rumor content sequence and a rumor source node from the rumor content data, and construct a rumor propagation graph through the rumor content sequence and the rumor source node;

[0007] S2: Determine an initial rumor window, calculate a rumor propagation benchmark rate through the initial rumor window, perform window dynamic adjustment according to the rumor propagation benchmark rate and update the rumor propagation benchmark rate to obtain a set of rumor windows;

[0008] S3: Calculate the node depth through the rumor propagation graph and the set of rumor windows, and obtain a depth embedding vector according to the node depth;

[0009] S4: Calculate the matching window encoding, obtain the initial memory bank, calculate the node depth information through the matching window encoding and the depth embedding vector, obtain the incremental representation of the rumor event through the node depth information and the memory-enhanced attention mechanism, merge the incremental representation of the rumor event into the initial memory bank and iterate the initial memory bank to obtain the rumor event representation;

[0010] S5: Obtain a deep neural network, input the rumor event representation into the deep neural network, and complete rumor detection through the deep neural network.

[0011] For a rumor detection method based on a sliding window provided by the present invention, step S1 specifically includes:

[0012] S11: Determine the target software, obtain rumor content data from the target software, detect the rumor content data to obtain latent rumor events, extract and sort rumor content texts related to the latent rumor events from the rumor content data to obtain a rumor content sequence;

[0013] S12: Use the rumor content text with the earliest time in the rumor content sequence as the rumor source node, and construct the rumor propagation graph according to the generation time and propagation order of the rumor content text.

[0014] For a rumor detection method based on a sliding window provided by the present invention, step S2 specifically includes:

[0015] S21: Determine the initial number of rumors, determine the initial rumor window according to the initial number of rumors, obtain the rumor timestamps of the initial rumor window, and calculate the rumor propagation benchmark rate according to the rumor timestamps;

[0016] S22: Obtain the number of rumor windows and determine the window to be adjusted, divide through the number of rumor windows to obtain the initial number of nodes, dynamically adjust the window to be adjusted according to the initial number of nodes and the rumor propagation benchmark rate to obtain the adjusted window, and update the rumor propagation benchmark rate;

[0017] S23: Repeat step S22 with the updated rumor propagation benchmark rate, so as to obtain the rumor window set through the adjusted window.

[0018] For a rumor detection method based on a sliding window provided by the present invention, in step S3, obtain a window adjacency matrix through the rumor window set and the rumor propagation graph, calculate the node depth through the window adjacency matrix, and obtain the depth embedding vector according to the node depth.

[0019] A rumor detection method based on a sliding window provided by the present invention, step S4 specifically includes:

[0020] S41: Calculate the matching window encoding through a multi-layer perceptron function and obtain an initial memory bank. Extract the first depth information and the second depth information from the deep embedding vectors, and calculate the node depth information through the first depth information, the second depth information, and the matching window encoding;

[0021] S42: Obtain a trainable parameter matrix, and transform the trainable parameter matrix through the node depth information to obtain a query vector, a key vector, and a value vector;

[0022] S43: Obtain the attention parameters of the query vector, the key vector, and the value vector, input the attention parameters into a multi-head attention function to obtain a multi-head attention representation, and obtain the rumor event representation increment through the multi-head attention representation and the node depth information;

[0023] S44: Merge the rumor event representation increment into the initial memory bank and update the window adjacency matrix, and iterate the initial memory bank through the updated window adjacency matrix to obtain a rumor event representation.

[0024] According to a rumor detection method based on a sliding window provided by the present invention, in step S44, when iterating the initial memory bank, select a new adjusted window from the rumor window set and repeat steps S3 to S43, and merge the obtained rumor event representation increment into the initial memory bank until all the adjusted windows are used to calculate the node depth and iterate the initial memory bank.

[0025] A rumor detection method based on a sliding window provided by the present invention, step S5 specifically includes:

[0026] S51: Obtain an initial deep neural network, input the rumor event representation into the fully connected layer and the activation function layer of the initial deep neural network to obtain an initial neural network output;

[0027] S52: Calculate the cross entropy of the initial neural network output, train the initial deep neural network through the cross entropy to obtain a target deep neural network, input the rumor event representation into the target deep neural network to obtain a rumor representation judgment result, and complete rumor detection through the rumor representation judgment result.

[0028] According to a rumor detection method based on a sliding window provided by the present invention, in step S1, the rumor propagation graph includes a rumor node set, an adjacency matrix, and a feature matrix.

[0029] According to a rumor detection method based on a sliding window provided by the present invention, in step S43, the vector dimensions of the query vector, the key vector, and the value vector are obtained, and the attention parameters are obtained through the vector dimensions and a softmax transformation.

[0030] According to a rumor detection method based on a sliding window provided by the present invention, in step S41, first node depth information is obtained through the first depth information and the initial memory bank, and second node depth information is obtained through the second depth information and the matching window encoding. The node depth information includes the first node depth information and the second node depth information.

[0031] One or more of the above technical solutions in the embodiments of the present invention have at least one of the following technical effects:

[0032] A rumor detection method based on a sliding window provided by the present invention effectively adjusts the window dynamically for rumor information through the rumor propagation benchmark rate, thereby reflecting the dynamics of rumor information dissemination. Through the memory-enhanced attention mechanism, the learning of the structural information features and information features of rumor propagation is effectively enhanced and merged into the initial memory bank for rumor detection, effectively improving the accuracy and effectiveness of the rumor detection task.

[0033] The additional aspects and advantages of the present invention will be partially given in the following description, partially become apparent from the following description, or be understood through the practice of the present invention. BRIEF DESCRIPTION OF THE DRAWINGS

[0034] In order to more clearly illustrate the technical solutions in the present invention or the prior art, the following will briefly introduce the drawings required for the description of the embodiments or the prior art. Obviously, the drawings in the following description are some embodiments of the present invention. For those of ordinary skill in the art, other drawings can be obtained based on these drawings without creative efforts.

[0035] Figure 1 It is a schematic flowchart of a rumor detection method based on a sliding window provided by the present invention. DETAILED DESCRIPTION OF THE EMBODIMENTS

[0036] To make the objectives, technical solutions, and advantages of the present invention clearer, the technical solutions in the present invention will be clearly and completely described below. Obviously, the described embodiments are some, but not all, of the embodiments of the present invention. Based on the embodiments of the present invention, all other embodiments obtained by those of ordinary skill in the art without creative efforts fall within the protection scope of the present invention. The following embodiments are used to illustrate the present invention, but cannot be used to limit the scope of the present invention.

[0037] In the description of the embodiments of the present invention, it should be noted that the terms "first", "second", and "third" are only used for descriptive purposes and cannot be construed as indicating or implying relative importance.

[0038] In the description of the embodiments of the present invention, it should be noted that unless otherwise clearly specified and defined, the terms "connected" and "connected" should be understood in a broad sense. For example, it can be a fixed connection, a detachable connection, or an integral connection; it can be a mechanical connection or an electrical connection; it can be directly connected or indirectly connected through an intermediate medium. For those of ordinary skill in the art, the specific meanings of the above terms in the embodiments of the present invention can be understood according to specific situations.

[0039] In the description of this specification, the descriptions with reference to terms such as "one embodiment", "some embodiments", "examples", "specific examples", or "some examples" mean that the specific features, structures, materials, or characteristics described in connection with the embodiment or example are included in at least one embodiment or example of the embodiments of the present invention. In this specification, the schematic descriptions of the above terms do not necessarily refer to the same embodiment or example. Moreover, the specific features, structures, materials, or characteristics described can be combined in a suitable manner in any one or more embodiments or examples. In addition, without contradiction, those skilled in the art can combine and combine the different embodiments or examples described in this specification and the features of different embodiments or examples.

[0040] The following combines Figure 1 to describe the implementation scheme of the present invention:

[0041] Figure 1 It is a schematic flowchart of a rumor detection method based on a sliding window provided by the present invention, including first obtaining rumor content data and constructing a rumor propagation graph; then dynamically adjusting the window to obtain a rumor window set; subsequently calculating the node depth to obtain a depth embedding vector; then obtaining the increment of the rumor event representation and performing an iterative operation on the initial memory bank to obtain the rumor event representation; finally, completing rumor detection through a deep neural network.

[0042] The present invention provides a rumor detection method based on a sliding window, including:

[0043] S1: Obtain rumor content data, obtain a rumor content sequence and a rumor source node from the rumor content data, and construct a rumor propagation graph through the rumor content sequence and the rumor source node;

[0044] Furthermore, the purpose of this stage is to obtain rumor data from social media, determine the rumor source node, and then establish a rumor propagation graph. Among them, step S1 further includes:

[0045] S11: Determine the target software, obtain rumor content data from the target software, detect the rumor content data to obtain latent rumor events, extract and sort rumor content texts related to the latent rumor events from the rumor content data to obtain a rumor content sequence;

[0046] S12: Use the rumor content text with the earliest time in the rumor content sequence as the rumor source node, and construct the rumor propagation graph according to the generation time and propagation order of the rumor content text.

[0047] In step S1, the rumor propagation graph includes a rumor node set, an adjacency matrix, and a feature matrix.

[0048] For the above steps, the specific implementation in this embodiment is as follows:

[0049] First, determine at least one Internet social media software or Internet forum, etc. as the target software. In this embodiment, twitter is selected as the target software. Then, obtain the content such as posts, interactive speeches, and topics in the target software to obtain rumor content data including rumors. Subsequently, identify and monitor the rumor content data to find latent rumor events. When a certain event suspected of being a rumor appears repeatedly in the rumor content data, it is determined as a latent rumor event, and the rumor content texts related to the latent rumor event are extracted from the rumor content data, that is, the posts, interactive speeches, and topics including the latent rumor event, and sorted in chronological order from front to back, and a rumor content sequence can be obtained.

[0050] Then, use the rumor content text with the earliest time in the rumor content sequence as the rumor source node, and use the rumor source node as the starting point to establish a rumor propagation graph G according to the generation time and propagation order of the rumor content text, and , where R is the rumor node set. Here, each rumor content text is regarded as a rumor node; A is the adjacency matrix, and the adjacency matrix can be used to represent the mutual relationship between rumor nodes. Here, the mutual relationship can be the mutual comments, forwards, etc. between rumor nodes; X is the feature matrix, and the feature matrix includes the text features of the content in the rumor content text corresponding to the rumor node.

[0051] S2: Determine the initial rumor window, calculate the rumor propagation benchmark rate through the initial rumor window, perform window dynamic adjustment according to the rumor propagation benchmark rate, and update the rumor propagation benchmark rate to obtain a set of rumor windows;

[0052] Furthermore, the purpose of this stage is to calculate the rumor propagation benchmark rate, perform window dynamic adjustment according to the rumor propagation benchmark rate, and update the rumor propagation benchmark rate to obtain a set of rumor windows. Specifically, step S2 specifically includes:

[0053] S21: Determine the initial number of rumors, determine the initial rumor window according to the initial number of rumors, obtain the rumor timestamps of the initial rumor window, and calculate the rumor propagation benchmark rate according to the rumor timestamps.

[0054] S22: Obtain the number of rumor windows and determine the window to be adjusted. Divide by the number of rumor windows to obtain the initial number of nodes. Dynamically adjust the window to be adjusted according to the initial number of nodes and the rumor propagation benchmark rate to obtain the adjusted window, and update the rumor propagation benchmark rate.

[0055] S23: Repeat step S22 with the updated rumor propagation benchmark rate, so as to obtain the rumor window set through the adjusted window.

[0056] For the above steps, the specific implementation in this embodiment is as follows:

[0057] First, determine the number of rumor nodes included in the rumor propagation graph and use it as the initial number of rumors. Then, set the initial number of rumor windows according to the initial number of rumors and divide the number of rumor nodes by the initial number of rumor windows to obtain the number of rumor nodes included in each rumor window, and evenly distribute the rumor nodes in several rumor windows. Since the rumor nodes in the rumor propagation graph are arranged in chronological order, the rumor window where the rumor source node is located is the initial rumor window. Subsequently, obtain the rumor timestamps of the initial rumor window, that is, the sending time of each rumor node in the initial rumor window. Then, calculate the time difference between the j-th rumor node in the initial rumor window and the next rumor node to obtain the timestamp interval of the j-th rumor node , thereby calculating the rumor propagation rate of the i-th rumor window As the rumor propagation benchmark rate:

[0058]

[0059] where J is the number of rumor nodes in the rumor window.

[0060] Subsequently, obtain the number of rumor windows. Here, the number of rumor windows is the initial number of rumor windows minus 1. The window to be adjusted can be the initial rumor window here. Then, equally divide the rumor nodes outside the window to be adjusted according to the number of rumor windows, to obtain an initial rumor window set including rumor propagation windows and an initial number of nodes b. Here, the initial number of nodes is the number of rumor nodes included in each rumor window in the initial rumor window set. Next, dynamically adjust the window to be adjusted according to the initial number of nodes and the rumor propagation benchmark rate. The adjustment method is as follows: First, calculate the (i + 1)-th rumor propagation rate of the rumor propagation window after the window to be adjusted , and then adjust the number of rumor nodes in the window to be adjusted:

[0061]

[0062] where is the number of rumor nodes in the window to be adjusted after window dynamic adjustment, and α is a dynamic adjustment hyperparameter determined according to experience. Through window dynamic adjustment, the size of the window to be adjusted can be adjusted according to the rumor propagation rate of the rumor propagation window after the window to be adjusted, that is, add some rumor nodes of the rumor propagation window after the window to be adjusted to the window to be adjusted, or add some rumor nodes in the window to be adjusted to the rumor propagation window after the window to be adjusted. Take the adjusted window to be adjusted as the adjusted window, and take the rumor propagation rate of the rumor propagation window after the window to be adjusted as the new rumor propagation benchmark rate to complete the update of the rumor propagation benchmark rate.

[0063] Finally, repeat step S22 with the updated rumor propagation benchmark rate, that is, each time of repetition, subtract 1 from the number of rumor propagation windows included in the initial rumor window set obtained in the previous execution to obtain a new number of rumor windows, and equally divide the rumor nodes other than the adjusted window according to the number of rumor windows each time of repetition. Take the rumor propagation window after the adjusted window as the window to be adjusted, so as to be able to repeat step S22 until all rumor propagation windows are adjusted. Among them, the size of the last rumor propagation window does not need to be adjusted. Take all the adjusted windows after adjustment as the rumor window set.

[0064] S3: Calculate the node depth through the rumor propagation graph and the rumor window set, and obtain the depth embedding vector according to the node depth;

[0065] Furthermore, the purpose of this stage is to calculate the node depth so as to obtain the depth embedding vector. Specifically, in step S3, obtain the window adjacency matrix through the rumor window set and the rumor propagation graph, calculate the node depth through the window adjacency matrix, and obtain the depth embedding vector according to the node depth.

[0066] For the above steps, the specific implementation in this embodiment is as follows:

[0067] First, take the first adjusted window in the rumor window set as the reference window , and then select an adjusted window from the rumor window set as the matching window , obtain the mutual relationship between the rumor nodes of the reference window from the rumor propagation graph to get the reference adjacency matrix , and obtain the mutual relationship between the rumor nodes of the matching window to get the matching adjacency matrix . Take the reference adjacency matrix and the matching adjacency matrix as the window adjacency matrix, and calculate the node depth depth through the window adjacency matrix:

[0068]

[0069] where ComputeDepth() represents a function for calculating the depth of each node in the propagation graph. Finally, obtain the depth embedding layer and get the depth embedding vector D according to the node depth:

[0070]

[0071] where represents a trainable depth embedding layer.

[0072] S4: Calculate the matching window encoding, obtain the initial memory bank, calculate the node depth information through the matching window encoding and the depth embedding vector, obtain the rumor event representation increment through the node depth information and the memory-enhanced attention mechanism, merge the rumor event representation increment into the initial memory bank and iterate the initial memory bank to obtain the rumor event representation;

[0073] Furthermore, the purpose of this stage is to calculate the node depth information, obtain the rumor event representation increment through the memory-enhanced attention mechanism, and iterate the initial memory bank. Specifically, step S4 specifically includes:

[0074] S41: Calculate the matching window encoding through the multi-layer perceptron function and obtain the initial memory bank, extract the first depth information and the second depth information from the depth embedding vector, and calculate the node depth information through the first depth information, the second depth information and the matching window encoding;

[0075] S42: Obtain the trainable parameter matrix, transform the trainable parameter matrix through the node depth information to obtain the query vector, the key vector and the value vector;

[0076] S43: Obtain the attention parameters of the query vector, the key vector, and the value vector, input the attention parameters into the multi-head attention function to obtain the multi-head attention representation, and obtain the rumor event representation increment through the multi-head attention representation and the node depth information;

[0077] S44: Incorporate the rumor event representation increment into the initial memory bank and update the window adjacency matrix, and iterate the initial memory bank through the updated window adjacency matrix to obtain the rumor event representation.

[0078] In step S44, when iterating the initial memory bank, select a new adjusted window from the rumor window set and repeat steps S3 to S43, incorporate the obtained rumor event representation increment into the initial memory bank until all the adjusted windows are used to calculate the node depth and iterate the initial memory bank.

[0079] In step S41, obtain the first node depth information through the first depth information and the initial memory bank, and obtain the second node depth information through the second depth information and the matching window encoding. The node depth information includes the first node depth information and the second node depth information.

[0080] In step S43, obtain the vector dimensions of the query vector, the key vector, and the value vector, and obtain the attention parameters through the vector dimensions and a softmax transformation.

[0081] For the above steps, the specific implementation in this embodiment is as follows:

[0082] First, encode the feature matrix of the rumor nodes in the reference window through a multi-layer perceptron function to obtain the initial memory bank , and encode the feature matrix of the rumor nodes in the matching window through a multi-layer perceptron function to obtain the matching window encoding S:

[0083]

[0084]

[0085] where MLP() represents the multi-layer perceptron function. Then, extract the first depth information of the reference window and the second depth information of the matching window from the depth embedding vectors, and calculate the node depth information including the first node depth information and the second node depth information through the first depth information, the second depth information, and the matching window encoding:

[0086]

[0087]

[0088] Among them, is the first node depth information, is the second node depth information.

[0089] Subsequently, obtain a trainable parameter matrix including a trainable query parameter matrix , a key parameter matrix and a value parameter matrix . Transform the trainable parameter matrix through the node depth information to obtain a query vector Q, a key vector K, and a value vector V:

[0090] Next, obtain the vector dimensions of the query vector, the key vector, and the value vector, and calculate the attention parameter β(Q, K, V) of the query vector, the key vector, and the value vector:

[0091]

[0092] Among them, is the transpose of K, and softmax() performs a softmax transformation on the content within the parentheses. is the vector dimension of the query vector, the key vector, and the value vector. Input the attention parameter into the multi-head attention function to obtain a multi-head attention representation including multiple multi-head attention parameters:

[0093]

[0094] Among them, is the h-th multi-head attention parameter, H is the number of multi-head attention parameters, and A() is the multi-head attention function. Concatenate the multi-head attention representations to obtain the target multi-head attention representation :

[0095]

[0096] Among them, is the concatenation operation on the content within the parentheses. Concatenate the target multi-head attention representation with the second node depth information to obtain the rumor event representation increment :

[0097]

[0098] Among them, Concat() means to splice the content within the parentheses. Subsequently, the incremental representation of the rumor event is merged into the initial memory bank, and a new adjusted window that is not repeated is selected as the matching window. The merged initial memory bank is used as the initial memory bank for the next repetition. Steps S3 to S43 are repeated. Each repetition can obtain a new incremental representation of the rumor event and merge it into the initial memory bank, thereby iterating the initial memory bank until all adjusted windows are used to calculate the node depth, thus participating in this process and iterating the initial memory bank. The initial memory bank at this time is used as the target memory bank , and finally, average pooling operation is performed on the target memory bank to obtain the rumor event representation Z:

[0099]

[0100] Among them, MEAN() means to perform average pooling operation on the content within the parentheses.

[0101] S5: Obtain a deep neural network, input the rumor event representation into the deep neural network, and complete rumor detection through the deep neural network.

[0102] Furthermore, the purpose of this stage is to complete rumor detection through a deep neural network. Specifically, step S5 specifically includes:

[0103] S51: Obtain an initial deep neural network, input the rumor event representation into the fully connected layer and activation function layer of the initial deep neural network to obtain an initial neural network output;

[0104] S52: Calculate the cross-entropy of the initial neural network output, train the initial deep neural network through the cross-entropy to obtain a target deep neural network, input the rumor event representation into the target deep neural network to obtain a rumor representation judgment result, and complete rumor detection through the rumor representation judgment result.

[0105] For the above steps, the specific implementation in this embodiment is as follows:

[0106] First, obtain an initial deep neural network, and then input the rumor event representation into the fully connected layer and activation function layer of the initial neural network to obtain an initial neural network output. Then calculate the cross-entropy of the initial neural network output. Through the cross-entropy, the initial deep neural network can be trained to improve its performance, thereby obtaining a target deep neural network. Input the rumor event representation into the target deep neural network, and the rumor representation judgment result can be obtained, thereby judging whether the latent rumor event is a rumor and completing rumor detection.

[0107] The present invention also verifies the effectiveness of a rumor detection method based on a sliding window. First, several rumor detection methods such as EBGCN, Bi-GCN, GACL, RDEA, TrustRD, DynGCN, and PSGT are selected for comparison, and the effectiveness of each method is measured by indicators such as accuracy, precision, recall, and F1 value. SWAM is the method proposed by the present invention, and Table 1 is a comparison table of the results of the rumor judgment experiments of the present invention and other methods.

[0108] Table 1 Comparison table of rumor judgment results between the present invention and other methods

[0109]

[0110] Among them, T indicates that the latent rumor event is non-rumor, F indicates that the latent rumor event is rumor, DRWeibo is to use Weibo as the target software to obtain rumor data and perform detection, TWITTER is to use twitter as the target software to obtain rumor data and perform detection. It can be seen from Table 1 that the method provided by the present invention has a good effect on detecting rumors.

[0111] In addition, the present invention also conducts an ablation experiment on a rumor detection method based on a sliding window. Among them, SWAM is the complete method proposed by the present invention, and the effectiveness of each method is measured by indicators such as accuracy, precision, recall, and F1 value. After removing S3, S2, and S4, the model needs to be adjusted adaptively to ensure the normal operation of the model. Table 2 is the result table of the ablation experiment of the present invention.

[0112] Table 2 Result table of the ablation experiment of the present invention.

[0113]

[0114] It can be seen that removing the above steps will significantly affect the performance of the rumor detection method provided by the present invention.

[0115] Through the description of the above embodiments, those skilled in the art can clearly understand that each embodiment can be implemented by means of software plus a necessary general hardware platform, and of course, it can also be implemented by hardware. Based on such an understanding, the above technical solutions, in essence, or the part that contributes to the prior art can be embodied in the form of a software product. This computer software product can be stored in a computer-readable storage medium, such as ROM / RAM, magnetic disk, optical disk, etc., and includes several instructions for causing a computer device (which can be a personal computer, a server, or a network device, etc.) to execute the methods described in each embodiment or some parts of the embodiments.

[0116] Finally, it should be noted that the above embodiments are only used to illustrate the technical solutions of the present invention and are not intended to limit them; although the present invention has been described in detail with reference to the foregoing embodiments, those of ordinary skill in the art should understand that they can still modify the technical solutions described in the foregoing embodiments, or perform equivalent replacements for some of the technical features; and these modifications or replacements do not cause the essence of the corresponding technical solutions to deviate from the spirit and scope of the technical solutions of the embodiments of the present invention.

Claims

1. A rumor detection method based on a sliding window, characterized in that, Including: S1: Obtain rumor content data, extract the rumor content sequence and rumor source node from the rumor content data, and construct a rumor propagation graph through the rumor content sequence and rumor source node; S2: Determine the initial rumor window, calculate the rumor propagation benchmark rate through the initial rumor window, perform window dynamic adjustment according to the rumor propagation benchmark rate and update the rumor propagation benchmark rate to obtain a set of rumor windows; S3: Calculate the node depth through the rumor propagation graph and the set of rumor windows, and obtain the depth embedding vector according to the node depth; S4: Calculate the matching window encoding, obtain the initial memory bank, calculate the node depth information through the matching window encoding and the depth embedding vector, obtain the rumor event representation increment through the node depth information and the memory-enhanced attention mechanism, merge the rumor event representation increment into the initial memory bank and iterate the initial memory bank to obtain the rumor event representation; S5: Obtain a deep neural network, input the rumor event representation into the deep neural network, and complete rumor detection through the deep neural network.

2. The method for detecting rumors based on a sliding window according to claim 1, wherein Step S1 specifically includes: S11: Determine the target software, obtain the rumor content data from the target software, detect the rumor content data to obtain latent rumor events, extract and sort the rumor content text related to the latent rumor events from the rumor content data to obtain the rumor content sequence; S12: Use the rumor content text with the earliest time in the rumor content sequence as the rumor source node, and construct the rumor propagation graph according to the generation time and propagation order of the rumor content text.

3. A rumor detection method based on a sliding window according to claim 1, wherein Step S2 specifically includes: S21: Determine the initial number of rumors, determine the initial rumor window according to the initial number of rumors, obtain the rumor timestamp of the initial rumor window, and calculate the rumor propagation benchmark rate according to the rumor timestamp; S22: Obtain the number of rumor windows and determine the window to be adjusted, divide through the number of rumor windows to obtain the initial number of nodes, perform window dynamic adjustment on the window to be adjusted according to the initial number of nodes and the rumor propagation benchmark rate to obtain the adjusted window, and update the rumor propagation benchmark rate; S23: Repeat step S22 with the updated rumor propagation benchmark rate, so as to obtain the set of rumor windows through the adjusted window.

4. A rumor detection method based on a sliding window according to claim 1, characterized in that, In step S3, obtain the window adjacency matrix through the set of rumor windows and the rumor propagation graph, calculate the node depth through the window adjacency matrix, and obtain the depth embedding vector according to the node depth.

5. A rumor detection method based on a sliding window according to claim 1, characterized in that Step S4 specifically includes: S41: Calculate the matching window encoding through the multi-layer perceptron function and obtain the initial memory bank, extract the first depth information and the second depth information from the depth embedding vector, and calculate the node depth information through the first depth information, the second depth information and the matching window encoding; S42: Obtain the trainable parameter matrix, transform the trainable parameter matrix through the node depth information to obtain the query vector, key vector and value vector; S43: Obtain the attention parameters of the query vector, the key vector, and the value vector, input the attention parameters into the multi-head attention function to obtain the multi-head attention representation, and obtain the rumor event representation increment through the multi-head attention representation and the node depth information; S44: Incorporate the rumor event representation increment into the initial memory bank and update the window adjacency matrix, and iterate the initial memory bank through the updated window adjacency matrix to obtain the rumor event representation.

6. The rumor detection method based on a sliding window according to claim 5, wherein, In step S44, when iterating the initial memory bank, select a new adjusted window from the rumor window set and repeat steps S3 to S43, incorporate the obtained rumor event representation increment into the initial memory bank until all the adjusted windows are used to calculate the node depth and iterate the initial memory bank.

7. A rumor detection method based on a sliding window according to claim 1, characterized in that Step S5 specifically includes: S51: Obtain an initial deep neural network, input the rumor event representation into the fully connected layer and the activation function layer of the initial deep neural network to obtain an initial neural network output; S52: Calculate the cross-entropy of the initial neural network output, train the initial deep neural network through the cross-entropy to obtain a target deep neural network, input the rumor event representation into the target deep neural network to obtain a rumor representation judgment result, and complete rumor detection through the rumor representation judgment result.

8. A rumor detection method based on a sliding window according to claim 1, characterized in that, In step S1, the rumor propagation graph includes a rumor node set, an adjacency matrix, and a feature matrix.

9. A rumor detection method based on a sliding window according to claim 5, characterized in that In step S43, obtain the vector dimensions of the query vector, the key vector, and the value vector, and obtain the attention parameters through the vector dimensions and a softmax transformation.

10. A rumor detection method based on a sliding window according to claim 5, characterized in that, In step S41, obtain the first node depth information through the first depth information and the initial memory bank, obtain the second node depth information through the second depth information and the matching window encoding, and the node depth information includes the first node depth information and the second node depth information.

Images