Comparison of one-class SVM and two-class SVM for fold recognition

Authors:
Alexander Senf;Xue-wen Chen;Anne Zhang
Affiliations:
The University of Kansas, Lawrence, KS;The University of Kansas, Lawrence, KS;The University of Kansas, Lawrence, KS
Venue:
ICONIP'06 Proceedings of the 13th international conference on Neural Information Processing - Volume Part II
Year:
2006

Citing 7
Cited 0

The nature of statistical learning theory

The nature of statistical learning theory
One-class svms for document classification

The Journal of Machine Learning Research
Protein homology detection using string alignment kernels

Bioinformatics
Protein homology detection by HMM--HMM comparison

Bioinformatics
Fold recognition by combining profile--profile alignment and support vector machine

Bioinformatics
Profile-based direct kernels for remote homology detection and fold recognition

Bioinformatics
LIBSVM: A library for support vector machines

ACM Transactions on Intelligent Systems and Technology (TIST)

Quantified Score

Hi-index	0.00

Visualization

Abstract

The best protein structure prediction results today are achieved by incorporating initial structural prediction using alignments to known protein structures. The performance of these algorithms directly depends on the quality and significance of the alignment results. Support Vector Machines (SVMs) have shown great potential in providing good alignment results in cases where very low similarities to known proteins exist. In this paper we propose the use of a one-class SVM to reduce the computational resources required to perform SVM learning and classification. Experimental results show its efficiency compared to two-class SVM algorithms while producing results of similar accuracy.