arXiv:0812.3147 [cs.LG]AbstractReferencesReviewsResources
Comparison of Binary Classification Based on Signed Distance Functions with Support Vector Machines
Erik M. Boczko, Todd Young, Minhui Zie, Di Wu
Published 2008-12-16Version 1
We investigate the performance of a simple signed distance function (SDF) based method by direct comparison with standard SVM packages, as well as K-nearest neighbor and RBFN methods. We present experimental results comparing the SDF approach with other classifiers on both synthetic geometric problems and five benchmark clinical microarray data sets. On both geometric problems and microarray data sets, the non-optimized SDF based classifiers perform just as well or slightly better than well-developed, standard SVM methods. These results demonstrate the potential accuracy of SDF-based methods on some types of problems.
Comments: 5 pages, 4 figures. Presented at the Ohio Collaborative Conference on Bioinformatics (OCCBIO), June 2006
Keywords: signed distance function, support vector machines, binary classification, comparison, geometric problems
Tags: conference paper
Related articles: Most relevant | Search more
arXiv:0812.3145 [cs.LG] (Published 2008-12-16)
Binary Classification Based on Potentials
arXiv:1512.08133 [cs.LG] (Published 2015-12-26)
The Utility of Abstaining in Binary Classification
arXiv:1806.06232 [cs.LG] (Published 2018-06-16)
Binary Classification in Unstructured Space With Hypergraph Case-Based Reasoning