Graph Kernels and Applications in Protein Classification

Jiang Qiangrong, Xiong Zhikang, Zhai Can

Abstract


Protein classification is a well established research field concerned with the discovery of molecule’s properties through informa­tional techniques. Graph-based kernels provide a nice framework combining machine learning techniques with graph theory. In this paper we introduce a novel graph kernel method for an­notating functional residues in protein structures. A structure­ is first modeled as a protein contact graph, where nodes ­corres­pond to residues and edges connect spatially neighboring resi­dues. In experiments on classification of graph models of proteins, the method based on Weisfeiler-Lehman shortest path kernel with complement graphs outperformed other state-of-art methods.

Keywords


Protein Classification; Machine Learning; Graph Kernels; Weisfeiler-Lehman

Full Text:

PDF


DOI: http://doi.org/10.11591/ijeecs.v12.i10.pp7501-7508
Total views : 54 times

Refbacks

  • There are currently no refbacks.


Creative Commons License
This work is licensed under a Creative Commons Attribution-ShareAlike 4.0 International License.

shopify stats IJEECS visitor statistics