CN112948825A - Prediction method and device for viral propagation of network information in social network - Google Patents

Prediction method and device for viral propagation of network information in social network Download PDF

Info

Publication number
CN112948825A
CN112948825A CN202110405406.8A CN202110405406A CN112948825A CN 112948825 A CN112948825 A CN 112948825A CN 202110405406 A CN202110405406 A CN 202110405406A CN 112948825 A CN112948825 A CN 112948825A
Authority
CN
China
Prior art keywords
propagation
time
model
fusion
characteristic
Prior art date
Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
Granted
Application number
CN202110405406.8A
Other languages
Chinese (zh)
Other versions
CN112948825B (en
Inventor
高立群
周斌
刘宇嘉
贾焰
李爱平
江荣
涂宏魁
王晔
喻承
汪海洋
庄洪武
席闻
蒋沂桔
宋鑫
Current Assignee (The listed assignees may be inaccurate. Google has not performed a legal analysis and makes no representation or warranty as to the accuracy of the list.)
National University of Defense Technology
Original Assignee
National University of Defense Technology
Priority date (The priority date is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the date listed.)
Filing date
Publication date
Application filed by National University of Defense Technology filed Critical National University of Defense Technology
Priority to CN202110405406.8A priority Critical patent/CN112948825B/en
Publication of CN112948825A publication Critical patent/CN112948825A/en
Application granted granted Critical
Publication of CN112948825B publication Critical patent/CN112948825B/en
Active legal-status Critical Current
Anticipated expiration legal-status Critical

Links

Images

Classifications

    • G—PHYSICS
    • G06—COMPUTING; CALCULATING OR COUNTING
    • G06F—ELECTRIC DIGITAL DATA PROCESSING
    • G06F21/00—Security arrangements for protecting computers, components thereof, programs or data against unauthorised activity
    • G06F21/50—Monitoring users, programs or devices to maintain the integrity of platforms, e.g. of processors, firmware or operating systems
    • G06F21/55—Detecting local intrusion or implementing counter-measures
    • G06F21/554—Detecting local intrusion or implementing counter-measures involving event detection and direct action
    • G—PHYSICS
    • G06—COMPUTING; CALCULATING OR COUNTING
    • G06F—ELECTRIC DIGITAL DATA PROCESSING
    • G06F18/00—Pattern recognition
    • G06F18/20—Analysing
    • G06F18/21—Design or setup of recognition systems or techniques; Extraction of features in feature space; Blind source separation
    • G06F18/214—Generating training patterns; Bootstrap methods, e.g. bagging or boosting
    • G—PHYSICS
    • G06—COMPUTING; CALCULATING OR COUNTING
    • G06F—ELECTRIC DIGITAL DATA PROCESSING
    • G06F18/00—Pattern recognition
    • G06F18/20—Analysing
    • G06F18/25—Fusion techniques
    • G—PHYSICS
    • G06—COMPUTING; CALCULATING OR COUNTING
    • G06N—COMPUTING ARRANGEMENTS BASED ON SPECIFIC COMPUTATIONAL MODELS
    • G06N3/00—Computing arrangements based on biological models
    • G06N3/02—Neural networks
    • G06N3/04—Architecture, e.g. interconnection topology
    • G06N3/044—Recurrent networks, e.g. Hopfield networks
    • G—PHYSICS
    • G06—COMPUTING; CALCULATING OR COUNTING
    • G06N—COMPUTING ARRANGEMENTS BASED ON SPECIFIC COMPUTATIONAL MODELS
    • G06N3/00—Computing arrangements based on biological models
    • G06N3/02—Neural networks
    • G06N3/04—Architecture, e.g. interconnection topology
    • G06N3/045—Combinations of networks
    • G—PHYSICS
    • G06—COMPUTING; CALCULATING OR COUNTING
    • G06N—COMPUTING ARRANGEMENTS BASED ON SPECIFIC COMPUTATIONAL MODELS
    • G06N3/00—Computing arrangements based on biological models
    • G06N3/02—Neural networks
    • G06N3/08—Learning methods
    • G06N3/084—Backpropagation, e.g. using gradient descent
    • G—PHYSICS
    • G06—COMPUTING; CALCULATING OR COUNTING
    • G06Q—INFORMATION AND COMMUNICATION TECHNOLOGY [ICT] SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES; SYSTEMS OR METHODS SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES, NOT OTHERWISE PROVIDED FOR
    • G06Q10/00—Administration; Management
    • G06Q10/04—Forecasting or optimisation specially adapted for administrative or management purposes, e.g. linear programming or "cutting stock problem"
    • G—PHYSICS
    • G06—COMPUTING; CALCULATING OR COUNTING
    • G06Q—INFORMATION AND COMMUNICATION TECHNOLOGY [ICT] SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES; SYSTEMS OR METHODS SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES, NOT OTHERWISE PROVIDED FOR
    • G06Q50/00—Information and communication technology [ICT] specially adapted for implementation of business processes of specific business sectors, e.g. utilities or tourism
    • G06Q50/01—Social networking

Landscapes

  • Engineering & Computer Science (AREA)
  • Theoretical Computer Science (AREA)
  • Physics & Mathematics (AREA)
  • General Physics & Mathematics (AREA)
  • Data Mining & Analysis (AREA)
  • General Engineering & Computer Science (AREA)
  • Business, Economics & Management (AREA)
  • Artificial Intelligence (AREA)
  • Life Sciences & Earth Sciences (AREA)
  • Evolutionary Computation (AREA)
  • Software Systems (AREA)
  • General Health & Medical Sciences (AREA)
  • Computing Systems (AREA)
  • Health & Medical Sciences (AREA)
  • Strategic Management (AREA)
  • Biophysics (AREA)
  • Molecular Biology (AREA)
  • Computational Linguistics (AREA)
  • Biomedical Technology (AREA)
  • Human Resources & Organizations (AREA)
  • Economics (AREA)
  • Mathematical Physics (AREA)
  • Evolutionary Biology (AREA)
  • Computer Security & Cryptography (AREA)
  • Bioinformatics & Computational Biology (AREA)
  • Marketing (AREA)
  • Computer Vision & Pattern Recognition (AREA)
  • Bioinformatics & Cheminformatics (AREA)
  • Tourism & Hospitality (AREA)
  • General Business, Economics & Management (AREA)
  • Development Economics (AREA)
  • Game Theory and Decision Science (AREA)
  • Entrepreneurship & Innovation (AREA)
  • Operations Research (AREA)
  • Quality & Reliability (AREA)
  • Primary Health Care (AREA)
  • Computer Hardware Design (AREA)
  • Information Retrieval, Db Structures And Fs Structures Therefor (AREA)
  • Management, Administration, Business Operations System, And Electronic Commerce (AREA)

Abstract

The invention provides a prediction method for information virologic propagation in a social network, which can judge whether an attention theme can be developed into virologic propagation or not, and comprises the steps of collecting forwarded time and evaluation content of the attention theme, constructing a propagation event, slicing according to time sequence, extracting characteristics, splicing obtained propagation magnitude characteristics and emotion ratio characteristics, inputting a first CNN filter model for learning, obtaining first fusion characteristics, splicing semantic evolution characteristics in each time slice, and inputting a Bi-LSTM network model to obtain second fusion characteristics; splicing the obtained first fusion characteristic and the second fusion characteristic, inputting the first fusion characteristic and the second fusion characteristic into a second CNN filter model for learning, and obtaining a third fusion characteristic; and constructing a time sequence prediction model, inputting the third fusion characteristics into the trained time sequence prediction model, outputting the prediction probability that the concerned subject becomes viral propagation, and judging that the concerned subject can be developed into viral propagation when the prediction probability is greater than a prediction threshold.

Description

Prediction method and device for viral propagation of network information in social network
Technical Field
The invention relates to the technical field of data mining and social network public opinion analysis, in particular to a prediction method, a prediction device and a storage medium for information viral propagation in a social network.
Background
With the rapid development of the internet, events in the social network are transmitted in the network by taking information as a carrier, the transmission and growth rate of the events becomes an evaluation index of social public sentiment, and the information transmission is accelerated too fast like virus infection and becomes a public sentiment event. Any message source in the network can become a source point for causing public sentiment events, and is forwarded in a large amount in a short time like viruses, for example, information which is easy to cause social disputes, such as network emergencies, judicial incidents, economic events, safety events and the like, is more easily and widely spread, and even becomes a 'black swan' event which causes bad social influence.
Viral transmission of network information refers to the transmission of information in the internet in the form of viruses, which cause widespread transmission in a short time. The information often causes certain influence in the network and even the society, and the virus of the predicted network information can be effectively discovered as soon as possible to be an event of network public opinion, so as to intervene the network event as soon as possible to change the propagation form of the social event.
At present, the research on information transmission virosis is mainly performed by analyzing the characteristics of an information transmission network, including the topological structure of the transmission network, the characteristics of transmission nodes, the characteristics of transmission time, and the like. And then using the characteristics to classify the scale of the spread through a machine learning model to judge whether the predicted information can spread like viruses.
However, in the actual application process, the mainstream social network media website can limit crawling of user relationship data, so that global network structure data is difficult to obtain, hidden user relationships (such as user relationship networks) cannot be obtained, and the current situation that the effect of the existing algorithm in actual application is poor and the prediction result is inaccurate is caused.
If the network structure of information transmission can not be obtained, a small amount of effective transmission characteristics are utilized to predict the virus of information transmission, the performance similar to that under the condition of knowing the user relationship network is achieved, and the method has important significance for early discovery of public sentiment events.
Disclosure of Invention
The invention aims to provide a method for predicting viral propagation of information in a social network, and solves the existing problems.
The technical scheme is as follows: a method for predicting viral propagation of information in a social network comprises the following steps:
step 1: collecting propagation data corresponding to the concerned subject in the social network media information according to the concerned subject, wherein the collected propagation data comprise forwarded time and evaluation content of the concerned subject, and constructing a propagation event through the propagation data;
step 2: slicing each propagation event according to a time sequence respectively to obtain a plurality of time slices of sub-events containing the propagation events, taking out viral propagation characteristics based on the time sequence from each sub-event respectively and performing vector representation, wherein the viral propagation characteristics based on the time sequence comprise propagation magnitude characteristics, emotion ratio characteristics and semantic evolution characteristics;
and step 3: splicing the obtained propagation magnitude characteristic and the emotion ratio characteristic to obtain a spliced characteristic, inputting the spliced characteristic into a first CNN filter model for learning to obtain a first fusion characteristic, wherein the first fusion characteristic is expressed in a vector form;
and 4, step 4: splicing the semantic evolution characteristics in each time slice by taking the time slice as separation to obtain spliced semantic evolution characteristics, inputting the spliced semantic evolution characteristics into a Bi-LSTM network model to obtain second fusion characteristics, wherein the second fusion characteristics are expressed in a vector form;
and 5: splicing the obtained first fusion characteristic and the second fusion characteristic to obtain an information propagation mixed characteristic, wherein the first fusion characteristic is represented in a vector form; inputting the information propagation mixed feature into a second CNN filter model for learning to obtain a third fusion feature, wherein the third fusion feature is expressed in a vector form;
step 6: constructing a time sequence prediction model, wherein the time sequence prediction model comprises a full connection layer and a logic classification layer which are sequentially arranged, setting a training set training model until convergence, obtaining a trained time sequence prediction model, inputting a third fusion characteristic into the trained time sequence prediction model, and outputting a prediction probability that an attention topic becomes viral propagation;
and 7: and setting a prediction threshold, comparing the output prediction probability with the prediction threshold, and judging that the concerned subject can be in a virus propagation state when the prediction probability is greater than the threshold.
Further, in step 1, according to the concerned subjects of different supervision contents, the propagation data of the concerned subjects on the social network media is collected, the time t when the propagation data are propagated and the evaluation content c are obtained, and the propagation data I is obtainedp＝[(t,c)]Representing a binary set of evaluation content and time of the p-th propagation data, and constructing a social network media information propagation event EiIs shown as Ei＝[I1.I2,…Ip]P ∈ N: wherein i, N and p are non-zero natural numbers.
Further, for the propagation data IpHaving t of0And c0Respectively representing the original propagated time and the original evaluation content, and if the user is only forwarding the blog text and has no new evaluation content, then c is equal to c0。
Further, the step 2 specifically comprises the following steps:
step 201: within a set observation duration, slicing each propagation event according to a time sequence to obtain a plurality of time slices, taking each time slice as a sub-event of the propagation event, wherein the propagation event is represented as:
Ei＝[e0,e1...em]
wherein E isiRepresenting different propagation events, emTo propagate sub-events of an event on a time slice, m denotes the end of the observation time of the propagating event, emExpressed as:
Figure BDA0003022071090000031
wherein
Figure BDA0003022071090000032
Is a sub-event e of a time slice mmJ represents a different feature type,
Figure BDA0003022071090000033
a matrix of real numbers expressed as dimension (n, z);
step 202: and (3) construction of a propagation magnitude characteristic: expressed by extracting the number of propagation times within a time slice:
Cd＝[c1,c2,...cm]
wherein c ismRepresenting the total forwarded times in the time slice m and representing the propagation magnitude characteristic in the time slice m;
step 203: construction of emotional ratio characteristics: adopting a pre-trained emotion analysis model to predict emotion polarity of the evaluation content of the propagation event in each time slice, and obtaining emotion ratio characteristics, wherein the emotion ratio characteristics are expressed as:
Ce＝[r1,r2...,rm]
Figure BDA0003022071090000034
wherein: r ismRepresenting the affective ratio features within time slice m,
Figure BDA0003022071090000035
representing a time slice tiThe s pieces of information in (1) are positive emotions, psThe fixed value is 1 and the fixed value is,
Figure BDA0003022071090000036
representing negative emotions, nsThe fixed value is-1, and the count is a counter for counting the occurrence times;
step 204: constructing semantic evolution characteristics: extracting top with highest word frequency from evaluation contents of propagation events of each time slicenA keyword for representing key semantic features in the time slice, and performing word embedding through a semantic embedding model word2vecExpressed as:
Cs＝[X1,X2...,Xm],X∈Rd×n,0≤t≤m
Figure BDA0003022071090000037
Csfor semantically evolving features, xmAn embedded representation representing the keywords in time slice m,
Figure BDA0003022071090000038
the term "v" represents the nth keyword in time slice m, W represents the corpus, and T represents the feature words in the corpus.
The step 3 specifically comprises the following steps:
step 301: to propagation metric feature CdTo emotional ratio feature CeA splicing operation is performed, represented as:
hc＝[cm||rm]
i is the splicing operation, hcFor the stitching feature, a pair propagation metric feature C is representeddTo emotional ratio feature CmThe splicing is based on different feature vectors in a time window splicing window, cmIs a propagation magnitude feature within a time slice m, rmRepresenting the emotional ratio characteristics in a time slice m;
step 302: inputting the splicing characteristics into a first CNN filter model, wherein the first CNN filter model comprises n CNN filters, and the output of the first CNN filter model is represented as:
fi(hc)＝σ(Wihc+bi)
wherein f isi(hc) Representing the output of the ith filter in the first CNN filter model, Wi,biIs the trainable parameter of the ith filter, sigma is a nonlinear activation function, i is equal to n, and the step sizes of n CNN filters are different.
Step 303: a first fusion signature is obtained from the sum-and-average of the outputs of the multiple CNN filters of the first CNN filter model, and is represented as:
Figure BDA0003022071090000041
wherein n represents the number of filters, f1(hc) A vector representation representing the first fused feature;
further, step 4 specifically includes the following steps:
step 401: the time slices are used as partitions, and a fixed number of keywords are extracted from each time slice for splicing, and the keyword splicing is represented as:
Figure BDA0003022071090000042
wherein XmRepresenting the top at different time slices mnAnd (3) representation of each feature word, | | | represents splicing operation.
Step 402: for different time slices, the semantic evolution characteristic h of the splicingsInputting a Bi-LSTM network model to obtain a second fusion characteristic:
Figure BDA0003022071090000043
wherein f is2(hs) For the embedded representation of the second fusion feature, slice represents the number of time slices, W represents the learning parameter of the Bi-LSTM network model, the operator | | | represents the concatenation,
Figure BDA0003022071090000051
and
Figure BDA0003022071090000052
respectively LSTM methods in different directions.
Further, the step 5 specifically includes the following steps:
step 501: and splicing the obtained first fusion characteristic and the second fusion characteristic to obtain an information propagation mixed characteristic which is expressed as:
hd＝[f2(hs)||f1(hc)]
wherein h isdFor information propagation blending features represented in vector form, | | represents a stitching operation.
Step 502: inputting the splicing characteristics into a second CNN filter model to obtain third fusion characteristics, wherein the second CNN filter model comprises n CNN filters and is represented as follows:
fi(hd)＝σ(Wihd+bi)
same algorithm as step 302, fi(hd) Representing the output of the ith filter in the second CNN filter model, Wi,biIs the trainable parameter of the ith filter, sigma is a nonlinear activation function, i is equal to n, and the step sizes of n CNN filters are different. In this embodiment, the step sizes of the 2 CNN filters are different, and one step size is 2 and the other is 3, so as to learn the feature dependence relationships with different lengths in the time sequence.
The output of the second CNN filter model is represented as:
Figure BDA0003022071090000053
wherein f isi(hd) Represents the output of the ith filter in the second CNN filter model, i belongs to n, the step lengths of n CNN filters are different, f3(hd) Representing a third fused feature obtained by summing and averaging the outputs of the n CNN filters of the second CNN filter model.
Further, step 6 specifically includes the following steps:
step 601: constructing a time sequence prediction model, wherein the time sequence prediction model comprises a full connection layer and a logic classification layer which are sequentially arranged, outputting prediction probability that an attention topic becomes viral propagation, and the prediction probability is expressed as follows:
h(c)＝softmax(Wf3(hd)+b)
h (c) is a table in vector formThe final propagation representation feature extracted from the propagation data represents the predicted probability that the subject of interest will become viral propagation, Wf3(hd) + b represents a fully connected layer, W, b are trainable parameters of the time series prediction model, and softmax represents a logical classification algorithm;
step 602: setting an index tau of information transmission virus, wherein the index tau represents a threshold value of a virus index, namely information of which the total transmission amount exceeds the threshold value within the observation time m is marked as a positive sample, namely label is 1, and conversely, the index tau is marked as a negative sample, namely label is 0;
constructing a training set by the method in the step 1, and adding a label to each propagation event for the training set to obtain a training set with labels, which is expressed as follows:
I＝[yi＝label],i∈N,lable∈[0,1]
wherein I represents a training set, yiThe real result indicates whether the ith piece of information is transmitted by virus, N indicates a sample set of information transmission, if label is 0, the sample is not transmitted by virus, otherwise, if label is 1, the sample is transmitted by virus;
step 603: and (3) training a constructed time sequence prediction model through data of a training set, comparing the final propagation expression characteristics with a true value, and optimizing a log-likelihood loss function by using a gradient descent method, wherein the log-likelihood loss function is expressed as follows:
Figure BDA0003022071090000061
where loss is the loss function, h (c)i) Prediction probability, y, output for a time series prediction modeliTraining the model parameters of the time sequence prediction model by using a back propagation algorithm as an actual result, and performing training iteration on the time sequence prediction model through a training set until the model converges to obtain a trained time sequence prediction model;
step 604: and inputting the third fusion characteristics corresponding to the concerned subject to be predicted into the trained time sequence prediction model, and outputting the prediction probability that the concerned subject becomes viral propagation.
A computer device comprising a memory and a processor, wherein the memory stores a computer program, and the processor executes the computer program to implement the method for predicting viral propagation of information in a social network as described above.
A computer-readable storage medium, on which a program is stored, which, when executed by a processor, implements the method for predicting viral propagation of information in a social network as described above.
Compared with the prior art, the invention has the following advantages:
1. aiming at the condition that a network structure of information transmission cannot be obtained, namely the bottom layer relation of the transmission network is not considered, only the transmitted time and the evaluation content are obtained, the structure does not need to process relational graph data, the information transmission data are easy to obtain, the data processing capability is more efficient, and meanwhile, the user information does not need to be collected, so that the user privacy is effectively protected;
2. according to the method, the virus of the propagation event in the social media is modeled and predicted through a time sequence deep learning technology, the features in different time windows are fused through a deep learning method, potential connections among different features in different time intervals can be learned, stronger feature representation capability is obtained, whether the information is likely to become a virus propagation state is predicted, and finally a more reliable prediction result is obtained.
3. The invention utilizes the characteristics of semantic evolution in information transmission and has more reliable prediction accuracy aiming at social events with more aggregated semantics, so that different semantic problem models can be trained aiming at different social problems, and the problems in the semantic category can be better solved. The method can be used for monitoring events with more concentrated semantics, such as the prediction and supervision of economic problems, judicial problems, civil problems and the like, and also can be used for network information supervision of enterprises and predicting whether the information concerned by the enterprises can be widely spread.
Drawings
FIG. 1 is a schematic diagram illustrating steps of a method for predicting viral propagation of information in a social network according to the present invention;
FIG. 2 is a flowchart illustrating steps 1-6 of a method for predicting viral propagation of information in a social network according to the present invention;
FIG. 3 is a diagram illustrating an internal structure of a computing device according to an embodiment.
Detailed Description
The following detailed description of the embodiments of the present invention will be provided with reference to the drawings and examples, so that how to apply the technical means to solve the technical problems and achieve the technical effects can be fully understood and implemented. It should be noted that, as long as there is no conflict, the embodiments and the features of the embodiments of the present invention may be combined with each other, and the technical solutions formed are within the scope of the present invention.
Additionally, the steps illustrated in the flow charts of the figures may be performed in a computer system such as a set of computer-executable instructions and, although a logical order is illustrated in the flow charts, in some cases, the steps illustrated or described may be performed in an order different than here.
Referring to fig. 1, the method for predicting viral propagation of information in a social network of the present invention at least includes the following steps:
step 1: collecting propagation data corresponding to the concerned subject in the social network media information according to the concerned subject, wherein the collected propagation data comprise forwarded time and evaluation content of the concerned subject, and constructing a propagation event through the propagation data;
step 2: slicing each propagation event according to a time sequence respectively to obtain a plurality of time slices of sub-events containing the propagation events, taking out viral propagation characteristics based on the time sequence from each sub-event respectively and performing vector representation, wherein the viral propagation characteristics based on the time sequence comprise propagation magnitude characteristics, emotion ratio characteristics and semantic evolution characteristics;
and step 3: splicing the obtained propagation magnitude characteristic and the emotion ratio characteristic to obtain a spliced characteristic, inputting the spliced characteristic into a first CNN filter model for learning to obtain a first fusion characteristic, wherein the first fusion characteristic is expressed in a vector form;
and 4, step 4: splicing the semantic evolution characteristics in each time slice by taking the time slice as separation to obtain spliced semantic evolution characteristics, inputting the spliced semantic evolution characteristics into a Bi-LSTM network model to obtain second fusion characteristics, wherein the second fusion characteristics are expressed in a vector form;
and 5: splicing the obtained first fusion characteristic and the second fusion characteristic to obtain an information propagation mixed characteristic, wherein the first fusion characteristic is represented in a vector form; inputting the information propagation mixed feature into a second CNN filter model for learning to obtain a third fusion feature, wherein the third fusion feature is expressed in a vector form;
step 6: constructing a time sequence prediction model, wherein the time sequence prediction model comprises a full connection layer and a logic classification layer which are sequentially arranged, setting a training set training model until convergence, obtaining a trained time sequence prediction model, inputting a third fusion characteristic into the trained time sequence prediction model, and outputting a prediction probability that an attention topic becomes viral propagation;
and 7: and setting a prediction threshold, comparing the output prediction probability with the prediction threshold, and judging that the concerned subject can be in a virus propagation state when the prediction probability is greater than the threshold.
Referring to fig. 2, in particular, one embodiment of the present invention comprises the following steps:
step 1: collecting the propagation data of the concerned subject on the social network media according to the concerned subjects of different supervision contents, acquiring the time t for propagation of the propagation data and the evaluation content c, and obtaining the propagation data Ip＝[(t,c)]Representing a binary set of evaluation content and time of the p-th piece of propagation data, for propagation data IpHaving t of0And c0Respectively representing the original propagated time and the original evaluation content, and if the user is only forwarding the blog text and has no new evaluation content, then c is equal to c0Through a large amount of data collection, each information transmission sequence is regarded as a transmission event, and a social network media information transmission event E is constructediIs shown as Ei＝[I1.I2,…Ip]P ∈ N: wherein i, N and p are non-zero natural numbers.
Step 2, specifically comprising the following steps:
step 201: for one propagation event, an observation time duration is set, which is defined as2 hours in this embodiment, each propagation event is sliced in time sequence within one set observation time duration, in this embodiment, the number of time slices is defined as 40, 40 time slices are obtained, each time slice is taken as a sub-event of the propagation event, and the propagation event is expressed as:
Ei＝[e0,e1...em]
wherein E isiRepresenting different propagation events, emTo propagate sub-events of an event on a time slice, m denotes the end of the observation time of the propagating event, EiSub-event e ofmIs expressed as:
Figure BDA0003022071090000081
wherein
Figure BDA0003022071090000082
Is a sub-event e of a time slice mmJ represents different feature types and respectively comprises propagation magnitude features, semantic evolution features and vectorization representations of emotion ratio features, the construction methods of the features are defined in the subsequent steps,
Figure BDA0003022071090000091
a matrix of real numbers expressed as dimension (n, z);
step 202: constructing a propagation magnitude characteristic: the propagation magnitude features are represented by extracting the propagation times in the time slice:
Cd＝[c1,c2,...cm]
wherein c ismRepresents a time slice mThe total number of intermediate-to-intermediate forwarded times represents the propagation magnitude characteristic in the time slice m;
step 203: by using the pre-trained emotion analysis model, in this embodiment, the emotion analysis pre-trained model with better current performance, such as a centa model, a Bert pre-trained model, and a GPT2 emotion analysis model proposed by Baidu, is used to perform emotion polarity prediction on the evaluation content of the propagation event in each time slice, so as to obtain an emotion ratio feature, which is expressed as:
Ce＝[r1,r2...,rm]
Figure BDA0003022071090000092
wherein: r ismRepresenting the affective ratio features within time slice m,
Figure BDA0003022071090000093
representing a time slice tiThe s pieces of information in (1) are positive emotions, psThe fixed value is 1 and the fixed value is,
Figure BDA0003022071090000094
representing negative emotions, nsThe fixed value is-1, count is a counter for calculating the occurrence times, and the emotion ratio is a binary group and represents the opposition degree of emotion in the time window;
step 204: the semantic evolution characteristics are constructed in the following way:
for viral propagation, variation of topic semantics can cause propagation variation, and top with the highest word frequency is extracted from the evaluation content of the propagation event of each time slicenA keyword, configured to represent a key semantic feature in the time slice, and perform word embedding through a semantic embedding model word2vec, where the keyword is represented as:
Cs＝[X1,X2...,Xm],X∈Rd×n,0≤t≤m
Figure BDA0003022071090000095
Csfor semantically evolving features, xmAn embedded representation representing the keywords in time slice m,
Figure BDA0003022071090000096
the term "W" represents the "v" keyword in the time slice m, and the term "W" represents the corpus, which may be a large-scale public Chinese corpus, such as wikipedia Chinese word stock, and "T" represents the feature words in the corpus. In addition, if the number of samples in a time slice is insufficient to topnAnd zero filling operation is required to be carried out on the insufficient part, and the length of the feature vector is ensured to be consistent through the zero filling operation.
The step 3 specifically comprises the following steps:
step 301: to propagation metric feature CdTo emotional ratio feature CeA splicing operation is performed, represented as:
hc＝[cm||rm]
i is the splicing operation, hcFor the stitching feature, a pair propagation metric feature C is representeddTo emotional ratio feature CmThe splicing is based on different feature vectors in a time window splicing window, cmIs a propagation magnitude feature within a time slice m, rmRepresenting the emotional ratio characteristics in a time slice m;
step 302: inputting the splicing characteristics into a first CNN filter model, where the first CNN filter model includes n CNN filters, specifically in this implementation, the number of the set CNN filters is 2, and the output of the first CNN filter model is represented as:
fi(hc)＝σ(W ihc+bi)
wherein f isi(hc) Representing the output of the ith filter in the first CNN filter model, Wi,biIs the trainable parameter of the ith filter, σ is a nonlinear activation function, i ∈ n, in this embodiment, the step lengths of 2 CNN filters are different, one step length selected is 2, and the other is 3, so as not to learn the timing sequenceIn other embodiments of the present invention, the first CNN filter model may also include a greater number of CNN filters, the step size of the CNN filter may also be selected from other sizes, and the CNN filter is a convolution kernel of CNN that is successfully trained and plays an important role in the network operation process.
Step 303: the dependencies between the subsequences are sampled by the different filters of the previous step 302, and then a first fused feature is obtained by summing and averaging the outputs of the multiple CNN filters of the first CNN filter model, which is expressed as:
Figure BDA0003022071090000101
wherein n represents the number of filters, f1(hc) A vector representation representing the first fused feature.
Step 4, the feature of semantic evolution in the information transmission process needs to be extracted, and the method specifically comprises the following steps:
step 401: taking time slices as partitions, extracting a fixed number of keywords in each time slice for splicing, and splicing the semantic information in each time slice, wherein the expression is as follows:
Figure BDA0003022071090000102
wherein XmRepresenting the top at different time slices mnAnd (3) representation of each feature word, | | | represents splicing operation.
Step 402: for different time slices, the semantic evolution characteristic h of the splicingsInputting a Bi-LSTM network model to obtain a second fusion characteristic:
Figure BDA0003022071090000111
wherein f is2(hs) Is an embedded representation of the second fused feature, slice representationThe number of inter-slices, W represents the learning parameters of the Bi-LSTM network model, the operator | | | represents the concatenation,
Figure BDA0003022071090000112
and
Figure BDA0003022071090000113
respectively LSTM methods in different directions. Step 402 learns the latent relationship of semantic evolution using a Bi-directional long-and-short memory network (Bi-LSTM) method, and the Bi-LSTM network model can aggregate ordered semantic information to obtain implicit associations of semantic evolution processes in different time periods.
And 5: the information propagation mixed features of the step 3 and the step 4 need to be fused, and the potential relation of the three features is extracted, which specifically comprises the following steps:
step 501: and splicing the obtained first fusion characteristic and the second fusion characteristic to obtain an information propagation mixed characteristic which is expressed as:
hd＝[f2(hs)||f1(hc)]
wherein h isdFor information propagation blending features represented in vector form, | | represents a stitching operation.
Step 502: inputting the splicing characteristics into a second CNN filter model to obtain third fusion characteristics, wherein the second CNN filter model comprises n CNN filters and is represented as follows:
fi(hd)＝σ(Wihd+bi)
same algorithm as step 302, fi(hd) Representing the output of the ith filter in the second CNN filter model, Wi,biIs the trainable parameter of the ith filter, sigma is a nonlinear activation function, i is equal to n, and the step sizes of n CNN filters are different. In this embodiment, the step sizes of the 2 CNN filters are different, and one step size is 2 and one step size is 3, so as to learn the feature dependency relationship of different lengths in the time sequenceOther sizes may be chosen, and the CNN filter is a convolution kernel of the CNN that is successfully trained and plays an important role in the network operation.
Likewise, the output of the second CNN filter model is represented as:
Figure BDA0003022071090000114
wherein f isi(hd) Represents the output of the ith filter in the second CNN filter model, i belongs to n, the step lengths of n CNN filters are different, f3(hd) Representing a third fused feature obtained by summing and averaging the outputs of the n CNN filters of the second CNN filter model.
The step 6 specifically comprises the following steps:
step 601: constructing a time sequence prediction model, wherein the time sequence prediction model comprises a full connection layer and a logic classification layer which are sequentially arranged, performing characteristic representation calculation of the full connection layer and the logic classification layer (softmax) on the result of the step 5, and outputting prediction probability that the concerned subject becomes viral propagation, and the prediction probability is expressed as:
h(c)＝softmax(W f3(hd)+b)
h (c) is a final propagation representation feature extracted from the propagation data in a vector form, representing the prediction probability that the subject of interest becomes viral propagation, Wf3(hd) + b represents a fully connected layer, W, b are trainable parameters of the time series prediction model, and softmax represents a logical classification algorithm;
step 602: setting an index tau of information transmission virus, wherein the index tau represents a threshold value of a virus index, namely information of which the total transmission amount exceeds the threshold value within the observation time m is marked as a positive sample, namely label is 1, and conversely, the index tau is marked as a negative sample, namely label is 0;
constructing a training set by the method in the step 1, and adding a label to each propagation event for the training set to obtain a training set with labels, which is expressed as follows:
I＝[yi＝label],i∈N,lable∈[0,1]
wherein I represents a training set, yiThe real result indicates whether the ith piece of information is transmitted by virus, N indicates a sample set of information transmission, if label is 0, the sample is not transmitted by virus, otherwise, if label is 1, the sample is transmitted by virus;
step 603: and (3) training a constructed time sequence prediction model through data of a training set, comparing the final propagation expression characteristics with a true value, and optimizing a log-likelihood loss function by using a gradient descent method, wherein the log-likelihood loss function is expressed as follows:
Figure BDA0003022071090000121
where loss is the loss function, h (c)i) Prediction probability, y, output for a time series prediction modeliTraining the model parameters of the time sequence prediction model by using a back propagation algorithm as an actual result, and performing training iteration on the time sequence prediction model through a training set until the model converges to obtain a trained time sequence prediction model;
step 604: inputting the third fusion characteristics corresponding to the concerned subject to be predicted into the trained time series prediction model, and outputting the prediction probability that the concerned subject becomes viral propagation, wherein the output prediction probabilities are 1 and 0 respectively, and respectively represent that the prediction can be developed into viral propagation and the prediction cannot be developed into viral propagation.
And 7: and setting a prediction threshold, comparing the output prediction probability with the prediction threshold, and judging that the concerned subject can be in a virus propagation state when the prediction probability is greater than the threshold.
In this embodiment, if the result of the prediction probability output is set to be greater than 0.5, it is determined as a positive example, that the information may be viral spread, whereas if the result is less than 0.5, the information may not progress to viral spread.
The traditional information propagation analysis is established on the basis of analysis of network user relationship, the underlying network relationship such as attention, forwarding, comment, mention, praise and the like between users needs to be acquired, and the future propagation magnitude of a certain piece of information is predicted by establishing a time sequence model. Different from the traditional information transmission analysis, the embodiment is established on the basis of the information transmission of an unknown network structure, namely, the bottom layer relation of the transmission network is not needed to be considered, three characteristics based on time sequence in the information transmission process are introduced at the same time, namely, a transmission magnitude characteristic, a positive and negative emotion ratio characteristic and a semantic evolution characteristic are respectively introduced, the dynamic change processes of the three characteristics become key characteristics influencing the information viral transmission, meanwhile, in the data sampling process, the embodiment ignores the information of a user, constructs the time sequence characteristic from the macroscopic data angle, the network information of the bottom layer user is not needed to be concerned, and the structure has two advantages:
(1) more efficient data processing capabilities. Because the construction of the network relationship generally needs to construct the complete relationship between graph data for a massive user population, for example, the relationship between users that concern each other, and the data of the graph structure is taken as non-euclidean spatial data, there is a problem of low efficiency in the operational level, it generally needs to use the process of graph node embedding to perform feature representation on each node in the graph, however, the task represented by the node needs to perform a large amount of neighbor aggregation work, but the embodiment only considers the structural (euclidean spatial) feature in the propagation process, and the operational efficiency is greatly improved, and experiments show that compared with the latest method of a known network, the method has a better classification performance index and is improved by 3.3%; compared with the latest Cas2vec method, our method has a performance improvement of 48.7% in training time efficiency.
(2) The privacy of the user is effectively protected. The unknown network does not need to collect the privacy information of the user and does not need to care about the information of the user, and in the three characteristics required by the embodiment, the unknown network is irrelevant to the information of the user, so that the purpose of privacy removal can be achieved, the privacy is protected, and the data is easier to obtain.
In the embodiment, through collecting non-network relationship data of information propagation in social media, a method of an unknown network structure is used, that is, the information propagation network bottom node relationship does not need to be considered, which means that the information propagation data is easy to obtain and privacy is removed, then a potential relationship of key feature fusion in the information propagation of the unknown network structure is obtained by using an innovative deep learning method, specifically, Bi-LSTM is used for modeling a semantic evolution process of information propagation, two CNN methods containing a plurality of convolution kernels are used for fusing different time sequence features, and finally, whether the information becomes a viral result is predicted by using a full connection layer and a softmax method. Through experiments of real data, compared with the latest Cas2vec, the method has the advantages that more key features are fused, the classification performance is remarkably improved, and a more reliable prediction result is obtained.
The embodiment models and predicts the viral of the propagation event in the social media through the deep learning technology of the time sequence, the method comprises constructing time sequence-based propagation magnitude characteristic, emotion ratio characteristic and semantic evolution characteristic, establishing vector representation of the characteristics in each time interval, then, the propagation magnitude characteristic and the emotion ratio characteristic are fused through a CNN network containing multiple convolution kernels, the multi-kernel method has the advantages that potential relations of different characteristics in different time intervals can be learned, and then, learning potential semantic changes in the information transmission process by using the advantages of the bidirectional LSTM (Bi-LSTM) in sequence relation representation, fusing the potential semantic changes with the previous characteristics by using a CNN (convolutional neural network) model of multiple convolution kernels, and finally predicting whether the information becomes viral results by using a full connection layer and a softmax method. Through ablation tests of real data, the performance difference of + 3.2% to + 7.7% between the virus prediction model without adding the emotion ratio characteristic and the semantic evolution characteristic and the result of fusing the three characteristics is verified. The method proves that the embodiment obtains stronger feature representation capability after feature fusion.
The embodiment utilizes the characteristics of semantic evolution in information propagation, and has more reliable prediction accuracy aiming at social events with more aggregated semantics, so that different semantic problem models can be trained aiming at different social problems, and the problems in semantic categories, such as economic problems, judicial problems, civil problems and the like, can be better solved.
The method provided by the embodiment can be used for the fields of online public sentiment event analysis and data mining, particularly for monitoring the prediction and supervision of events with centralized semantics, such as economic problems, judicial problems, civil problems and the like, and also can be used for network information supervision of enterprises and predicting whether the information concerned by the enterprises can be widely spread.
In an embodiment of the present invention, there is also provided a computer apparatus, including a memory and a processor, where the memory stores a computer program, and the processor, when executing the computer program, implements the method for predicting viral propagation of information in a social network as described above.
The computer apparatus may be a terminal, and its internal structure diagram may be as shown in fig. 3. The computer device comprises a processor, a memory, a network interface, a display screen and an input device which are connected through a bus. Wherein the processor of the computer device is configured to provide computing and control capabilities. The memory of the computer device comprises a nonvolatile storage medium and an internal memory. The non-volatile storage medium stores an operating system and a computer program. The internal memory provides an environment for the operation of an operating system and computer programs in the non-volatile storage medium. The network interface of the computer device is used for connecting and communicating with an external terminal through a network. The computer program is executed by a processor to implement a method for predicting viral propagation of information in a social network. The display screen of the computer device can be a liquid crystal display screen or an electronic ink display screen, and the input device of the computer device can be a touch layer covered on the display screen, a key, a track ball or a touch pad arranged on a shell of the computer device, an external keyboard, a touch pad or a mouse and the like.
The Memory may be, but is not limited to, a Random Access Memory (RAM), a Read Only Memory (ROM), a Programmable Read-Only Memory (PROM), an Erasable Read-Only Memory (EPROM), an electrically Erasable Read-Only Memory (EEPROM), and the like. The memory is used for storing programs, and the processor executes the programs after receiving the execution instructions.
The processor may be an integrated circuit chip having signal processing capabilities. The Processor may be a general-purpose Processor, and includes a Central Processing Unit (CPU), a Network Processor (NP), and the like. The Processor may also be other general purpose processors, Digital Signal Processors (DSPs), Application Specific Integrated Circuits (ASICs), Field Programmable Gate Arrays (FPGAs) or other Programmable logic devices, discrete Gate or transistor logic devices, discrete hardware components, etc. A general purpose processor may be a microprocessor or the processor may be any conventional processor or the like. The various methods, steps, and logic blocks disclosed in the embodiments of the present application may be implemented or performed. A general purpose processor may be a microprocessor or the processor may be any conventional processor or the like.
Those skilled in the art will appreciate that the configuration shown in fig. 3 is a block diagram of only a portion of the configuration associated with the present application and is not intended to limit the computing device to which the present application may be applied, and that a particular computing device may include more or less components than those shown, or may combine certain components, or have a different arrangement of components.
In an embodiment of the present invention, there is also provided a computer-readable storage medium, on which a program is stored, which when executed by a processor, implements the method for predicting viral propagation of information in a social network as described above.
As will be appreciated by one of skill in the art, embodiments of the present invention may be provided as a method, computer apparatus, or computer program product. Accordingly, embodiments of the present invention may take the form of an entirely hardware embodiment, an entirely software embodiment or an embodiment combining software and hardware aspects. Furthermore, embodiments of the present invention may take the form of a computer program product embodied on one or more computer-usable storage media (including, but not limited to, disk storage, CD-ROM, optical storage, and the like) having computer-usable program code embodied therein.
Embodiments of the present invention are described with reference to flowchart illustrations and/or block diagrams of methods, computer apparatus, or computer program products according to embodiments of the invention. These computer program instructions may be provided to a processor of a general purpose computer, special purpose computer, embedded processor, or other programmable data processing terminal to produce a machine, such that the instructions, which execute via the processor of the computer or other programmable data processing terminal, create means for implementing the functions specified in the flowchart and/or flowchart block or blocks.
These computer program instructions may also be stored in a computer-readable memory that can direct a computer or other programmable data processing terminal to function in a particular manner, such that the instructions stored in the computer-readable memory produce an article of manufacture including instruction means which implement the function specified in the flowchart.
The prediction method, the computer device, and the computer-readable storage medium for information viral propagation in social networks provided by the present invention are described in detail above, and specific examples are applied herein to illustrate the principles and embodiments of the present invention, and the description of the above embodiments is only used to help understand the method and the core ideas of the present invention; meanwhile, for a person skilled in the art, according to the idea of the present invention, there may be variations in the specific embodiments and the application scope, and in summary, the content of the present specification should not be construed as a limitation to the present invention.

Claims (10)

1. A method for predicting viral propagation of information in a social network is characterized by comprising the following steps:
step 1: collecting propagation data corresponding to the concerned subject in the social network media information according to the concerned subject, wherein the collected propagation data comprise forwarded time and evaluation content of the concerned subject, and constructing a propagation event through the propagation data;
step 2: slicing each propagation event according to a time sequence respectively to obtain a plurality of time slices of sub-events containing the propagation events, taking out viral propagation characteristics based on the time sequence from each sub-event respectively and performing vector representation, wherein the viral propagation characteristics based on the time sequence comprise propagation magnitude characteristics, emotion ratio characteristics and semantic evolution characteristics;
and step 3: splicing the obtained propagation magnitude characteristic and the emotion ratio characteristic to obtain a spliced characteristic, inputting the spliced characteristic into a first CNN filter model for learning to obtain a first fusion characteristic, wherein the first fusion characteristic is expressed in a vector form;
and 4, step 4: splicing the semantic evolution characteristics in each time slice by taking the time slice as separation to obtain spliced semantic evolution characteristics, inputting the spliced semantic evolution characteristics into a Bi-LSTM network model to obtain second fusion characteristics, wherein the second fusion characteristics are expressed in a vector form;
and 5: splicing the obtained first fusion characteristic and the second fusion characteristic to obtain an information propagation mixed characteristic, wherein the first fusion characteristic is represented in a vector form; inputting the information propagation mixed feature into a second CNN filter model for learning to obtain a third fusion feature, wherein the third fusion feature is expressed in a vector form;
step 6: constructing a time sequence prediction model, wherein the time sequence prediction model comprises a full connection layer and a logic classification layer which are sequentially arranged, setting a training set training model until convergence, obtaining a trained time sequence prediction model, inputting a third fusion characteristic into the trained time sequence prediction model, and outputting a prediction probability that an attention topic becomes viral propagation;
and 7: and setting a prediction threshold, comparing the output prediction probability with the prediction threshold, and judging that the concerned subject can be in a virus propagation state when the prediction probability is greater than the threshold.
2. The method of claim 1, wherein the method comprises: in step 1, according to the concerned subjects of different supervision contents, collecting the propagation data of the concerned subjects on the social network media, obtaining the time t when the propagation data are propagated and the evaluation content c, and obtaining the propagation data Ip＝[(t,c)]Representing a binary set of evaluation content and time of the p-th propagation data, and constructing a social network media information propagation event EiIs shown as Ei＝[I1.I2,…Ip]P ∈ N: wherein i, N and p are non-zero natural numbers.
3. The method of claim 2, wherein the method comprises: for the propagation data IpHaving t of0And c0Respectively representing the original propagated time and the original evaluation content, and if the user is only forwarding the blog text and has no new evaluation content, then c is equal to c0。
4. The method of claim 1, wherein the method comprises: the step 2 specifically comprises the following steps:
step 201: within a set observation duration, slicing each propagation event according to a time sequence to obtain a plurality of time slices, taking each time slice as a sub-event of the propagation event, wherein the propagation event is represented as:
Ei＝[e0,e1...em]
wherein E isiRepresenting different propagation events, emTo propagate sub-events of an event on a time slice, m denotes the end of the observation time of the propagating event, emExpressed as:
Figure FDA0003022071080000021
wherein
Figure FDA0003022071080000025
Is a sub-event e of a time slice mmJ represents a different feature type,
Figure FDA0003022071080000026
a matrix of real numbers expressed as dimension (n, z);
step 202: and (3) construction of a propagation magnitude characteristic: expressed by extracting the number of propagation times within a time slice:
Cd＝[c1,c2,...cm]
wherein c ismRepresenting the total forwarded times in the time slice m and representing the propagation magnitude characteristic in the time slice m;
step 203: construction of emotional ratio characteristics: adopting a pre-trained emotion analysis model to predict emotion polarity of the evaluation content of the propagation event in each time slice, and obtaining emotion ratio characteristics, wherein the emotion ratio characteristics are expressed as:
Ce＝[r1,r2...,rm]
Figure FDA0003022071080000022
wherein: r ismRepresenting the affective ratio features within time slice m,
Figure FDA0003022071080000023
representing a time slice tiThe s pieces of information in (1) are positive emotions, psThe fixed value is 1 and the fixed value is,
Figure FDA0003022071080000024
representing negative emotions, nsA fixed value of-1, count isA counter for counting the number of occurrences;
step 204: constructing semantic evolution characteristics: extracting top with highest word frequency from evaluation contents of propagation events of each time slicenA keyword, configured to represent a key semantic feature in the time slice, and perform word embedding through a semantic embedding model word2vec, where the keyword is represented as:
Cs＝[X1,X2...,Xm],X∈Rd×n,0≤t≤m
Figure FDA0003022071080000031
Csfor semantically evolving features, xmAn embedded representation representing the keywords in time slice m,
Figure FDA0003022071080000032
the term "v" represents the nth keyword in time slice m, W represents the corpus, and T represents the feature words in the corpus.
5. The method of claim 4, wherein the method comprises: the step 3 specifically comprises the following steps:
step 301: to propagation metric feature CdTo emotional ratio feature CeA splicing operation is performed, represented as:
hc＝[cm||rm]
i is the splicing operation, hcFor the stitching feature, a pair propagation metric feature C is representeddTo emotional ratio feature CmThe splicing is based on different feature vectors in a time window splicing window, cmIs a propagation magnitude feature within a time slice m, rmRepresenting the emotional ratio characteristics in a time slice m;
step 302: inputting the splicing characteristics into a first CNN filter model, wherein the first CNN filter model comprises n CNN filters, and the output of the first CNN filter model is represented as:
fi(hc)＝σ(Wihc+bi)
wherein f isi(hc) Representing the output of the ith filter in the first CNN filter model, Wi,biIs the trainable parameter of the ith filter, sigma is a nonlinear activation function, i belongs to n, and the step length of n CNN filters is different;
step 303: a first fusion signature is obtained from the sum-and-average of the outputs of the multiple CNN filters of the first CNN filter model, and is represented as:
Figure FDA0003022071080000033
wherein n represents the number of filters, f1(hc) A vector representation representing the first fused feature.
6. The method of claim 5, wherein the method comprises: the step 4 specifically comprises the following steps:
step 401: the time slices are used as partitions, and a fixed number of keywords are extracted from each time slice for splicing, and the keyword splicing is represented as:
Figure FDA0003022071080000041
wherein XmRepresenting the top at different time slices mnThe method comprises the following steps of (1) representing characteristic words, | | | represents splicing operation;
step 402: for different time slices, the semantic evolution characteristic h of the splicingsInputting a Bi-LSTM network model to obtain a second fusion characteristic:
Figure FDA0003022071080000042
wherein f is2(hs) For the embedded representation of the second fusion feature, slice represents the number of time slices, W represents the learning parameter of the Bi-LSTM network model, the operator | | | represents the concatenation,
Figure FDA0003022071080000043
and
Figure FDA0003022071080000044
respectively LSTM methods in different directions.
7. The method of claim 6, wherein the method comprises: the step 5 specifically comprises the following steps:
step 501: and splicing the obtained first fusion characteristic and the second fusion characteristic to obtain an information propagation mixed characteristic which is expressed as:
hd＝[f2(hs)||f1(hc)]
wherein h isdFor information propagation mixed features expressed in a vector form, | | represents splicing operation;
step 502: inputting the splicing characteristics into a second CNN filter model to obtain third fusion characteristics, wherein the second CNN filter model comprises n CNN filters and is represented as follows:
fi(hd)＝σ(Wihd+bi)
fi(hd) Representing the output of the ith filter in the second CNN filter model, Wi,biIs the trainable parameter of the ith filter, sigma is a nonlinear activation function, i belongs to n, and the step length of n CNN filters is different;
the output of the second CNN filter model is represented as:
Figure FDA0003022071080000045
wherein f isi(hd) Is shown asThe output of the ith filter in the two CNN filter models, i belongs to n, the step lengths of the n CNN filters are different, f3(hd) Representing a third fused feature obtained by summing and averaging the outputs of the n CNN filters of the second CNN filter model.
8. The method of claim 7, wherein the method comprises: the step 6 specifically comprises the following steps:
step 601: constructing a time sequence prediction model, wherein the time sequence prediction model comprises a full connection layer and a logic classification layer which are sequentially arranged, outputting prediction probability that an attention topic becomes viral propagation, and the prediction probability is expressed as follows:
h(c)＝softmax(Wf3(hd)+b)
h (c) is a final propagation representation feature extracted from the propagation data in a vector form, representing the prediction probability that the subject of interest becomes viral propagation, Wf3(hd) Representing a full connection layer, W, b are trainable parameters of a time series prediction model, and softmax represents a logic classification algorithm;
step 602: setting an index tau of information transmission virus, wherein the index tau represents a threshold value of a virus index, namely information of which the total transmission amount exceeds the threshold value within the observation time m is marked as a positive sample, namely label is 1, and conversely, the index tau is marked as a negative sample, namely label is 0;
constructing a training set by the method in the step 1, and adding a label to each propagation event for the training set to obtain a training set with labels, which is expressed as follows:
I＝[yi＝label],i∈N,lable∈[0,1]
wherein I represents a training set, yiThe real result indicates whether the ith piece of information is transmitted by virus, N indicates a sample set of information transmission, if label is 0, the sample is not transmitted by virus, otherwise, if label is 1, the sample is transmitted by virus;
step 603: and (3) training a constructed time sequence prediction model through data of a training set, comparing the final propagation expression characteristics with a true value, and optimizing a log-likelihood loss function by using a gradient descent method, wherein the log-likelihood loss function is expressed as follows:
Figure FDA0003022071080000051
where loss is the loss function, h (c)i) Prediction probability, y, output for a time series prediction modeliTraining the model parameters of the time sequence prediction model by using a back propagation algorithm as an actual result, and performing training iteration on the time sequence prediction model through a training set until the model converges to obtain a trained time sequence prediction model;
step 604: and inputting the third fusion characteristics corresponding to the concerned subject to be predicted into the trained time sequence prediction model, and outputting the prediction probability that the concerned subject becomes viral propagation.
9. A computer apparatus comprising a memory and a processor, the memory storing a computer program, characterized in that: the processor, when executing the computer program, implements the method for predicting viral propagation of information in a social network as set forth in claim 1.
10. A computer-readable storage medium on which a program is stored, characterized in that: the program, when executed by a processor, implements a method for predicting viral propagation of information in a social network as set forth in claim 1.
CN202110405406.8A 2021-04-15 2021-04-15 Prediction method and device for viral propagation of network information in social network Active CN112948825B (en)

Priority Applications (1)

Application Number Priority Date Filing Date Title
CN202110405406.8A CN112948825B (en) 2021-04-15 2021-04-15 Prediction method and device for viral propagation of network information in social network

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
CN202110405406.8A CN112948825B (en) 2021-04-15 2021-04-15 Prediction method and device for viral propagation of network information in social network

Publications (2)

Publication Number Publication Date
CN112948825A true CN112948825A (en) 2021-06-11
CN112948825B CN112948825B (en) 2022-09-13

Family

ID=76232729

Family Applications (1)

Application Number Title Priority Date Filing Date
CN202110405406.8A Active CN112948825B (en) 2021-04-15 2021-04-15 Prediction method and device for viral propagation of network information in social network

Country Status (1)

Country Link
CN (1) CN112948825B (en)

Citations (4)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN111581983A (en) * 2020-05-13 2020-08-25 中国人民解放军国防科技大学 Method for predicting social concern hotspots in network public opinion events based on group analysis
CN112183881A (en) * 2020-10-19 2021-01-05 中国人民解放军国防科技大学 Public opinion event prediction method and device based on social network and storage medium
CN112182423A (en) * 2020-10-14 2021-01-05 重庆邮电大学 Information propagation evolution trend prediction method based on attention mechanism
CN112418269A (en) * 2020-10-23 2021-02-26 西安电子科技大学 Method, system and medium for predicting social media network event propagation key time

Patent Citations (4)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN111581983A (en) * 2020-05-13 2020-08-25 中国人民解放军国防科技大学 Method for predicting social concern hotspots in network public opinion events based on group analysis
CN112182423A (en) * 2020-10-14 2021-01-05 重庆邮电大学 Information propagation evolution trend prediction method based on attention mechanism
CN112183881A (en) * 2020-10-19 2021-01-05 中国人民解放军国防科技大学 Public opinion event prediction method and device based on social network and storage medium
CN112418269A (en) * 2020-10-23 2021-02-26 西安电子科技大学 Method, system and medium for predicting social media network event propagation key time

Non-Patent Citations (1)

* Cited by examiner, † Cited by third party
Title
于海等: "基于在线社交网络事件库多因素耦合的流行度预测方法", 《天津大学学报(自然科学与工程技术版)》 *

Also Published As

Publication number Publication date
CN112948825B (en) 2022-09-13

Similar Documents

Publication Publication Date Title
US10664757B2 (en) Cognitive operations based on empirically constructed knowledge graphs
Lytvyn et al. Methods of building intelligent decision support systems based on adaptive ontology
WO2020001373A1 (en) Method and apparatus for ontology construction
Snyder et al. Interactive learning for identifying relevant tweets to support real-time situational awareness
CN111581983A (en) Method for predicting social concern hotspots in network public opinion events based on group analysis
Lubis et al. The effect of the TF-IDF algorithm in times series in forecasting word on social media
CN111104518A (en) System and method for building an evolving ontology from user-generated content
CN112711705B (en) Public opinion data processing method, equipment and storage medium
CN113449204B (en) Social event classification method and device based on local aggregation graph attention network
CN113139134B (en) Method and device for predicting popularity of user-generated content in social network
CN112183881A (en) Public opinion event prediction method and device based on social network and storage medium
CN116307672A (en) Fault diagnosis method, device, electronic equipment and medium
Costa et al. Adaptive learning for dynamic environments: A comparative approach
Sun et al. Conversational structure aware and context sensitive topic model for online discussions
Liu et al. Understanding information diffusion with psychological field dynamic
Wang et al. Discerning edge influence for network embedding
CN112948825B (en) Prediction method and device for viral propagation of network information in social network
CN114818682A (en) Document level entity relation extraction method based on self-adaptive entity path perception
Vrunda et al. Sentimental analysis of Twitter data and Comparison of covid 19 Cases trend Using Machine learning algorithms
CN113722484A (en) Rumor detection method, device, equipment and storage medium based on deep learning
Xuan et al. COVID-19 Fake News Detection Model on Social Media Data Using Machine Learning Techniques
Zhang et al. Roar: Robust label ranking for social emotion mining
CN111428118B (en) Method for detecting event reliability and electronic equipment
CN111797945B (en) Text classification method
Fang Deep Learning Techniques for Fake News Detection

Legal Events

Date Code Title Description
PB01 Publication
PB01 Publication
SE01 Entry into force of request for substantive examination
SE01 Entry into force of request for substantive examination
GR01 Patent grant
GR01 Patent grant