{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,13]],"date-time":"2026-02-13T17:18:38Z","timestamp":1771003118035,"version":"3.50.1"},"reference-count":22,"publisher":"SAGE Publications","issue":"1","license":[{"start":{"date-parts":[[2025,1,1]],"date-time":"2025-01-01T00:00:00Z","timestamp":1735689600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/journals.sagepub.com\/page\/policies\/text-and-data-mining-license"}],"content-domain":{"domain":["journals.sagepub.com"],"crossmark-restriction":true},"short-container-title":["Journal of Computational Methods in Sciences and Engineering"],"published-print":{"date-parts":[[2025,1]]},"abstract":"<jats:p>Data present complex properties such as high dimension, non-linear, and large-scale. How to perform feature selection more efficiently has become the researching focus in data mining, machine learning, and other fields. Various optimization methods have been proposed, and the current big data classifier optimization has achieved certain results. However, the classification accuracy and stability of classifiers in current research have not reached the ideal state. To address the above issues, this research proposed an optimization method of big data classifier based on improved particle swarm optimization algorithm. The particle swarm optimization algorithm was first improved by dynamically adjusting inertia weights and using multiple swarm optimization methods. Then the support vector machine big data classifier was optimized by improving the particle swarm optimization algorithm. In the experimental results, the average classification accuracy of the optimized classifier was 82.23%, while the average accuracy of the traditional support vector machine and the traditional particle swarm optimization-support vector machine was 69.45% and 72.34%, respectively. In addition, although the running time of the optimized classifier was slightly higher than traditional support vector machines, the increase was not significant. When the features number was 100, the running time increased by 0.87 seconds. The results verified that the optimized classifier performed better and did not cause significant computational load while improving accuracy. The research aims to provide a reference scheme for the optimization of big data classifiers, so as to provide guidance for more efficient big data processing.<\/jats:p>","DOI":"10.1177\/14727978251321688","type":"journal-article","created":{"date-parts":[[2025,3,11]],"date-time":"2025-03-11T23:57:06Z","timestamp":1741737426000},"page":"808-820","update-policy":"https:\/\/doi.org\/10.1177\/sage-journals-update-policy","source":"Crossref","is-referenced-by-count":0,"title":["Design of big data classifier optimization method based on improved particle swarm optimization algorithm"],"prefix":"10.1177","volume":"25","author":[{"given":"Shuwei","family":"Hu","sequence":"first","affiliation":[{"name":"Guangxi University of Finance and Economics"}]}],"member":"179","published-online":{"date-parts":[[2025,3,11]]},"reference":[{"key":"e_1_3_2_2_2","doi-asserted-by":"publisher","DOI":"10.1002\/ima.22676"},{"key":"e_1_3_2_3_2","doi-asserted-by":"publisher","DOI":"10.1109\/TCYB.2021.3061152"},{"key":"e_1_3_2_4_2","doi-asserted-by":"publisher","DOI":"10.1108\/JEIM-01-2022-0025"},{"key":"e_1_3_2_5_2","doi-asserted-by":"publisher","DOI":"10.1007\/s00521-021-06459-9"},{"key":"e_1_3_2_6_2","doi-asserted-by":"publisher","DOI":"10.3233\/JIFS-212373"},{"key":"e_1_3_2_7_2","doi-asserted-by":"publisher","DOI":"10.1007\/s11277-021-09257-7"},{"key":"e_1_3_2_8_2","doi-asserted-by":"publisher","DOI":"10.1108\/RPJ-10-2020-0242"},{"key":"e_1_3_2_9_2","doi-asserted-by":"publisher","DOI":"10.1177\/13694332211004116"},{"key":"e_1_3_2_10_2","doi-asserted-by":"publisher","DOI":"10.1049\/iet-pel.2019.1121"},{"key":"e_1_3_2_11_2","doi-asserted-by":"publisher","DOI":"10.1016\/j.renene.2021.04.088"},{"key":"e_1_3_2_12_2","doi-asserted-by":"publisher","DOI":"10.1002\/int.22693"},{"key":"e_1_3_2_13_2","doi-asserted-by":"publisher","DOI":"10.1016\/j.asr.2020.07.010"},{"key":"e_1_3_2_14_2","doi-asserted-by":"publisher","DOI":"10.1007\/s00500-022-06921-3"},{"key":"e_1_3_2_15_2","doi-asserted-by":"publisher","DOI":"10.1016\/j.neucom.2020.07.154"},{"key":"e_1_3_2_16_2","doi-asserted-by":"publisher","DOI":"10.1109\/JSEN.2021.3117496"},{"key":"e_1_3_2_17_2","doi-asserted-by":"publisher","DOI":"10.1002\/er.7526"},{"key":"e_1_3_2_18_2","doi-asserted-by":"publisher","DOI":"10.1109\/TEVC.2020.2968743"},{"key":"e_1_3_2_19_2","doi-asserted-by":"publisher","DOI":"10.1109\/TFUZZ.2020.3016346"},{"key":"e_1_3_2_20_2","doi-asserted-by":"publisher","DOI":"10.1016\/j.jksuci.2021.01.014"},{"key":"e_1_3_2_21_2","doi-asserted-by":"publisher","DOI":"10.1021\/acs.iecr.1c02731"},{"key":"e_1_3_2_22_2","doi-asserted-by":"publisher","DOI":"10.1080\/10298436.2021.1888092"},{"key":"e_1_3_2_23_2","doi-asserted-by":"publisher","DOI":"10.1007\/s11042-021-11821-z"}],"container-title":["Journal of Computational Methods in Sciences and Engineering"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/journals.sagepub.com\/doi\/pdf\/10.1177\/14727978251321688","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/journals.sagepub.com\/doi\/full-xml\/10.1177\/14727978251321688","content-type":"application\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/journals.sagepub.com\/doi\/pdf\/10.1177\/14727978251321688","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,2,13]],"date-time":"2026-02-13T16:31:28Z","timestamp":1771000288000},"score":1,"resource":{"primary":{"URL":"https:\/\/journals.sagepub.com\/doi\/10.1177\/14727978251321688"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,1]]},"references-count":22,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2025,1]]}},"alternative-id":["10.1177\/14727978251321688"],"URL":"https:\/\/doi.org\/10.1177\/14727978251321688","relation":{},"ISSN":["1472-7978","1875-8983"],"issn-type":[{"value":"1472-7978","type":"print"},{"value":"1875-8983","type":"electronic"}],"subject":[],"published":{"date-parts":[[2025,1]]}}}