{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,12]],"date-time":"2025-03-12T04:18:48Z","timestamp":1741753128689,"version":"3.38.0"},"reference-count":31,"publisher":"SAGE Publications","issue":"5","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IDA"],"published-print":{"date-parts":[[2021,9,15]]},"abstract":"<jats:p>Biological network classification is an eminently challenging task in the domain of data mining since the networks contain complex structural information. Conventional biochemical experimental methods and the existing intelligent algorithms still suffer from some limitations such as immense experimental cost and inferior accuracy rate. To solve these problems, in this paper, we propose a novel framework for Biological graph classification named Biogc, which is specifically developed to predict the label of both small-scale and large-scale biological network data flexibly and efficiently. Our framework firstly presents a simplified graph kernel method to capture the structural information of each graph. Then, the obtained informative features are adopted to train different scale biological network data-oriented classifiers to construct the prediction model. Extensive experiments on five benchmark biological network datasets on graph classification task show that the proposed model Biogc outperforms the state-of-the-art methods with an accuracy rate of 98.90% on a larger dataset and 99.32% on a smaller dataset.<\/jats:p>","DOI":"10.3233\/ida-205240","type":"journal-article","created":{"date-parts":[[2021,9,17]],"date-time":"2021-09-17T15:56:50Z","timestamp":1631894210000},"page":"1153-1168","source":"Crossref","is-referenced-by-count":1,"title":["Biogc: A novel framework for biological network classification via machine learning"],"prefix":"10.1177","volume":"25","author":[{"given":"Bentian","family":"Li","sequence":"first","affiliation":[{"name":"College of Computer Science and Technology, Nanjing University of Aeronautics and Astronautics, Nanjing, Jiangsu, China"}]},{"given":"Dechang","family":"Pi","sequence":"additional","affiliation":[{"name":"College of Computer Science and Technology, Nanjing University of Aeronautics and Astronautics, Nanjing, Jiangsu, China"},{"name":"Collaborative Innovation Center of Novel Software Technology and Industrialization, Nanjing, Jiangsu, China"}]},{"given":"Yunxia","family":"Lin","sequence":"additional","affiliation":[{"name":"College of Computer Science and Technology, Nanjing University of Aeronautics and Astronautics, Nanjing, Jiangsu, China"}]},{"given":"Izhar Ahmed","family":"Khan","sequence":"additional","affiliation":[{"name":"College of Computer Science and Technology, Nanjing University of Aeronautics and Astronautics, Nanjing, Jiangsu, China"}]}],"member":"179","reference":[{"key":"10.3233\/IDA-205240_ref1","unstructured":"J. Atwood and D. Towsley, Diffusion-convolutional neural networks, in: Advances in Neural Information Systems, 2016, pp. 1993\u20132001."},{"key":"10.3233\/IDA-205240_ref2","unstructured":"K.M. Borgwardt and H.-P. Kriegel, Shortest-path kernels on graphs, in: IEEE International Conference on Data Mining, 2005, pp. 74\u201381."},{"key":"10.3233\/IDA-205240_ref3","doi-asserted-by":"crossref","unstructured":"K.M. Borgwardt, C.S. Ong, S. Sch\u00f6nauer, S.V.N. Vishwanathan, A.J. Smola and H. Kriegel, Protein function prediction via graph kernels, in: Proceedings Thirteenth International Conference on Intelligent Systems for Molecular Biology, 2005, pp. 47\u201356.","DOI":"10.1093\/bioinformatics\/bti1007"},{"key":"10.3233\/IDA-205240_ref4","unstructured":"J. Bruna, W. Zaremba, A. Szlam and Y. Lecun, Spectral networks and locally connected networks on graphs, in: Proceedings of International Conference on Learning Representations, 2014."},{"key":"10.3233\/IDA-205240_ref5","doi-asserted-by":"crossref","unstructured":"F. Chen, S. Pan, J. Jiang, H. Huo and G. Long, DAGCN: dual attention graph convolutional networks, in: International Joint Conference on Neural Networks, 2019, pp. 1\u20138.","DOI":"10.1109\/IJCNN.2019.8851698"},{"key":"10.3233\/IDA-205240_ref7","unstructured":"M. Defferrard, X. Bresson and P. Vandergheynst, Convolutional neural networks on graphs with fast localized spectral filtering, in: Advances in Neural Information Processing Systems, 2016, pp. 3844\u20133852."},{"issue":"4","key":"10.3233\/IDA-205240_ref8","doi-asserted-by":"crossref","first-page":"771","DOI":"10.1016\/S0022-2836(03)00628-4","article-title":"Distinguishing enzyme structures from non-enzymes without alignments","volume":"330","author":"Dobson","year":"2003","journal-title":"Journal of Molecular Biology"},{"issue":"5","key":"10.3233\/IDA-205240_ref9","doi-asserted-by":"crossref","first-page":"1493","DOI":"10.1007\/s00521-016-2772-z","article-title":"Biological data analysis program (bdap): a multitasking biological sequence analysis program","volume":"30","author":"Dwivedi","year":"2018","journal-title":"Neural Computing and Applications"},{"key":"10.3233\/IDA-205240_ref10","doi-asserted-by":"crossref","unstructured":"T. G\u00e4rtner, P.A. Flach and S. Wrobel, On graph kernels: Hardness results and efficient alternatives, in: Annual Conference on Computational Learning Theory, 2003, pp. 129\u2013143.","DOI":"10.1007\/978-3-540-45167-9_11"},{"issue":"22","key":"10.3233\/IDA-205240_ref11","doi-asserted-by":"crossref","first-page":"3873","DOI":"10.1093\/bioinformatics\/bty440","article-title":"Deepnf: deep network fusion for protein function prediction","volume":"34","author":"Gligorijevi\u0107","year":"2018","journal-title":"Bioinformatics"},{"issue":"1","key":"10.3233\/IDA-205240_ref13","doi-asserted-by":"crossref","first-page":"107","DOI":"10.1093\/bioinformatics\/17.1.107","article-title":"The predictive toxicology challenge 2000\u20132001","volume":"17","author":"Helma","year":"2001","journal-title":"Bioinformatics"},{"key":"10.3233\/IDA-205240_ref14","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/j.compbiomed.2019.01.025","article-title":"Detecting list-colored graph motifs in biological networks using branch-and-bound strategy","volume":"107","author":"Huang","year":"2019","journal-title":"Computers in Biology and Medicine"},{"key":"10.3233\/IDA-205240_ref15","unstructured":"D.P. Kingma and J. Ba, Adam: A method for stochastic optimization, in: International Conference on Learning Representations, 2015."},{"issue":"10","key":"10.3233\/IDA-205240_ref16","doi-asserted-by":"crossref","first-page":"2125","DOI":"10.1109\/TKDE.2017.2720734","article-title":"Deep learning of graphs with ngram convolutional neural networks","volume":"29","author":"Luo","year":"2017","journal-title":"IEEE Transactions on Knowledge and Data Engineering"},{"issue":"2","key":"10.3233\/IDA-205240_ref17","doi-asserted-by":"crossref","first-page":"209","DOI":"10.1007\/s10994-015-5517-9","article-title":"Propagation kernels: efficient graph kernels from propagated information","volume":"102","author":"Neumann","year":"2016","journal-title":"Machine Learning"},{"key":"10.3233\/IDA-205240_ref18","unstructured":"M. Niepert, M. Ahmed and K. Kutzkov, Learning convolutional neural networks for graphs, in: International Conference on Machine Learning, 2016, pp. 2014\u20132023."},{"key":"10.3233\/IDA-205240_ref19","doi-asserted-by":"crossref","unstructured":"B. Perozzi, R. Al-Rfou and S. Skiena, Deepwalk: online learning of social representations, in: ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, 2014, pp. 701\u2013710.","DOI":"10.1145\/2623330.2623732"},{"issue":"6088","key":"10.3233\/IDA-205240_ref20","doi-asserted-by":"crossref","first-page":"533","DOI":"10.1038\/323533a0","article-title":"Learning representations by back-propagating errors","volume":"323","author":"Rumelhart","year":"1986","journal-title":"Nature"},{"key":"10.3233\/IDA-205240_ref21","unstructured":"S. Sabour, N. Frosst and G.E. Hinton, Dynamic routing between capsules, in: Advances in Neural Information Processing Systems, 2017, pp. 3856\u20133866."},{"key":"10.3233\/IDA-205240_ref22","first-page":"2539","article-title":"Weisfeiler-lehman graph kernels","volume":"12","author":"Shervashidze","year":"2011","journal-title":"Journal of Machine Learning Research"},{"key":"10.3233\/IDA-205240_ref23","unstructured":"N. Shervashidze, S.V.N. Vishwanathan, T. Petri, K. Mehlhorn and K.M. Borgwardt, Efficient graphlet kernels for large graph comparison, in: Proceedings of the Twelfth International Conference on Artificial Intelligence and Statistics, 2009, pp. 488\u2013495."},{"key":"10.3233\/IDA-205240_ref24","doi-asserted-by":"crossref","unstructured":"M. Simonovsky and N. Komodakis, Dynamic edge-conditioned filters in convolutional neural networks on graphs, in: Proceedings of the IEEE Conference on Computer Vision and Pattern Recognition, 2017, pp. 3693\u20133702.","DOI":"10.1109\/CVPR.2017.11"},{"issue":"6","key":"10.3233\/IDA-205240_ref26","doi-asserted-by":"crossref","first-page":"697","DOI":"10.1038\/nbt825","article-title":"Global protein function prediction from protein-protein interaction networks","volume":"21","author":"Vazquez","year":"2003","journal-title":"Nature Biotechnology"},{"key":"10.3233\/IDA-205240_ref27","first-page":"1201","article-title":"Graph kernels","volume":"11","author":"Vishwanathan","year":"2010","journal-title":"Journal of Machine Learning Research"},{"issue":"3","key":"10.3233\/IDA-205240_ref28","doi-asserted-by":"crossref","first-page":"347","DOI":"10.1007\/s10115-007-0103-5","article-title":"Comparison of descriptor spaces for chemical compound retrieval and classification","volume":"14","author":"Wale","year":"2008","journal-title":"Knowledge and Information Systems"},{"key":"10.3233\/IDA-205240_ref29","doi-asserted-by":"crossref","unstructured":"P. Yanardag and S. Vishwanathan, Deep graph kernels, in: Proceedings of the 21th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, 2015, pp. 1365\u20131374.","DOI":"10.1145\/2783258.2783417"},{"issue":"1","key":"10.3233\/IDA-205240_ref30","doi-asserted-by":"crossref","first-page":"7","DOI":"10.1038\/nmeth.3213","article-title":"The i-tasser suite: protein structure and function prediction","volume":"12","author":"Yang","year":"2015","journal-title":"Nature Methods"},{"key":"10.3233\/IDA-205240_ref31","unstructured":"Z. Ying, J. You, C. Morris, X. Ren, W. Hamilton and J. Leskovec, Hierarchical graph representation learning with differentiable pooling, in: Advances in Neural Information Processing Systems, 2018, pp. 4800\u20134810."},{"key":"10.3233\/IDA-205240_ref32","doi-asserted-by":"crossref","unstructured":"M. Zhang, Z. Cui, M. Neumann and Y. Chen, An end-to-end deep learning architecture for graph classification, in: Thirty-Second AAAI Conference on Artificial Intelligence, 2018, pp. 4438\u20134445.","DOI":"10.1609\/aaai.v32i1.11782"},{"key":"10.3233\/IDA-205240_ref33","unstructured":"X. Zhang and L. Chen, Capsule graph neural network, in: International Conference on Learning Representations, 2019."},{"issue":"21","key":"10.3233\/IDA-205240_ref35","doi-asserted-by":"crossref","first-page":"16647","DOI":"10.1007\/s00521-020-04908-5","article-title":"Network representation learning: a systematic literature review","volume":"32","author":"Li","year":"2020","journal-title":"Neural Computing and Applications"}],"container-title":["Intelligent Data Analysis"],"original-title":[],"link":[{"URL":"https:\/\/content.iospress.com\/download?id=10.3233\/IDA-205240","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,3,11]],"date-time":"2025-03-11T05:44:54Z","timestamp":1741671894000},"score":1,"resource":{"primary":{"URL":"https:\/\/journals.sagepub.com\/doi\/full\/10.3233\/IDA-205240"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,9,15]]},"references-count":31,"journal-issue":{"issue":"5"},"URL":"https:\/\/doi.org\/10.3233\/ida-205240","relation":{},"ISSN":["1088-467X","1571-4128"],"issn-type":[{"type":"print","value":"1088-467X"},{"type":"electronic","value":"1571-4128"}],"subject":[],"published":{"date-parts":[[2021,9,15]]}}}