PSO-FSDP Clustering for Internet Propagation
Yu Fangting 
International Journal of Web Applications, Vol. 15, No. 3, 2023.
DOI: https://doi.org/10.6025/ijwa/2023/15/3/73-79
Link: https://www.dline.info/ijwa/fulltext/v15n3/ijwav15n3_2.pdf
Abstract:
This article studies the PSO-FSDP clustering problem based on internet propagation. Much data needs to be analyzed and classified in the internet environment to understand better and grasp important information, such as user behavior and market trends. Traditional clustering algorithms often face problems such as low computational efficiency and inaccurate results when dealing with large-scale and high-dimensional data. Through experimental verification, the PSO-FSDP algorithm has higher accuracy and stability when processing large-scale and high-dimensional internet data and has faster computational speed than traditional clustering algorithms. Therefore, the PSO-FSDP algorithm provides an effective method for solving clustering problems in internet propagation and has important theoretical significance and practical value.