Examining the classification accuracy of TSVMs with feature selection in comparison with the GLAD algorithmTools Helmi, Hala, Garibaldi, Jonathan M. and Aickelin, Uwe (2011) Examining the classification accuracy of TSVMs with feature selection in comparison with the GLAD algorithm. In: UKCI 2011, 11th Annual Workshop on Computational Intelligence, 7-9 Sept 2011, Manchester, England. Full text not available from this repository.
Official URL: http://ukci.cs.manchester.ac.uk/files/Proceedings.pdf
AbstractGene expression data sets are used to classify and predict patient diagnostic categories. As we know, it is extremely difficult and expensive to obtain gene expression labelled examples. Moreover, conventional supervised approaches cannot function properly when labelled data (training examples) are insufficient using Support Vector Machines (SVM) algorithms. Therefore, in this paper, we suggest Transductive Support Vector Machines (TSVMs) as semi-supervised learning algorithms, learning with both labelled samples data and unlabelled samples to perform the classification of microarray data. To prune the superfluous genes and samples we used a feature selection method called Recursive Feature Elimination (RFE), which is supposed to enhance the output of classification and avoid the local optimization problem. We examined the classification prediction accuracy of the TSVM-RFE algorithm in comparison with the Genetic Learning Across Datasets (GLAD) algorithm, as both are semi-supervised learning methods. Comparing these two methods, we found that the TSVM-RFE surpassed both a SVM using RFE and GLAD.
Actions (Archive Staff Only)
|
Tools
Tools
