{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,2]],"date-time":"2026-05-02T04:20:48Z","timestamp":1777695648129,"version":"3.51.4"},"reference-count":37,"publisher":"SAGE Publications","issue":"3","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IDA"],"published-print":{"date-parts":[[2018,5,9]]},"DOI":"10.3233\/ida-163343","type":"journal-article","created":{"date-parts":[[2018,5,11]],"date-time":"2018-05-11T11:56:02Z","timestamp":1526039762000},"page":"581-596","source":"Crossref","is-referenced-by-count":0,"title":["An efficient heuristic approach for learning a set of composite graph classification rules"],"prefix":"10.1177","volume":"22","author":[{"given":"Viet Anh","family":"Nguyen","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Long Giang","family":"Nguyen","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"179","reference":[{"key":"10.3233\/IDA-163343_ref1","doi-asserted-by":"crossref","first-page":"381","DOI":"10.1016\/j.knosys.2011.12.002","article-title":"Frequent approximate subgraphs as features for graph-based image classification,","volume":"27","author":"Acosta-Mendoza","year":"2012","journal-title":"Knowledge-Based System"},{"key":"10.3233\/IDA-163343_ref2","first-page":"74","article-title":"Shortest-path kernels on graphs","author":"Borgwardt","year":"2005","journal-title":"DM-05"},{"key":"10.3233\/IDA-163343_ref3","doi-asserted-by":"crossref","unstructured":"B. Bringmann, A. Zimmermann, L.D. Raedt and S. Nijssen, Don\u2019t be afraid of simpler patterns, In 10th European Conference on Principles and Practice of Knowledge Discovery in Databases PKDD, 2006, pp. 55\u201366.","DOI":"10.1007\/11871637_10"},{"key":"10.3233\/IDA-163343_ref4","doi-asserted-by":"crossref","first-page":"255","DOI":"10.1016\/S0167-8655(97)00179-7","article-title":"A graph distance metric based on the maximal common subgraph","volume":"19","author":"Bunke","year":"1998","journal-title":"Pattern Recognition Letters"},{"key":"10.3233\/IDA-163343_ref5","unstructured":"W.W. Cohen and Y. Singer, A simple, fast, and effective rule learner, In Proceedings of the Sixteenth National Conference on Artificial Intelligence, 1999, pp\u00a0335\u2013342."},{"key":"10.3233\/IDA-163343_ref6","doi-asserted-by":"crossref","unstructured":"B. Davey and H. Priestley, Introduction to lattices and order, Cambridge University Press, 2 edition, 2002.","DOI":"10.1017\/CBO9780511809088"},{"issue":"1\u20133","key":"10.3233\/IDA-163343_ref7","doi-asserted-by":"crossref","first-page":"225","DOI":"10.1023\/A:1012470815092","article-title":"Linear programming boosting via column generation","volume":"46","author":"Demiriz","year":"2002","journal-title":"Machine Learning"},{"key":"10.3233\/IDA-163343_ref8","doi-asserted-by":"crossref","first-page":"35","DOI":"10.1109\/ICDM.2003.1250900","article-title":"Frequent sub-structure-based approaches for classifying chemical compounds","author":"Deshpande","year":"2003","journal-title":"ICDM-03"},{"issue":"4","key":"10.3233\/IDA-163343_ref9","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":"1","key":"10.3233\/IDA-163343_ref10","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1145\/2629328","article-title":"Structured sparse boosting for graph classification,","volume":"9","author":"Fei","year":"2014","journal-title":"ACM Trans. Knowl. Discov. Data"},{"issue":"1","key":"10.3233\/IDA-163343_ref11","doi-asserted-by":"crossref","first-page":"119","DOI":"10.1006\/jcss.1997.1504","article-title":"A decision-theoretic generalization of on-line learning and an application to boosting","volume":"55","author":"Freund","year":"1997","journal-title":"Journal of Computer and System Sciences"},{"key":"10.3233\/IDA-163343_ref12","doi-asserted-by":"crossref","unstructured":"B. Ganter and R. Wille, Formal Concept Analysis, Mathematical Foundations. Springer, 1998.","DOI":"10.1007\/978-3-642-59830-2"},{"key":"10.3233\/IDA-163343_ref13","first-page":"129","article-title":"On graph kernels: hardness results and efficient alternatives","author":"G\u00e4rtner","year":"2003","journal-title":"COLT-03"},{"key":"10.3233\/IDA-163343_ref14","doi-asserted-by":"crossref","first-page":"129","DOI":"10.1007\/978-3-540-45167-9_11","article-title":"On graph kernels: Hardness results and efficient alternatives","author":"Gartner","year":"2003","journal-title":"Learning Theory and Kernel Machines"},{"key":"10.3233\/IDA-163343_ref15","unstructured":"J.A. Gonzalez, L.B. Holder and D.J. Cook, Graph-based relational concept learning, In Proceedings of the Nineteenth International Conference on Machine Learning, 2002, pp. 219\u2013226."},{"issue":"1\u20132","key":"10.3233\/IDA-163343_ref16","first-page":"50","article-title":"Graph mining: procedure, application to drug discovery and recent advances","volume":"18","author":"Ichigaku","year":"2013","journal-title":"Drug Discovery Today"},{"key":"10.3233\/IDA-163343_ref17","doi-asserted-by":"crossref","unstructured":"N. Jin, C. Young and W. Wang, Graph classification based on pattern co-occurrence, In Proceedings of the 18th ACM Conference on Information and Knowledge Management, CIKM \u201909, 2009, pp.\u00a0573\u2013582.","DOI":"10.1145\/1645953.1646027"},{"key":"10.3233\/IDA-163343_ref18","unstructured":"H. Kashima, K. Tsuda and A. Inokuchi, Marginalized kernels between labeled graphs, In Proceedings of the Twentieth International Conference on Machine Learning, 2003, pp.\u00a0321\u2013328."},{"key":"10.3233\/IDA-163343_ref19","doi-asserted-by":"crossref","unstructured":"X. Kong, W. Fan and P.S. Yu, Dual active feature and sample selection for graph classification, In Proceedings of the 17th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, KDD \u201911, 2011, pp.\u00a0654\u2013662.","DOI":"10.1145\/2020408.2020511"},{"key":"10.3233\/IDA-163343_ref20","doi-asserted-by":"crossref","unstructured":"X. Kong and P.S. Yu, Semi-supervised feature selection for graph classification, In Proceedings of the 16th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, KDD \u201910, 2010, pp.\u00a0793\u2013802.","DOI":"10.1145\/1835804.1835905"},{"key":"10.3233\/IDA-163343_ref21","first-page":"729","article-title":"An application of boosting to graph classification","author":"Kudo","year":"2004","journal-title":"NIPS 2004"},{"key":"10.3233\/IDA-163343_ref22","doi-asserted-by":"crossref","unstructured":"C.X. Ling, J. Huang and H. Zhang, Auc: A better measure than accuracy in comparing learning algorithms, In Proceedings of the 16th Canadian Society for Computational Studies of Intelligence Conference on Advances in Artificial Intelligence, 2003, pp.\u00a0329\u2013341.","DOI":"10.1007\/3-540-44886-1_25"},{"issue":"5","key":"10.3233\/IDA-163343_ref23","doi-asserted-by":"crossref","first-page":"2003","DOI":"10.1021\/ci060138m","article-title":"The pharmacophore kernel for virtual screening with support vector machines","volume":"46","author":"Mah\u00e9","year":"2006","journal-title":"Journal of Chemical Information and Modeling"},{"issue":"2","key":"10.3233\/IDA-163343_ref24","first-page":"103","article-title":"The presence of lattice theory in discrete problems of mathematical social sciences why","volume":"46","author":"Monjardet","year":"2003","journal-title":"Mathematical Social are Either Active or Inactive in a Screen for Anti-Cancer ActivitySciences"},{"key":"10.3233\/IDA-163343_ref25","doi-asserted-by":"crossref","unstructured":"H.D.K. Moonesinghe, H. Valizadegan, S.J. Fodeh and P. Tan, A probabilistic substructure-based approach for graph classification, In 19th IEEE International Conference on Tools with Artificial Intelligence (ICTAI 2007), October 29\u201331, 2007, Patras, Greece, Volume 1, 2007, pp.\u00a0346\u2013349.","DOI":"10.1109\/ICTAI.2007.159"},{"issue":"12","key":"10.3233\/IDA-163343_ref26","doi-asserted-by":"crossref","first-page":"11172","DOI":"10.1016\/j.eswa.2012.03.035","article-title":"Learning from graph data by putting graphs on the lattice","volume":"39","author":"Nguyen","year":"2012","journal-title":"Expert Systems with Applications"},{"issue":"8","key":"10.3233\/IDA-163343_ref27","doi-asserted-by":"crossref","first-page":"1093","DOI":"10.1016\/j.neunet.2005.07.009","article-title":"Graph kernels for chemical informatics","volume":"18","author":"Ralaivola","year":"2005","journal-title":"Neural Networks"},{"key":"10.3233\/IDA-163343_ref28","first-page":"65","article-title":"Expressivity versus efficiency of graph kernels","author":"Ramon","year":"2003","journal-title":"Workshop on Mining Graphs, Trees and Sequences"},{"issue":"1","key":"10.3233\/IDA-163343_ref29","doi-asserted-by":"crossref","first-page":"69","DOI":"10.1007\/s10994-008-5089-z","article-title":"gBoost: A mathematical programming approach to graph classification and regression","volume":"75","author":"Saigo","year":"2009","journal-title":"Machine Learning"},{"key":"10.3233\/IDA-163343_ref30","first-page":"487","article-title":"Graph mining applications to social network analysis","author":"Tang","year":"2010","journal-title":"Managing and Mining Graph Data"},{"key":"10.3233\/IDA-163343_ref31","doi-asserted-by":"crossref","unstructured":"M. Thoma, H. Cheng, A. Gretton, J. Han, H. Kriegel, A. Smola, L. Song, P. Yu, X. Yan and K. Borgwardt, Near-optimal supervised feature selection among frequent subgraphs, In SDM-09, 2009.","DOI":"10.1137\/1.9781611972795.92"},{"issue":"3","key":"10.3233\/IDA-163343_ref32","first-page":"347","article-title":"Comparison of descriptor spaces for chemical compound retrieval and classification","volume":"14","author":"Wale","year":"2008","journal-title":"Information System"},{"key":"10.3233\/IDA-163343_ref33","doi-asserted-by":"crossref","first-page":"701","DOI":"10.1016\/S0167-8655(01)00022-8","article-title":"Graph distances using graph union","volume":"22","author":"Wallis","year":"2001","journal-title":"Pattern Regcognition Letters"},{"key":"10.3233\/IDA-163343_ref34","first-page":"433","article-title":"Mining significant graph patterns by leap search","author":"Yan","year":"2008","journal-title":"ICMD-08"},{"key":"10.3233\/IDA-163343_ref35","first-page":"721","article-title":"gSpan: graph-based substructure pattern mining,","author":"Yan","year":"2002","journal-title":"ICDM-02"},{"key":"10.3233\/IDA-163343_ref36","doi-asserted-by":"crossref","first-page":"286","DOI":"10.1145\/956750.956784","article-title":"Closegraph: Mining closed frequent graph patterns","author":"Yan","year":"2003","journal-title":"KDD-03"},{"key":"10.3233\/IDA-163343_ref37","doi-asserted-by":"crossref","unstructured":"Y. Zhao, X. Kong and P.S. Yu, Positive and unlabeled learning for graph classification, In Proceedings of the 2011 IEEE 11th International Conference on Data Mining, ICDM \u201911, 2011, pp.\u00a0962\u2013971.","DOI":"10.1109\/ICDM.2011.119"}],"container-title":["Intelligent Data Analysis"],"original-title":[],"link":[{"URL":"https:\/\/content.iospress.com\/download?id=10.3233\/IDA-163343","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,4,29]],"date-time":"2026-04-29T09:18:05Z","timestamp":1777454285000},"score":1,"resource":{"primary":{"URL":"https:\/\/journals.sagepub.com\/doi\/full\/10.3233\/IDA-163343"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018,5,9]]},"references-count":37,"journal-issue":{"issue":"3"},"URL":"https:\/\/doi.org\/10.3233\/ida-163343","relation":{},"ISSN":["1088-467X","1571-4128"],"issn-type":[{"value":"1088-467X","type":"print"},{"value":"1571-4128","type":"electronic"}],"subject":[],"published":{"date-parts":[[2018,5,9]]}}}