Analysis of Twitter Data Using Evolutionary Clustering during the COVID-19 Pandemic

People started posting textual tweets on Twitter as soon as the novel coronavirus(COVID-19)emerged.Analyzing these tweets can assist institutions in better decision-making and prioritizing their tasks.Therefore,this study aimed to analyze 43 million tweets collected between March 22 and March 30,2020 and describe the trend of public attention given to the topics related to the COVID-19 epidemic using evolutionary clustering analysis.The results indicated that unigram terms were trended more frequently than bigram and trigram terms.A large number of tweets about the COVID-19 were disseminated and received widespread public attention during the epidemic.The high-frequency words such as“death”,“test”,“spread”,and“lockdown”suggest that people fear of being infected,and those who got infection are afraid of death.The results also showed that people agreed to stay at home due to the fear of the spread,and they were calling for social distancing since they become aware of the COVID-19.It can be suggested that social media posts may affect human psychology and behavior.These results may help governments and health organizations to better understand the psychology of the public,and thereby,better communicate with them to prevent and manage the panic.

A dynamic core evolutionary clustering algorithm based on saturated memory

Because the number of clustering cores needs to be set before implementing the K-means algorithm,this type of algorithm often fails in applications with increasing data and changing distribution characteristics.This paper proposes an evolutionary algorithm DCC,which can dynamically adjust the number of clustering cores with data change.DCC algorithm uses the Gaussian function as the activation function of each core.Each clustering core can adjust its center vector and coverage based on the response to the input data and its memory state to better fit the sample clusters in the space.The DCC algorithm model can evolve from 0.After each new sample is added,the winning dynamic core can be adjusted or split by competitive learning,so that the number of clustering cores of the algorithm always maintains a better adaptation relationship with the existing data.Furthermore,because its clustering core can split,it can subdivide the densely distributed data clusters.Finally,detailed experimental results show that the evolutionary clustering algorithm DCC based on the dynamic core method has excellent clustering performance and strong robustness.

A Clustering Method Based on Brain Storm Optimization Algorithm

In the field of data mining and machine learning,clustering is a typical issue which has been widely studied by many researchers,and lots of effective algorithms have been proposed,including K-means,fuzzy c-means(FCM)and DBSCAN.However,the traditional clustering methods are easily trapped into local optimum.Thus,many evolutionary-based clustering methods have been investigated.Considering the effectiveness of brain storm optimization(BSO)in increasing the diversity while the diversity optimization is performed,in this paper,we propose a new clustering model based on BSO to use the global ability of BSO.In our experiment,we apply the novel binary model to solve the problem.During the period of processing data,BSO was mainly utilized for iteration.Also,in the process of K-means,we set the more appropriate parameters selected to match it greatly.Four datasets were used in our experiment.In our model,BSO was first introduced in solving the clustering problem.With the algorithm running on each dataset repeatedly,our experimental results have obtained good convergence and diversity.In addition,by comparing the results with other clustering models,the BSO clustering model also guarantees high accuracy.Therefore,from many aspects,the simulation results show that the model of this paper has good performance.

Parameter Optimization Method for Gaussian Mixture Model with Data Evolution

To learn from evolutionary experimental data points effectively,an evolutionary Gaussian mixture model based on constraint consistency(EGMM)is proposed and the corresponding method of parameter optimization is presented.Here,the Gaussian mixture model(GMM)is adopted to describe the data points,and the differences between the posterior probabilities of pairwise points under the current parameters are introduced to measure the temporal smoothness.Then,parameter optimization of EGMM can be realized by evolutionary clustering.Compared with most of the existing data analysis methods by evolutionary clustering,both the whole features and individual differences of data points are considered in the clustering framework of EGMM.It decreases the algorithm sensitivity to noises and increases the robustness of evaluated parameters.Experimental result shows that the clustering sequence really reflects the shift of data distribution,and the proposed algorithm can provide better clustering quality and temporal smoothness.