It appears you don't have support to open PDFs in this web browser. To view this file, Open with your PDF reader
Abstract
The increased volume and complexity of flow cytometry (FCM) data resulting from the increased throughput greatly boosts the demand for reliable statistical methods for the analysis of multidimensional data. The Support Vector Machines (SVM) model can be used for classification recognition. However, the selection of penalty factor c and kernel parameter g in the model has a great influence on the correctness of clustering. To solve the problem of parameter optimization of the SVM model, a support vector machine algorithm of particle swarm optimization (PSO-SVM) based on adaptive mutation is proposed. Firstly, a large number of FCM data were used to carry out the experiment, and the kernel function adapted to the sample data was selected. Then the PSO algorithm of adaptive mutation was used to optimize the parameters of the SVM classifier. Finally, the cell clustering results were obtained. The method greatly improves the clustering correctness of traditional SVM. That also overcomes the shortcomings of PSO algorithm, which is easy to fall into local optimum in the iterative optimization process and has poor convergence effect in dealing with a large number of data. Compared with the traditional SVM algorithm, the experimental results show that, the correctness of the method is improved by 19.38%. Compared with the cross-validation algorithm and the PSO algorithm, the adaptive mutation PSO algorithm can also improve the correctness of FCM data clustering. The correctness of the algorithm can reach 99.79% and the time complexity is relatively lower. At the same time, the method does not need manual intervention, which promotes the research of cell group identification in biomedical detection technology.
You have requested "on-the-fly" machine translation of selected content from our databases. This functionality is provided solely for your convenience and is in no way intended to replace human translation. Show full disclaimer
Neither ProQuest nor its licensors make any representations or warranties with respect to the translations. The translations are automatically generated "AS IS" and "AS AVAILABLE" and are not retained in our systems. PROQUEST AND ITS LICENSORS SPECIFICALLY DISCLAIM ANY AND ALL EXPRESS OR IMPLIED WARRANTIES, INCLUDING WITHOUT LIMITATION, ANY WARRANTIES FOR AVAILABILITY, ACCURACY, TIMELINESS, COMPLETENESS, NON-INFRINGMENT, MERCHANTABILITY OR FITNESS FOR A PARTICULAR PURPOSE. Your use of the translations is subject to all use restrictions contained in your Electronic Products License Agreement and by using the translation functionality you agree to forgo any and all claims against ProQuest or its licensors for your use of the translation functionality and any output derived there from. Hide full disclaimer