{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,10]],"date-time":"2026-06-10T15:46:23Z","timestamp":1781106383550,"version":"3.54.1"},"reference-count":22,"publisher":"IGI Global Scientific Publishing","issue":"3","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2010,7,1]]},"abstract":"<p>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\u2019 actual active sites.<\/p>","DOI":"10.4018\/jkdb.2010070103","type":"journal-article","created":{"date-parts":[[2011,2,15]],"date-time":"2011-02-15T15:20:07Z","timestamp":1297783207000},"page":"36-52","source":"Crossref","is-referenced-by-count":0,"title":["Discriminative Subgraph Mining for Protein Classification"],"prefix":"10.4018","volume":"1","author":[{"given":"Ning","family":"Jin","sequence":"first","affiliation":[{"name":"University of North Carolina, Chapel Hill, USA"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Calvin","family":"Young","sequence":"additional","affiliation":[{"name":"University of North Carolina, Chapel Hill, USA"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Wei","family":"Wang","sequence":"additional","affiliation":[{"name":"University of North Carolina, Chapel Hill, USA"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"2432","reference":[{"key":"jkdb.2010070103-0","doi-asserted-by":"publisher","DOI":"10.1110\/ps.062189906"},{"key":"jkdb.2010070103-1","first-page":"403","article-title":"Almost Delaunay Simplices: Nearest Neighbor Relations for Imprecise Points. In","volume":"2004","author":"D.Bandyopadhyay","year":"2004","journal-title":"Proceedings of SODA"},{"key":"jkdb.2010070103-2","unstructured":"Chang, C.-C., & Lin, C.-J. (2001). LIBSVM: a library for support vector machines. Retrieved from http:\/\/www.csie.ntu.edu.tw\/~cjlin\/libsvm"},{"key":"jkdb.2010070103-3","doi-asserted-by":"crossref","unstructured":"Fei, H., & Huan, J. (2008). Structure feature selection for graph classification. In Proceedings of the CIKM (pp. 991-1000).","DOI":"10.1145\/1458082.1458212"},{"key":"jkdb.2010070103-4","doi-asserted-by":"crossref","unstructured":"Fei, H., & Huan, J. (2009). L2 Norm Regularized Feature Kernel Regression for Graph Data. In Proceedings of the CIKM (pp. 593-600).","DOI":"10.1145\/1645953.1646029"},{"key":"jkdb.2010070103-5","doi-asserted-by":"crossref","unstructured":"Fr\u00f6hlich, H., Wegner, J. K., Sieker, F., & Zell, A. (2005). Optimal assignment kernels for attributed molecular graphs. In Proceedings of the ICML (pp. 225-232).","DOI":"10.1145\/1102351.1102380"},{"key":"jkdb.2010070103-6","doi-asserted-by":"crossref","unstructured":"G\u00e4rtner, T., Flach, P. A., & Wrobel, S. (2003). On graph kernels: hardness results and efficient alternatives. In Proceedings of the COLT (pp. 129-143).","DOI":"10.1007\/978-3-540-45167-9_11"},{"key":"jkdb.2010070103-7","unstructured":"Gonzalez, J. A., Holder, L. B., & Hook, D. J. (2002). Graph-based relational concept learning. In Proceedings of the ICML (pp. 219-226)."},{"key":"jkdb.2010070103-8","unstructured":"Huan, J., Wang, W., Bandyopadhyay, D., Snoeyink, J., Prins, J., & Tropsha, A. (2004). Mining spatial motifs from protein structure graphs. In Proceedings of the RECOMB (pp. 308-315)."},{"key":"jkdb.2010070103-9","doi-asserted-by":"crossref","unstructured":"Jin, N., Young, C., & Wang, W. (2009). Graph Classification Based on Pattern Co-occurrence. In Proceedings of the CIKM (pp. 573-582).","DOI":"10.1145\/1645953.1646027"},{"key":"jkdb.2010070103-10","doi-asserted-by":"crossref","unstructured":"Jin, N., Young, C., & Wang, W. (2010). GAIA: graph classification using evolutionary computation. In Proceedings of the SIGMOD (pp. 879-890).","DOI":"10.1145\/1807167.1807262"},{"key":"jkdb.2010070103-11","unstructured":"Kashima, H., & Koyanagi, T. (2002). SVM kernels for semi-structured data. In Proceedings of the ICML (pp. 291-298)."},{"key":"jkdb.2010070103-12","unstructured":"Kashima, H., Tsuda, K., & Inokuchi, A. (2003). Marginalized kernels between labeled graphs. In Proceedings of the ICML (pp. 321-328)."},{"key":"jkdb.2010070103-13","unstructured":"Kudo, T., Maeda, E., & Matsumoto, Y. (2004). An application of boosting to graph classification. In Proceedings of the NIPS."},{"key":"jkdb.2010070103-14","doi-asserted-by":"publisher","DOI":"10.1016\/S0022-2836(05)80134-2"},{"key":"jkdb.2010070103-15","doi-asserted-by":"crossref","unstructured":"Ranu, S., & Singh, A. K. (2009). GraphSig: A Scalable Approach to Mining Significant Subgraphs in Large Graph Databases. In Proceedings of the ICDE (pp. 844-855).","DOI":"10.1109\/ICDE.2009.133"},{"key":"jkdb.2010070103-16","doi-asserted-by":"crossref","unstructured":"Saigo, H., Kraemer, N., & Tsuda, K. (2008). Partial Least Squares Regression for Graph Mining. In Proceedings of the SIGKDD (pp. 578-586).","DOI":"10.1145\/1401890.1401961"},{"key":"jkdb.2010070103-17","doi-asserted-by":"crossref","unstructured":"Smalter, A., Huan, J., & Lushington, G. (2008). A Graph Pattern Diffusion Kernel for Chemical Compound Classification. In Proceedings of BIBE'08.","DOI":"10.1109\/BIBE.2008.4696654"},{"key":"jkdb.2010070103-18","doi-asserted-by":"crossref","unstructured":"Thoma, M., Cheng, H., Gretton, A., Han, J., Kriegel, H., Smola, A., et al. (2009). Near-optimal supervised feature selection among frequent subgraphs. In Proceedings of the SDM.","DOI":"10.1137\/1.9781611972795.92"},{"key":"jkdb.2010070103-19","doi-asserted-by":"publisher","DOI":"10.1093\/bioinformatics\/btg224"},{"key":"jkdb.2010070103-20","doi-asserted-by":"crossref","unstructured":"Yan, X., Cheng, H., Han, J., & Yu, P. S. (2008). Mining significant graph patterns by leap search. In Proceedings of the SIGMOD (pp. 433-444).","DOI":"10.1145\/1376616.1376662"},{"key":"jkdb.2010070103-21","unstructured":"Yan, X., & Han, J. (2002). gSpan: graph-based substructure pattern mining. In Proceedings of the ICDM (pp. 721-724)."}],"container-title":["International Journal of Knowledge Discovery in Bioinformatics"],"original-title":[],"language":"ng","link":[{"URL":"https:\/\/www.igi-global.com\/viewtitle.aspx?TitleId=47095","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,6,1]],"date-time":"2022-06-01T15:19:20Z","timestamp":1654096760000},"score":1,"resource":{"primary":{"URL":"https:\/\/services.igi-global.com\/resolvedoi\/resolve.aspx?doi=10.4018\/jkdb.2010070103"}},"subtitle":[""],"short-title":[],"issued":{"date-parts":[[2010,7,1]]},"references-count":22,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2010,7]]}},"URL":"https:\/\/doi.org\/10.4018\/jkdb.2010070103","relation":{},"ISSN":["1947-9115","1947-9123"],"issn-type":[{"value":"1947-9115","type":"print"},{"value":"1947-9123","type":"electronic"}],"subject":[],"published":{"date-parts":[[2010,7,1]]}}}