Discrete Dynamics in Nature and Society

Discrete Dynamics in Nature and Society / 2020 / Article
Special Issue

Dynamical Modeling, Analysis, and Control of Information Diffusion over Social Networks

View this Special Issue

Research Article | Open Access

Volume 2020 |Article ID 9352153 | https://doi.org/10.1155/2020/9352153

Yu Wu, Yan Zeng, Jie Yang, Zhenni Zhao, "Weibo Rumor Recognition Based on Communication and Stacking Ensemble Learning", Discrete Dynamics in Nature and Society, vol. 2020, Article ID 9352153, 12 pages, 2020. https://doi.org/10.1155/2020/9352153

Weibo Rumor Recognition Based on Communication and Stacking Ensemble Learning

Academic Editor: Wei Wang
Received05 Jun 2020
Revised23 Aug 2020
Accepted02 Sep 2020
Published18 Sep 2020

Abstract

Research on the identification of rumors in cyberspace helps to discover social issues that are of concern to the public and are not easily found, and it also can help to purify cyberspace and to maintain social stability. However, the real complexity of rumors makes it difficult for its recognition technology to bridge the semantic gap between qualitative description and quantitative calculation of rumors. Firstly, the existing rumor definitions are mostly qualitative descriptions, so we propose a technical definition of Internet rumors to facilitate quantitative calculations. Secondly, since the feature set used in rumor recognition research is not effective, by combining with communication, we construct a more suitable feature set for rumor recognition. Thirdly, aiming at the problem that traditional classification algorithms are not suitable for complex rumor information recognition, a rumor recognition method based on Stacking ensemble learning is proposed. Our experiment results show that the proposed method has higher accuracy, less algorithm execution time, and better practical application effect.

1. Introduction

Nowadays, the Internet is full of various information like Internet rumors, malware, and fake news, and it is difficult for people to tell the truth of that information. With the development of cyberspace, the researches on Internet misinformation have gradually mainly focused on Internet rumor recognition, Internet rumor propagation, malware and virus propagation, fake news detection, and water army detection.

The research on malware and virus propagation focused on modeling the spread of malicious malware to predict the spreading behaviour of it [1], while the research on water army is mainly about detecting water army among a large number of social media users in an online topic and preventing the negative effect on the development of the public opinion [2]. The spread of rumors may affect personal reputation, invade public privacy, or cause chaos in public order, lead to group events, and endanger the stability of the country. Therefore, modeling the propagation of Internet rumors in social network to help control the spread of the misinformation is of great importance [3]. However, it is also vital to figure out what are Internet rumors and how to recognize them in a more effective way.

In paper [4], Peterson et al. proposed that rumor, in general, refers to an unverified account or explanation of events, circulating from person to person and pertaining to an object, event, or issue of public concern. Since then, rumors have been given some specific characteristics, such as ambiguity, transmissibility, and timeliness. With the development of the Internet, the spread of information has accelerated, and Internet rumors are derived. In paper [5], Chao et al. considered that Internet rumors were unconfirmed information transmitted by Internet users in specific ways. Most scholars believe that the spread of Internet rumors is carried out on the Internet, because the network connection is wide and arbitrary, which makes the spread of Internet rumors faster, the coverage of influence wider, and the extent of damage bigger [6]. However, the existing definitions cannot accurately describe the technical characteristics of Internet rumors and other elements from the perspective of computability.

At present, on the one hand, the research on Internet rumors recognition focuses on extracting feature set that can be used to detect rumors. On the other hand, the classification modeling of Internet rumors, which does not need various features but a large amount of data, has become a research hotspot. However, feature selection of Internet rumors is more suitable for a small number of datasets.

The feature set used in current Internet rumor recognition is based on the features proposed by Castillo et al. [7] and Qazvinian et al. [8]. Generally, the feature set is divided into three types: content feature, user feature, and propagation feature; sometimes it is further subdivided into time feature, network feature, and combination of the two. These features are usually simple statistical characteristics, and the deep semantics of the text information are not mined. Therefore, the recognition accuracy is affected by the lack of key features. In paper [9], Kwon et al. applied RNN to learn the deep meaning between messages. Based on the protection mechanism, Chen et al. [10] proposed a new RNN model to recognize the Internet rumor by using time sequence to obtain the potential contextual change. Although the neural network model can overcome the problem of sparse features by using continuous vectors to represent text, it has too many parameters and slow convergence speed and needs a lot of corpus.

The classification algorithms often used in rumor recognition research include SVM, Decision Tree, Naive Bayes, and Neural Networks. For example, in paper [11], Duan et al. used SVM to detect fake information from the comment perspective of the source Weibo. In paper [12], Chen et al. used the regression method to recognize the online food safety rumors. However, this method is limited by the topic type of the rumor and can only determine whether the article is related to the rumor. In paper [13], Lu et al. proposed an improved method based on the Co-Forest algorithm, which improved the accuracy of prediction for unlabelled samples, to solve the problem of data imbalance.

Due to the fact that the dataset is difficult to obtain, the current research tends to extract the statistical characteristics of text information. Moreover, new experimental methods in which features are added on the basis of previous researches make the feature dimension continuously increase and lead to the inaccurate model parameter. Besides, classical algorithms such as SVM, Decision Tree, and Naive Bayes are no longer suitable for recognizing Internet information with complex content. In specific problems and scenarios, each model has its advantages and disadvantages. The results of recognition might be better by combining the advantages of multiple models [14]. For example, in paper [15], Xie et al. proposed a high-precision EEG emotion recognition model by integrating LightGBM, XGBoost, and Random Forest. In paper [16], Duan et al. classified the sentiment of Weibo text by using the Stacking ensemble learning method, and the accuracy rate was as high as 93%.

In this paper, we give the definition of Internet rumor based on communication’s 5W Formula, and three characteristics of User Credibility, Emotional Consistency, and Regional Correlation are constructed. Then, we verify the validity of the feature by using Chi-square, so as to better filter the feature set. Finally, analysing the existing classification algorithms, adopting the Stacking ensemble learning, we propose a rumor recognition method combined with different models and optimized using cross validation. Finally, the experiments are conducted among different methods and datasets.

The structure of this paper is as follows: the related work is introduced in the first part. The design of the Stacking model, which includes features construction and selection, and the construction of the model are described in the second part. In the third part, we conduct the experiments and analyse the results. The conclusion of this paper and the introduction of future work are given in the last part.

2.1. Ensemble Learning and Stacking

For different problems, the speed, accuracy, and generalization ability of machine learning models are different. To obtain a model with strong generalization ability and high robustness, the ensemble learning method is proposed. The current mainstream methods are Boosting (typically AdaBoost, GBDT, and XGBoost), Bagging (typically Random Forest), and Stacking. The Stacking model applied in this paper has a layered framework. The original training dataset is inputted into multiple primary learners in the first layer, and the first layer’s prediction results are used as the input training set for the next layer of learners. Finally, the prediction results obtained in the previous layer are inputted into the final metalearners to get the final prediction result (see Figure 1).

2.2. Other Methods

SVM [17] is a binary classification model that uses the margin maximization strategy. It minimizes the structured risk, the empirical risk, and confidence range to improve the generalization ability. Therefore, in a small statistical dataset, it can also get good statistical regularity.

Decision Tree J48 [8] is based on C4.5. It uses a divide-and-conquer strategy and has high credibility; and its results are easy to understand.

Random Forest [18] is one of the ensemble learning methods. By combining multiple weak classifiers, the final result is obtained by voting or calculating mean value. The model has high accuracy and generalization performance.

Logistic regression [19] is one of the generalized linear models, as well as a classical classification method used to solve the optimization problem with the likelihood function as the objective function.

3. Weibo Rumor Recognition

3.1. Rumor Definition

Based on the existing rumor definitions, this paper combines the 5W’s of communication to divide the elements of rumor transmission into communicators, content, objects, effects, and channels. The communicator could be an individual or an organization. The content is the information that the communicator wants to pass to the audience. The object is the receiver of information or the communicator of information processing. The effect is that the audience is affected by the message sent by the communicator, causing changes in their ideas, behaviours, and so forth. The channel is the mean by which communication is achieved. Sometimes the object of Internet rumors is also the communicator, so we combine them as the same element for analysis. Therefore, the qualitative definition of Internet rumor given in this paper is shown in Definition 1.

Definition 1. Internet rumors: internet rumors refer to the information published by Internet users through online media platforms, which is ambiguous in content, unconfirmed by the official, and to some extent harmful to the society. Its expressions include text, pictures, audio, and video.
The research object of this paper is Weibo. Weibo rumor, which can be divided into pure text, picture not matching the text, and fake images, is a type of the Internet rumors. Since most of Weibo contains text, the current recognition of Weibo rumors mainly focuses on text. In order to facilitate the recognition of Internet rumors, as shown in Definition 2, this paper gives its formal definition from computability.

Definition 2. Weibo rumors: the object of rumor recognition is a Weibo set , and . is the feature set of each Weibo. The user feature set represents the attributes of the i-th Weibo’s publisher. The content feature set represents the attributes of the i-th Weibo’s text. The propagation feature set represents the propagation attributes of the i-th microblog. is the confidence value of whether is a rumor, and . When is closer to 1, the probability of being a rumor is higher and vice versa.

3.2. Rumor Recognition Process

At present, the research on rumor recognition mainly focuses on feature construction, and the method of adding new features based on previous research work would make the feature dimension increase and estimation of model parameters inaccurate. Therefore, using the Chi-square test to test the validity of new features could obtain a feature set that is more suitable for Internet rumors recognition. Internet rumor recognition is regarded as a binary classification problem. In this paper, it is considered to use the idea of Stacking ensemble learning to build a new classification model because each algorithm has its advantages (see Figure 2).

3.3. Feature Construction

Combining the research studies of paper [8] and paper [20], we select 24 basic features, which are divided into content feature (CONT), user feature (USER), and propagation feature (TRAN). The content feature includes the length of text, the number of @, the number of #, the number of question/exclamation marks, whether there are pictures or URLs, and the number of positive/negative words. The user feature includes the length of username, gender, the number of friends, the number of followers, the number of mutual followers, the number of microblog posts, the number of favourite microblogs, certification information, personal description, and user's own influence. The propagation feature includes the number of reposts, the number of comments, the number of likes, the interval between user registration time and microblog post time, and microblog’s attention.

The above features are mostly statistical features; in order to recognize Weibo rumor more effectively, this paper constructs new features in three aspects, user, content, and propagation features, to mine the hidden meaning behind text information.

Definition 3. User Credibility (UCRE): the user's credibility is determined by many factors. By integrating information such as the number of users' friends, followers, mutual followers, the number of microblogs posted, and certification information, the user’s influence and activity are constructed to calculate the user’s credibility. The more credible a user is, the more credible the information he/she posts. The calculation formula of the user’s credibility is as follows:where is the user’s influence, is the user’s certification information, and is whether the user’s information is complete; the user’s information includes username, gender, personal description, registration place, and profile photo. The greater the user’s influence, the greater the impact of the microblog they posted within a certain time and space. The user’s influence is mainly determined by the number of users’ followers and the number of mutual followers. The calculation formula is as follows:where is user who posts i-th microblog, is the number of ’s mutual followers, and is the number of ’s followers.

Definition 4. Emotion consistency (ECON): emotion consistency is whether the sentiment of the microblog is consistent with the sentiment of the microblog’s comment. When the microblog shows a strong emotion, it may incite others’ emotions; then the microblog is more likely to be a rumor. By segmenting the ’s text and comments, we obtain the text’s term vector set , where is the processed word, and the i-th microblog’s j-th comment’s term vector set , where is the processed word.
The number of positive/negative words is calculated by using Affective Lexical Ontology [21]. The specific formula is as follows:where S is the emotion of the term vector set, is the number of positive words, and is the number of negative words. Then we can get the final emotion SO as follows:where 1 represents positive, −1 represents negative, and 0 represents neutral. Calculating the emotion of each comment, the overall emotion of the comments is calculated as follows:Comparing the emotions of and , the emotion consistency of is calculated as follows:

Definition 5. Regional correlation (RCO): regional correlation refers to the distance between the place mentioned in the microblog and the user’s registration place. The longer the distance is, the less credible the microblog is. This paper uses Euclidean distance to calculate the distance. The formula is as follows:where is the distance between city x and city y, the coordinate of city x is , and the coordinate of city y is . Calculating the distance between cities in China, the distance matrix is shown as follows:According to the difference between the user registration place and the place mentioned by microblog, it can be divided into 4 cases: ① Both the user registration place and the place mentioned in microblog are in China. ② The user registration place is in China, but the place mentioned in microblog is not. ③ The user registration place is not in China, but the place mentioned in microblog is. ④ Neither the user registration place nor the place mentioned in microblog is in China. Since most of Weibo rumors occur in China, the current research is mainly focused on case ①. In cases ②, ③, and ④, the distance would be set to 10000, which indicates the maximum threshold.

3.4. Feature Selection

In order to test the validity of the basic features and new features, we use Chi-square test to obtain the feature ranking results, as shown in Table 1.


RankingDescriptionScore

1Verified477.060
2Time span358.353
3Regional correlation305.972
4The number of friends268.123
5Emotional Consistency255.905
6User Influence159.063
7The number of microblogs147.373
8The number of #78.590
9User Credibility65.372
10The number of mutual followers47.535
11The number of followers36.855
12The number of @25.129
13The number of reports10.981
14Picture6.679
15The length of text6.468
16The number of likes5.991
17The number of exclamation marks5.841
18The number of negative words5.722
19User information integrity3.279
20Personal description3.279
21The length of username2.824
22The number of positive words2.058
23Gender1.604
24The number of comments1.546
25The number of question marks1.160
26The number of favourite microblogs0.652
27User activity0.309

As shown in Table 1, the Regional Correlation, Emotional Consistency, and User Credibility are ranked 3rd, 5th, and 9th, so the three new features we constructed are valid.

Two sets of control experiments are conducted on different models. One is that which is based on the new features and adds features one by one according to the features ranking results. In the other experiment, feature sets are added one by one according to the features ranking results. The experimental results are shown in Figures 3 and 4.

As illustrated in Figures 3 and 4, as the number of features in the feature set increases, the model’s recognition accuracy gradually increases, but when the features exceed a certain number, the model's recognition accuracy tends to decrease.

In Figure 3, the accuracy of Naive Bayes is highest when the number of features is increased to 15; and when the number of features is increased from 3 to 12, the accuracy of SVM is significantly higher than that of Decision Tree. When the number of added features exceeds 12, the accuracy of Decision Tree starts to exceed SVM. As the number of features continues to increase, the accuracy of the Random Forest model continues to increase, but the accuracy decreases as the number of features exceeds 21. In general, the results of each model are the best when the number of features is around 13–14.

In Figure 4, the result is not much different from the result of Figure 3. The number of features in the feature set with better results is mostly around 16. In summary, we use the first 16 features shown in Table 1 as the feature set. The final feature set used in rumor recognition is shown in Figure 5.

3.5. Classification Algorithm

The Stacking method is adopted as a combination strategy of ensemble learning in this paper. We select SVM, Random Forest, and Naive Bayes as the primary learners and logistic regression as the metalearner. SVM uses the hinge loss function to calculate surrogate loss, which makes it sparse. At the same time, it considers the minimization of the empirical risk and the structural risk to make it stable [22], so it has better generalization ability and a smaller computational cost when using kernel function [17]. Random Forest can estimate missing data and balance errors for imbalanced data [18]. When the correlation between attributes is small, the performance of the NB model is better. The model construction is shown in Figure 6.

The specific algorithm is described in Algorithm 1.

Input: a Weibo set
Output: the confidence value of
Step 1: extract features of as shown in Figure 5
Step 2: calculate user credibility of
Step 3: segment and its comments, and calculate emotion consistency of
Step 4: calculate regional correlation of
Step 5: standardize each feature of
Step 6: split the preprocessed data set into train set, test set and validation set, and input them into SVM, RF, and Naïve Bayes model
Step 7: input the new feature set in step 6 into logistic regression model
Step 8: calculate the accuracy, precision, recall and F1-score of the Stacking model

While time complexities of random forest and logistic regression model are and (where k is the number of features), that of SVM determined by the kernel function and Naive Bayes can reach . According to the strategy of the Stacking model, its time complexity equals the maximum value among the primary learners and metalearner. Therefore, the time complexity of Algorithm 1 is .

4. Experiment and Analysis

4.1. Dataset

We use the data from Ma et al. [23], which contain 2313 rumor events and 2351 nonrumor events, about 3.8 million pieces of microblog information, and 2.7 million pieces of user information. In the experiment, we split the dataset into training set and test set according to the proportion of 8 : 2.

At the same time, in order to verify the validity of the method in this paper on actual network data, we collected data on the Weibo platform and established an empirical database. The datasets used for empirical study in this paper are shown in Table 2.


EventThe number of WeiboThe number of users

Doctor accident3,0571,424
2019-nCoV3,0911,223
Community fire2,447896

4.2. Algorithm for Comparison

To verify the validity of the method proposed in this paper, we compare the following methods with our models: tanh-RNN [23], the method used in the paper where the data source is; SVM [20], the first method used in Weibo rumor recognition; Decision Tree J48 [8], the first method used in Twitter fake information recognition; AdaBoost and Random Forest, representative ensemble learning methods; and the method proposed in this paper. SVM and Decision Tree J48 are usually used as a benchmark for Internet rumor recognition in most research works.

4.3. Experimental Procedures

(a)Feature set comparison: based on the recognition model proposed in this paper, we conduct experiments on different feature sets to verify the validity of the new features proposed in this paper(b)Algorithm comparison: in order to measure the accuracy and generalization ability of the recognition method proposed in this paper, we compared different algorithms through the accuracy, precision, recall, and F1-score(c)Algorithm execution time comparison: we compare the training time and test time in different models to analyse model performance(d)Empirical analysis: the practicality of the recognition method proposed in this paper is verified by conducting experiments on the latest events

4.4. Feature Set Comparison

In this paper, we compare different feature sets by using the recognition model proposed in this article. The experimental results are shown in Table 3 ( is the Content Features set, is the User Features set, is the Propagation Features set, UCRE is the User Credibility, ECON is the Emotional Consistency, ROC is the Regional Correlation, and is the Features Set shown in Figure 5).


Feature setClassAccuracyPrecisionRecallF1-score

N0.7040.6620.7830.717
R0.7600.6310.690

N0.9130.9380.8770.906
R0.8930.9470.919

N0.9210.9540.8770.914
R0.8950.9610.927

N0.9320.9600.8970.927
R0.9110.9330.932

N0.9160.9450.8770.910
R0.8940.9530.922

N0.9090.9290.8770.902
R0.8920.9380.915

N0.9220.9500.8840.915
R0.8990.9570.927

N0.9080.9090.8970.903
R0.9070.9180.912

N0.9350.9600.9020.930
R0.9140.9650.939

Table 3 shows that the accuracy rate of using for Weibo rumor recognition is as low as 70%, which indicates that it is difficult to detect rumors in the more complicated content. Compared with only relying on for recognition, the recognition results by using and are better; in particular, the accuracy is improved by 20%. In the experimental results of , , and , we can see that their accuracy is 0.2%, 1.9%, and 2.6% lower than that of , respectively. The accuracy of , which is composed of only three new features constructed in this paper, is as high as 90.8%, which shows that the three new features of User Credibility, Emotional Consistency, and Regional Correlation constructed in this paper have good effect on Weibo rumor recognition. However, the experimental results of without three new features are lower than those of , and the accuracy of is 93%. The accuracy and recall rate of rumor and nonrumor recognition are all over 90%, and the F1-score is also stable at 93%. The feature set proposed in this paper has higher values than other feature sets, which indicates that our feature set is more effective to detect Weibo rumors.

In order to validate the effectiveness of each feature in selected in this paper,applying the rumor recognition method based on Stacking, we conduct 16 different experiments on with one feature removed every time. The results are shown in Table 4.


RankingRemovedClassAccuracyPrecisionRecallF1-score

1The number of friendsN0.93440.95730.90380.9298
R0.91590.96300.9388

2The number of #N0.93440.95520.90600.9300
R0.91750.96090.9387

3Emotional ConsistencyN0.93430.95310.90830.9301
R0.91910.95880.9386

4The number of mutual followersN0.93350.95770.90280.9294
R0.91310.96300.9373

5The number of followersN0.93340.95510.90380.9287
R0.91570.96090.9378

6The number of @N0.93340.94870.91050.9292
R0.92060.95470.9374

7PictureN0.93340.95290.90600.9289
R0.91730.95880.9376

8VerifiedN0.93320.95080.90830.9291
R0.91900.95680.9375

9User CredibilityN0.93320.95080.90830.9291
R0.91900.95680.9375

10The number of microblogsN0.93310.95410.90600.9294
R0.91800.96120.9391

11The length of textN0.93250.95070.90600.9278
R0.91720.95680.9366

12User InfluenceN0.93250.95500.90160.9275
R0.91390.96090.9368

13The number of reportsN0.93030.95050.90160.9254
R0.91360.95680.9347

14The number of likesN0.93030.94010.91280.9262
R0.92180.94650.9340

15Time spanN0.92930.94410.90600.9247
R0.91670.95060.9333

16Regional CorrelationN0.91750.94050.88370.9112
R0.89860.94860.9229

As is shown in Tables 3 and 4, the accuracy in each experiment is lower than that of ; and the rumor recognition accuracy based on the feature set without the regional correlation is the lowest, which indicates that the Regional Correlation has the biggest impact on the recognition results. In conclusion, the 16 features selected in this paper have a positive effect on rumor recognition.

4.5. Algorithm Comparison

We compare different algorithms with the rumor recognition model proposed in this paper to illustrate the accuracy and generalization ability of the model we proposed. The results are shown in Table 5.


AlgorithmClassAccuracyPrecisionRecallF1-score

SVMN0.9170.9170.9110.914
R0.9180.9240.921

NBN0.8130.8190.8150.817
R0.8080.8120.810

RFN0.9350.9450.9170.931
R0.9260.9510.938

LRN0.9050.9180.8730.898
R0.8930.9280.910

J48N0.9230.9160.9310.920
R0.9330.9220.926

tanh-RNNN0.8730.9560.7820.861
R0.8160.9640.884

DT-rankN0.7320.7260.7490.737
R0.7380.7150.726

CAMIN0.9330.9450.9210.932
R0.9210.9450.933
StackingN0.9350.9600.9020.930
R0.9140.9650.939

As shown in Table 5, compared with tanh-RNN, SVM, and Decision Tree J48, the Stacking model has the highest accuracy rate of 93.5%. The Stacking model can recognize rumor with 96.5% recall rate and 91.4% precision, which shows that the model can recognize more rumors; and the Stacking model can recognize nonrumor events with 93% F1-score and recognize rumor with 93.9% F1-score, which are higher compared with other algorithms. The above results show that the Stacking model proposed in this paper has the best recognition effect.

4.6. Algorithm Execution Time

We calculate the training time and test time of each algorithm separately, and the results are shown in Table 6.


TimeTraining time (ms)Testing time (ms)
Algorithm

SVM2434.307324.2662
J4832.02610.3138
NB1.95680.9729
LR15.3420.2064
AdaBoost2544.439331.1073
RF532.521216.4673
Stacking7954.2520.0765

Table 6 shows that the Naive Bayes algorithm takes the shortest time in training, but the Stacking model proposed in this paper takes the longest time in training because it ensembled multiple algorithms. In the testing phase, the Stacking model takes the shortest time, which only accounts for 7.8% of Naive Bayes, and the second shortest logistic regression model is 2.7 times longer than the Stacking model.

4.7. Empirical Analysis

In order to verify the practicability of the Weibo rumor recognition method proposed in this paper, we use three events for experimenting (see Table 2), and the results are shown in Figure 7.

Figure 7 shows that, in different events, the performance of each model is a little different. RF has 98% recall and 77% accuracy, which indicates that the RF model may recognize most nonrumor Weibo as rumor. Although the Stacking model has 93% recall and 80% accuracy, it is higher than other models. Therefore, the model proposed in this paper is relatively effective in actual recognition.

Besides, in order to verify the effectiveness of the new features proposed in this paper, the comparative experiments are conducted on the feature set with UCRE, ECON, and RCO, and the feature set excludes them. The results are shown in Figure 8.

As illustrated in Figure 8, evaluating on the accuracy, precision, recall, and F1-score, the Stacking model implemented on the feature set with UCRE, ECON, and RCO performs better. In conclusion, the new features proposed in this paper are suitable for actual rumor recognition.

5. Conclusion

In this paper, based on previous studies, three new features are constructed by combining the 5W’s Formula in communication; and we obtain the optimal feature set of Weibo rumor recognition through the Chi-square test and other methods. Then, based on the idea of the Stacking method, we select SVM, Random Forest, and Naive Bayes as the primary learner and logistic regression as the metalearner to model and analyse the Weibo rumor recognition. The experimental results show that the features constructed in this paper and the proposed recognition method can effectively detect rumors in Weibo.

However, there are still some shortcomings in this paper. For example, in the case of 2019-nCov, while the content information is more complex and the amount of information is larger, the performance of the algorithm proposed in this paper is worse than that of the other two events. Therefore, it is necessary to carry out deeper semantic mining of microblog text content; for example, the content and emotion of the text using phonetic transcription abbreviations need to be specially processed. In addition, designing a more suitable and effective integration strategy of classification algorithms for Weibo rumor recognition is one of the future works. Besides, detecting rumors with Weibo text information is worthy of further study.

Data Availability

The experiment was conducted with open dataset, which can be downloaded at http://alt.qcri.org/~wgao/data/rumdect.zip.

Conflicts of Interest

The authors declare that there are no conflicts of interest regarding the publication of this paper.

Acknowledgments

This work was supported by the Research on Cyber Group Events Management and Pre-Warning Mechanism, National Social Science Fund of China (17XFX013).

References

  1. W. P. Liu and S. M. Zhong, “Web malware spread modelling and optimal control strategies,” Science Reports, vol. 7, p. 42, 2017. View at: Publisher Site | Google Scholar
  2. Z. H. Xie, Y. Zhang, and L. Zhang, “The recognition of public opinion viruses of micro-blog based on logistic regression,” Microcomputer & Its Applications, vol. 36, no. 16, pp. 67–69, 2017. View at: Google Scholar
  3. W. Liu, X. Wu, W. Yang, X. Zhu, and S. Zhong, “Modeling cyber rumor spreading over mobile social networks: a compartment approach,” Applied Mathematics and Computation, vol. 343, pp. 214–229, 2019. View at: Publisher Site | Google Scholar
  4. W. A. Peterson and N. P. Gist, “Rumor and public opinion,” American Journal of Sociology, vol. 57, no. 2, pp. 159–167, 1951. View at: Publisher Site | Google Scholar
  5. N. P. Chao and X. Huang, “Research on “rumors” phenomenon in Internet communication,” Information Studies: Theory & Application, vol. 27, no. 6, pp. 586–589, 2004. View at: Google Scholar
  6. G. He, X. Q. Lv, Z. Li, and L. P. Xu, “Automatic rumor identification on Microblog,” Library and Information Service, vol. 57, no. 23, pp. 114–120, 2013. View at: Google Scholar
  7. C. Castillo, M. Mendoza, and B. Poblete, “Information credibility on twitter,” in Proceedings of the 20th International Conference on World Wide Web, pp. 675–684, New York, NY, USA, 2011. View at: Google Scholar
  8. V. Qazvinian, E. Rosengren, D. R. Radev, and Q. Z. Mei, “Rumor has it: identifying misinformation in Microblogs,” in Proceedings of the 2011 Conference on Empirical Methods in Natural Language Processing, pp. 1589–1599, New York, NY, USA, 2011. View at: Google Scholar
  9. S. Kwon, M. Cha, and K. Jung, “Rumor detection over varying time windows,” PLos One, vol. 12, no. 1, pp. 1–19, 2017. View at: Publisher Site | Google Scholar
  10. T. Chen, X. Li, H. Yin, and J. Zhang, “Call attention to rumors: deep attention based recurrent neural networks for early rumor detection,” Lecture Notes in Computer Science, vol. 41, pp. 40–52, 2018. View at: Publisher Site | Google Scholar
  11. D. G. Duan, C. S. Wang, Z. M. Han, and B. Li, “A rumor detection model based on Weibo's reviews,” Computer Simulation, vol. 33, no. 1, pp. 386–390, 2016. View at: Google Scholar
  12. Y. F. Chen, X. Y. Zhou, and L. Zhang, “Research on the methods to identify online food safety rumor-related documents based on semantic co-occurrence matching,” Information Studies: Theory & Application, vol. 41, no. 6, pp. 130–136, 2018. View at: Google Scholar
  13. T. Q. Lu, B. Shi, and Z. M. Yan, “Semi-supervised learning algorithm applied to Microblog rumors detection,” Application Research of Computers, vol. 33, no. 3, pp. 744–748, 2016. View at: Google Scholar
  14. W. Dong and X. H. Yue, “The weighted multiple meta-models stacking method for regression problem,” Proceedings of the 38th Chinese Control Conference, vol. 33, pp. 7511–7516, 2019. View at: Google Scholar
  15. Q. Xie, Z. T. Liu, and X. W. Ding, “Electroencephalogram emotion recognition based on a stacking classification model,” Proceeding of the 37th Chinese Control Conference, vol. 41, pp. 5544–5548, 2018. View at: Google Scholar
  16. J. D. Duan, S. R. Liu, K. Ma, and R. Y. Sun, “Text sentiment classification method based on ensemble learning,” Journal of Jinan University (Natural Science Edition), vol. 33, no. 6, pp. 43–488, 2019. View at: Google Scholar
  17. K. P. Kota and G. V. S. R. Anjaneyulu, “A comparative analysis of support vector machines & logistic regression for propensity based response modeling,” Social Science Electronic Publishing, vol. 4, no. 3, pp. 7–16, 2015. View at: Google Scholar
  18. C. Su, S. Ju, Y. Liu, and Z. Yu, “Improving random forest and rotation forest for highly imbalanced datasets,” Intelligent Data Analysis, vol. 19, no. 6, pp. 1409–1432, 2015. View at: Publisher Site | Google Scholar
  19. H. Li, Statistical Learning Methods, Tsinghua University Press, Beijing, China, 2016.
  20. F. Yang, X. H. Yu, Y. Liu, and M. Yang, “Automatic detection of rumor on sina Weibo,” Proceedings of the ACM SIGKDD Workshop on Mining Data Semantics, vol. 19, pp. 13–20, 2012. View at: Google Scholar
  21. L. H. Xu, H. F. Lin, Y. Pan, and H. Ren, “Constructing the affective lexicon ontology,” Journal of the China Society for Scientific and Technical Information, vol. 27, no. 2, pp. 180–185, 2008. View at: Google Scholar
  22. Z. H. Zhou, Machine Learning, Tsinghua University Press, Beijing, China, 2016.
  23. J. Ma, W. Gao, P. Mitra, and S. Kwon, “Detecting rumors from Microblogs with recurrent neural networks,” Proceedings of the 25th International Joint Conference on Artificial Intelligence, vol. 27, pp. 3818–3824, 2016. View at: Google Scholar

Copyright © 2020 Yu Wu et al. This is an open access article distributed under the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.


More related articles

 PDF Download Citation Citation
 Download other formatsMore
 Order printed copiesOrder
Views218
Downloads232
Citations

Related articles

Article of the Year Award: Outstanding research contributions of 2020, as selected by our Chief Editors. Read the winning articles.