Abstract

To effectively identify network rumors and block their spread, this paper uses fractal theory to analyze a network rumor spreading situation time series, reveal its inner regularity, extract features, and establish a network rumor recognition model. The model is based on an empirical mode decomposition correlation dimension and K-nearest neighbor approach. Firstly, a partition function is used to determine if the time series of the rumor spreading situation is a uniform fractal process. Secondly, the rumor spreading situation is subjected to EMD to obtain a series of intrinsic mode functions, construct the IMF1–IMF6 components containing effective feature information as the principal components, and reconstruct the phase space of the principal components, respectively. Finally, the correlation dimensions of the principal components IMF1–IMF6 as obtained by the Grassberger-Procaccia algorithm are used as feature parameters and are imported into the KNN model for rumor recognition. The experimental results show that the correlation dimension of a spreading situation can better reflect the characteristic information; as combined with the KNN model for identifying rumors, the recognition rate reaches 87.5%. This result verifies the effectiveness of fractal theory in network rumors recognition, expands the thinking for the research of rumors recognition, and provides theoretical support for rumor governance.