Skip to main navigation Skip to search Skip to main content

Optimization of the SVM screening kernel-application to hit definition in compound screening

  • Max Planck Institute of Molecular Cell Biology and Genetics

Research output: Chapter in Book/Report/Conference proceedingChapterpeer-review

Abstract

This study applies the Support Vector Machine (SVM) algorithm to the problem of chemical compound screening with a desired activity and hit definition. 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 a 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.

Original languageEnglish
Title of host publicationComputer Recognition Systems 2
EditorsMarek Kurzynski, Michal Wozniak, Andrzej Zolnierek, Edward Puchala
Pages224-231
Number of pages8
DOIs
Publication statusPublished - 2007

Publication series

NameAdvances in Soft Computing
Volume45
ISSN (Print)1615-3871
ISSN (Electronic)1860-0794

ASJC Scopus subject areas

  • Computer Science (miscellaneous)
  • Computational Mechanics
  • Computer Science Applications

Fingerprint

Dive into the research topics of 'Optimization of the SVM screening kernel-application to hit definition in compound screening'. Together they form a unique fingerprint.

Cite this