A User-Based Modeling and Analysis of Network Public Opinion Using Particle Swarm Optimization

Article Preview

Abstract:

In the current researches on network public opinion, the events are mostly focused, instead of the users who are of great significance, but often ignored. Concerning this problem,the user-based event model encompassing the users and their concepts is introduced in this paper, and user concept clustering in spreading events is simulated with the speciation algorithm based particle swarm optimization (SPSO). According to the results of user concept clustering, the analysis of event dynamic evolution model is implemented. The clustering convergence velocity of users is controlled with the change of velocity parameter for subsequently coordinating event evolution, so that the recognition of network hot events is realized and the situation of emergencies is analyzed.Finally, the PSO-based and SPSO-based clustering behaviors of users are simulated, respectively. The experimental results show that SPSO can more effectively simulate the clustering behaviors of users in public opinion network and discover multiple user clustering centers.

You might also be interested in these eBooks

Info:

Periodical:

Advanced Materials Research (Volumes 712-715)

Pages:

2452-2457

Citation:

Online since:

June 2013

Export:

Price:

Permissions CCC:

Permissions PLS:

Сopyright:

© 2013 Trans Tech Publications Ltd. All Rights Reserved

Share:

Citation:

* - Corresponding Author

[1] Lin Mai. Research on Model of Hot Topic Opinion Mining in Virtual Communities [M]. Anhui: University of Science and Technology of China, 2009.

Google Scholar

[2] Fujian Fang. Research on Network Public Opinion Evolution of Sudden Events [D]. Hubei: Huazhong University of Science and Technology, 2011.

Google Scholar

[3] H. Xiaohui, R. C. Eberhart, and S. Yuhui, Engineering optimization with particle swarm[A]. Proceedings of the 2003 IEEE Swarm Intelligence Symposium[C], 2003: 53-57.

DOI: 10.1109/sis.2003.1202247

Google Scholar

[4] Li X. Adaptively choosing neighborhood bests using species in a particle swarm optimizer for multimodel function optimization[C]. In Proc. Genetic Evol. Comput. Conf., K. Del et al., Eds., 2004, 105-116.

DOI: 10.1007/978-3-540-24854-5_10

Google Scholar

[5] Qing Zhang, Lifu Kang, Danong Li. Swarm Intelligence Algorithm and Its Application [J]. Huanggang Normal University, 2008, 28(6): 44-48.

Google Scholar

[6] Yucheng Hu. Study on the Particle Swarm Algorithm Oriented at Dynamic Environment [D]. Hubei: Huazhong University of Science and Technology, 2010.

Google Scholar

[7] Colorni A. Dorigo M., Maniezzo V. An Investigation of Some Properties of an Ant Algorithm [A]. Proc. of Parallel Problem Solving from Nature ( PPSN ) [C].France: Elsevier, 1992:509-520.

Google Scholar

[8] Eberhart R C,Kennedy J.A new optimizer using particle swarm theory[C]. Proceedings of the Sixth International Symposium on Micromachine and Human Science, Nagoya, Japan, 1995: 39-43.

DOI: 10.1109/mhs.1995.494215

Google Scholar

[9] Shan S M, Deng G S. Improved Adaptive Particle Swarm Optimizer in Dynamic Environment [J]. Systems Engineering-Theory & Practice, 2006, 26(3), 39-44.

Google Scholar

[10] Ying Gao, Shengli Xie. Chaos Particle Swarm Optimization [J]. Computer Science, 2004, 31(8): 13-15.

Google Scholar

[11] K.E. Parsopoulos and M.N. Vrahatis. Particle Swarm Optimization Method for Constrained Optimization Problems [J]. Intelligent Technologies—Theory and Applications: New Trends in Intelligent Technologies, 2002: 214-220.

Google Scholar