Classes of kernels for hit definition in compound screening

0Citations
Citations of this article
1Readers
Mendeley users who have this article in their library.
Get full text

Abstract

In this paper we analyze Support Vector Machine (SVM) algorithm to the problem of chemical compounds screening with a desired activity, definition of hits. The support vector machine transforms the input data in an (unknown) high dimensional feature space and the kernel technique is applied to calculate the inner-product of feature data.The problem of automatically tuning multiple parameters for pattern recognition SVMs using our new introduced kernel for chemical compounds is considered. This is done by simple eigen analysis method which is applied to the matrix of the same dimension as the kernel matrix to find the structure of feature data, and to find the kernel parameter accordingly. We characterize distribution of data by the principle component analysis method. © 2008 Springer-Verlag Berlin Heidelberg.

Cite

CITATION STYLE

APA

Kozak, K., & Stapor, K. (2008). Classes of kernels for hit definition in compound screening. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 5097 LNAI, pp. 609–619). https://doi.org/10.1007/978-3-540-69731-2_59

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free