Use of particle swarm optimization to obtain designing parameters from data set of frequency selective surface

Author(s):  
Poulami Samaddar ◽  
Sushanta Sarkar ◽  
Nurnihar Begam ◽  
Srija De ◽  
Sushanta Biswas ◽  
...  
2015 ◽  
Vol 13 (03) ◽  
pp. 1541007 ◽  
Author(s):  
Marcus C. K. Ng ◽  
Simon Fong ◽  
Shirley W. I. Siu

Protein–ligand docking is an essential step in modern drug discovery process. The challenge here is to accurately predict and efficiently optimize the position and orientation of ligands in the binding pocket of a target protein. In this paper, we present a new method called PSOVina which combined the particle swarm optimization (PSO) algorithm with the efficient Broyden–Fletcher–Goldfarb–Shannon (BFGS) local search method adopted in AutoDock Vina to tackle the conformational search problem in docking. Using a diverse data set of 201 protein–ligand complexes from the PDBbind database and a full set of ligands and decoys for four representative targets from the directory of useful decoys (DUD) virtual screening data set, we assessed the docking performance of PSOVina in comparison to the original Vina program. Our results showed that PSOVina achieves a remarkable execution time reduction of 51–60% without compromising the prediction accuracies in the docking and virtual screening experiments. This improvement in time efficiency makes PSOVina a better choice of a docking tool in large-scale protein–ligand docking applications. Our work lays the foundation for the future development of swarm-based algorithms in molecular docking programs. PSOVina is freely available to non-commercial users at http://cbbio.cis.umac.mo .


2011 ◽  
Vol 110-116 ◽  
pp. 3713-3719
Author(s):  
N. C. Hiremath ◽  
Sadanand Sahu ◽  
Manoj Kumar Tiwari

The strategic design and operation of outbound logistics network in an automotive manufacturing supply chain is directly related with the competitive strategy adopted by the firm. We discuss here an outbound logistics network model with four echelons and flexible delivery modes by incorporating cross-dock facility in the network. The paper aims to achieve a minimum total logistics cost for flexible delivery modes adopted in the network. The mathematical model is formulated as a mixed integer programming model and solved by using a hybrid algorithm named co-evolutionary immune-particle swarm optimization with penetrated hyper-mutation (COIPSO-PHM). The proposed model is combinatorial in nature owing to varying problem instances. The proposed solution methodology is tested on a sample data set mimicking the real life situation and the results are found to be satisfactory.


2014 ◽  
Vol 2014 ◽  
pp. 1-10
Author(s):  
Lizhi Cui ◽  
Zhihao Ling ◽  
Josiah Poon ◽  
Simon K. Poon ◽  
Junbin Gao ◽  
...  

This paper proposes a separation method, based on the model of Generalized Reference Curve Measurement and the algorithm of Particle Swarm Optimization (GRCM-PSO), for the High Performance Liquid Chromatography with Diode Array Detection (HPLC-DAD) data set. Firstly, initial parameters are generated to construct reference curves for the chromatogram peaks of the compounds based on its physical principle. Then, a General Reference Curve Measurement (GRCM) model is designed to transform these parameters to scalar values, which indicate the fitness for all parameters. Thirdly, rough solutions are found by searching individual target for every parameter, and reinitialization only around these rough solutions is executed. Then, the Particle Swarm Optimization (PSO) algorithm is adopted to obtain the optimal parameters by minimizing the fitness of these new parameters given by the GRCM model. Finally, spectra for the compounds are estimated based on the optimal parameters and the HPLC-DAD data set. Through simulations and experiments, following conclusions are drawn: (1) the GRCM-PSO method can separate the chromatogram peaks and spectra from the HPLC-DAD data set without knowing the number of the compounds in advance even when severe overlap and white noise exist; (2) the GRCM-PSO method is able to handle the real HPLC-DAD data set.


Author(s):  
Mohammad Reza Daliri

AbstractIn this article, we propose a feature selection strategy using a binary particle swarm optimization algorithm for the diagnosis of different medical diseases. The support vector machines were used for the fitness function of the binary particle swarm optimization. We evaluated our proposed method on four databases from the machine learning repository, including the single proton emission computed tomography heart database, the Wisconsin breast cancer data set, the Pima Indians diabetes database, and the Dermatology data set. The results indicate that, with selected less number of features, we obtained a higher accuracy in diagnosing heart, cancer, diabetes, and erythematosquamous diseases. The results were compared with the traditional feature selection methods, namely, the F-score and the information gain, and a superior accuracy was obtained with our method. Compared to the genetic algorithm for feature selection, the results of the proposed method show a higher accuracy in all of the data, except in one. In addition, in comparison with other methods that used the same data, our approach has a higher performance using less number of features.


2018 ◽  
Vol 1 (1) ◽  
pp. 43-50
Author(s):  
Tati Mardiana

Dalam bisnis, koperasi memiliki peranan penting dalam meningkatkan perekonomian nasional. Ketidakmampuan anggota untuk membayar angsuran kredit merupakan masalah utama yang terjadi pada koperasi. Akibatnya, terjadi kredit macet. Koperasi dapat menghindari kredit macet dengan membuat prediksi dari anggota koperasi yang berpotensi terlambat membayar kredit. Dalam beberapa penelitian telah menggunakan Naive Bayes untuk masalah klasifikasi karena perhitungan yang efisien, dan  akurasi tinggi. Tetapi Naive Bayes mengasumsikan bahwa semua atribut kelas tidak tergantung pada atribut lainnya. Naive Bayes sesuai untuk masalah klasifikasi dengan atribut besar. Namun, asumsi ini sering tidak dapat dipertahankan dalam masalah klasifikasi nyata. Dalam beberapa dokumen, kinerja Naive Bayes tidak sempurna. Tujuan dari penelitian ini adalah untuk mengoptimalkan metode Naive Bayes menggunakan Particle Swarm Optimization (PSO) dan untuk meningkatkan akurasi dalam memprediksi kredit macet di koperasi. Penelitian ini menggunakan data dari Pusat Data Koperasi (PUSKOPDIT) DKI Jakarta. Data set kredit yang diperoleh sebanyak 565 record dengan 15 prediktor atribut dan 1 atribut kelas. Hasil pengujian dengan confusion matrix dan kurva ROC diperoleh dari nilai akurasi sebesar 86% dan nilai sebesar 0,867 dengan diagnosis klasifikasi baik. Penelitian ini menunjukkan bahwa penggunaan PSO pada NBC untuk memprediksi kredit macet meningkatkan akurasi 21,03% dan AUC sebesar 0,069. Hasil uji T-Test dan Anova menunjukkan bahwa pada dua metode klasifikasi yang diuji memiliki perbedaan yang nyata (signifikan) dalam nilai AUC.


Sign in / Sign up

Export Citation Format

Share Document