Welcome to the InfoSci Platform
Discriminative Subgraph Mining for Protein Classification

Discriminative Subgraph Mining for Protein Classification

Ning Jin, Calvin Young, Wei Wang
Copyright: © 2010 |Volume: 1 |Issue: 3 |Pages: 17
ISSN: 1947-9115|EISSN: 1947-9123|EISBN13: 9781609609771|DOI: 10.4018/jkdb.2010070103
Cite Article Cite Article

MLA

Jin, Ning, et al. "Discriminative Subgraph Mining for Protein Classification." IJKDB vol.1, no.3 2010: pp.36-52. http://doi.org/10.4018/jkdb.2010070103

APA

Jin, N., Young, C., & Wang, W. (2010). Discriminative Subgraph Mining for Protein Classification. International Journal of Knowledge Discovery in Bioinformatics (IJKDB), 1(3), 36-52. http://doi.org/10.4018/jkdb.2010070103

Chicago

Jin, Ning, Calvin Young, and Wei Wang. "Discriminative Subgraph Mining for Protein Classification," International Journal of Knowledge Discovery in Bioinformatics (IJKDB) 1, no.3: 36-52. http://doi.org/10.4018/jkdb.2010070103

Export Reference

Mendeley
Favorite Full-Issue Download

Abstract

Protein classification can be performed by representing 3-D protein structures by graphs and then classifying the corresponding graphs. One effective way to classify such graphs is to use frequent subgraph patterns as features; however, the effectiveness of using subgraph patterns in graph classification is often hampered by the large search space of subgraph patterns. In this paper, the authors present two efficient discriminative subgraph mining algorithms: COM and GAIA. These algorithms directly search for discriminative subgraph patterns rather than frequent subgraph patterns which can be used to generate classification rules. Experimental results show that COM and GAIA can achieve high classification accuracy and runtime efficiency. Additionally, they find substructures that are very close to the proteins’ actual active sites.

Request Access

You do not own this content. Please login to recommend this title to your institution's librarian or purchase it from the IGI Global bookstore.