By Topic

Drug candidate protein classification by QSAR based incremental decremental kernel learning model

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$33 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

1 Author(s)
Uğur Ayan ; Bilgisayar Mühendisliği Bölümü, İstanbul Kültür Üniversitesi, Turkey

Although there are many studies on computer-aided drug design in recent years, determination of proteins for drug candidates is a remarkable area for research. The first major shortcoming of this kind of problems is the feature selection representing the protein structure best, the former one is the computational complexity. We use three datasets with different sizes such as Cherkasov dataset with 2684 examples including over 160 descriptors, sdf formatted DrugDataBank dataset with 7440 examples including over 300 descriptors and Pharmeks Company's real drug database having over 250.000 samples. A statistical multiple relief algorithm is developed in order to measure the quality of the attributes and to reduce the dimension of the dataset. We applied a new approach working on subspaces of dataset called as incremental decremental kernel learning model. As a result, we found that our new approach has better accuracy and lower computational complexity than the other traditional supervised algorithms.

Published in:

Electrical, Electronics and Computer Engineering (ELECO), 2010 National Conference on

Date of Conference:

2-5 Dec. 2010