We introduce a new kernel function called Fast computation of marginalized walk kernels for graph classification for the virtual screening in drug discovery. This kernel is an extension of marginalized graph kernels. In this paper we use two dimensional graphical representations of chemical structures. The similarity between molecules is measured by using kernel function. For reducing the time complexity of kernel computation we use fast computing methods like Sylvester equation. The efficiency is evaluated using MUTAG dataset. The results show that the new kernel function is more efficient than existing kernel. This gives the same accuracy with lesser time complexity. © 2010 ACM.
cited By (since 1996)0; Conference of org.apache.xalan.xsltc.dom.DOMAdapter@576040c5 ; Conference Date: org.apache.xalan.xsltc.dom.DOMAdapter@703c7253 Through org.apache.xalan.xsltc.dom.DOMAdapter@1075e0b6; Conference Code:82507
M. P. Preeja and Soman, K. P., “Fast computation of marginalized walk kernel for virtual screening in drug discovery”, in Proceedings of the 1st Amrita ACM-W Celebration of Women in Computing in India, A2CWiC'10, Coimbatore, 2010.