Variable selection using probability density function similarity for support vector machine classification of high-dimensional microarray data

Talanta ◽  
2009 ◽  
Vol 79 (2) ◽  
pp. 260-267 ◽  
Author(s):  
Li-Juan Tang ◽  
Jian-Hui Jiang ◽  
Hai-Long Wu ◽  
Guo-Li Shen ◽  
Ru-Qin Yu
2018 ◽  
Author(s):  
Mingxu Hu ◽  
Hongkun Yu ◽  
Kai Gu ◽  
Kunpeng Wang ◽  
Siyuan Ren ◽  
...  

AbstractElectron cryo-microscopy (cryoEM) is now a powerful tool in determining atomic structures of biological macromolecules under nearly natural conditions. The major task of single-particle cryoEM is to estimate a set of parameters for each input particle image to reconstruct the three-dimensional structure of the macromolecules. As future large-scale applications require increasingly higher resolution and automation, robust high-dimensional parameter estimation algorithms need to be developed in the presence of various image qualities. In this paper, we introduced a particle-filter algorithm for cryoEM, which was a sequential Monte Carlo method for robust and fast high-dimensional parameter estimation. The cryoEM parameter estimation problem was described by a probability density function of the estimated parameters. The particle filter uses a set of random and weighted support points to represent such a probability density function. The statistical properties of the support points not only enhance the parameter estimation with self-adaptive accuracy but also provide the belief of estimated parameters, which is essential for the reconstruction phase. The implementation of these features showed strong tolerance to bad particles and enabled robust defocus refinement, demonstrated by the remarkable resolution improvement at the atomic level.


2012 ◽  
Vol 23 (02) ◽  
pp. 431-444 ◽  
Author(s):  
ALLANI ABDERRAHIM ◽  
EL-GHAZALI TALBI ◽  
MELLOULI KHALED

In this work, we hybridize the Genetic Quantum Algorithm with the Support Vector Machines classifier for gene selection and classification of high dimensional Microarray Data. We named our algorithm GQA SVM. Its purpose is to identify a small subset of genes that could be used to separate two classes of samples with high accuracy. A comparison of the approach with different methods of literature, in particular GA SVM and PSO SVM [2], was realized on six different datasets issued of microarray experiments dealing with cancer (leukemia, breast, colon, ovarian, prostate, and lung) and available on Web. The experiments clearified the very good performances of the method. The first contribution shows that the algorithm GQA SVM is able to find genes of interest and improve the classification on a meaningful way. The second important contribution consists in the actual discovery of new and challenging results on datasets used.


Sign in / Sign up

Export Citation Format

Share Document