{"title":"非线性聚类优化算法在云计算web数据挖掘中的应用","authors":"Yan Zhang","doi":"10.1515/nleng-2022-0239","DOIUrl":null,"url":null,"abstract":"Abstract To improve data mining and data clustering performance to improve the efficiency of the cloud computing platform, the author proposes a bionic optimized clustering data extraction algorithm based on cloud computing platform. According to the Gaussian distribution function graph, the degree of aggregation of the categories and the distribution of data points of the same category can be judged more intuitively. The cloud computing platform has the characteristics of large amount of data and high dimension. In the process of solving the distance between all sample points and the center point, after each center point update, the optimization function needs to be re-executed, the author mainly uses clustering evaluation methods such as PBM-index and DB-index. The simulation data object is the Iris dataset in UCI, and N = 500 samples are selected for simulation. The experiment result shows that when P is not greater than 15, the PBM value changes very little, and when P = 20, the PBM performance of all the four clustering algorithms decreased significantly. When the sample size is increased from 50,000 to 100,000, the DB performance of this algorithm does not change much, and the DB value tends to be stable. In terms of clustering operation time, the K-means algorithm has obvious advantages, the DBSCAN algorithm is the most time-consuming, and the operation time of wolf pack clustering and Mean-shift is in the middle. In the actual application process, the number of samples for each training can be dynamically adjusted according to the actual needs, in order to improve the applicability of the wolf pack clustering algorithm in specific application scenarios. Flattening in cloud computing for data clusters, this algorithm is compared with the common clustering algorithm in PBM. DB also shows better performance.","PeriodicalId":37863,"journal":{"name":"Nonlinear Engineering - Modeling and Application","volume":null,"pages":null},"PeriodicalIF":2.4000,"publicationDate":"2023-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Application of nonlinear clustering optimization algorithm in web data mining of cloud computing\",\"authors\":\"Yan Zhang\",\"doi\":\"10.1515/nleng-2022-0239\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Abstract To improve data mining and data clustering performance to improve the efficiency of the cloud computing platform, the author proposes a bionic optimized clustering data extraction algorithm based on cloud computing platform. According to the Gaussian distribution function graph, the degree of aggregation of the categories and the distribution of data points of the same category can be judged more intuitively. The cloud computing platform has the characteristics of large amount of data and high dimension. In the process of solving the distance between all sample points and the center point, after each center point update, the optimization function needs to be re-executed, the author mainly uses clustering evaluation methods such as PBM-index and DB-index. The simulation data object is the Iris dataset in UCI, and N = 500 samples are selected for simulation. The experiment result shows that when P is not greater than 15, the PBM value changes very little, and when P = 20, the PBM performance of all the four clustering algorithms decreased significantly. When the sample size is increased from 50,000 to 100,000, the DB performance of this algorithm does not change much, and the DB value tends to be stable. In terms of clustering operation time, the K-means algorithm has obvious advantages, the DBSCAN algorithm is the most time-consuming, and the operation time of wolf pack clustering and Mean-shift is in the middle. In the actual application process, the number of samples for each training can be dynamically adjusted according to the actual needs, in order to improve the applicability of the wolf pack clustering algorithm in specific application scenarios. Flattening in cloud computing for data clusters, this algorithm is compared with the common clustering algorithm in PBM. DB also shows better performance.\",\"PeriodicalId\":37863,\"journal\":{\"name\":\"Nonlinear Engineering - Modeling and Application\",\"volume\":null,\"pages\":null},\"PeriodicalIF\":2.4000,\"publicationDate\":\"2023-01-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Nonlinear Engineering - Modeling and Application\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1515/nleng-2022-0239\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"Q2\",\"JCRName\":\"ENGINEERING, MECHANICAL\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Nonlinear Engineering - Modeling and Application","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1515/nleng-2022-0239","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q2","JCRName":"ENGINEERING, MECHANICAL","Score":null,"Total":0}
Application of nonlinear clustering optimization algorithm in web data mining of cloud computing
Abstract To improve data mining and data clustering performance to improve the efficiency of the cloud computing platform, the author proposes a bionic optimized clustering data extraction algorithm based on cloud computing platform. According to the Gaussian distribution function graph, the degree of aggregation of the categories and the distribution of data points of the same category can be judged more intuitively. The cloud computing platform has the characteristics of large amount of data and high dimension. In the process of solving the distance between all sample points and the center point, after each center point update, the optimization function needs to be re-executed, the author mainly uses clustering evaluation methods such as PBM-index and DB-index. The simulation data object is the Iris dataset in UCI, and N = 500 samples are selected for simulation. The experiment result shows that when P is not greater than 15, the PBM value changes very little, and when P = 20, the PBM performance of all the four clustering algorithms decreased significantly. When the sample size is increased from 50,000 to 100,000, the DB performance of this algorithm does not change much, and the DB value tends to be stable. In terms of clustering operation time, the K-means algorithm has obvious advantages, the DBSCAN algorithm is the most time-consuming, and the operation time of wolf pack clustering and Mean-shift is in the middle. In the actual application process, the number of samples for each training can be dynamically adjusted according to the actual needs, in order to improve the applicability of the wolf pack clustering algorithm in specific application scenarios. Flattening in cloud computing for data clusters, this algorithm is compared with the common clustering algorithm in PBM. DB also shows better performance.
期刊介绍:
The Journal of Nonlinear Engineering aims to be a platform for sharing original research results in theoretical, experimental, practical, and applied nonlinear phenomena within engineering. It serves as a forum to exchange ideas and applications of nonlinear problems across various engineering disciplines. Articles are considered for publication if they explore nonlinearities in engineering systems, offering realistic mathematical modeling, utilizing nonlinearity for new designs, stabilizing systems, understanding system behavior through nonlinearity, optimizing systems based on nonlinear interactions, and developing algorithms to harness and leverage nonlinear elements.