{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T00:45:28Z","timestamp":1725583528387},"publisher-location":"Berlin, Heidelberg","reference-count":39,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642163449"},{"type":"electronic","value":"9783642163456"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2011]]},"DOI":"10.1007\/978-3-642-16345-6_16","type":"book-chapter","created":{"date-parts":[[2011,5,16]],"date-time":"2011-05-16T12:31:03Z","timestamp":1305549063000},"page":"335-351","source":"Crossref","is-referenced-by-count":1,"title":["Graph Classification Methods in Chemoinformatics"],"prefix":"10.1007","author":[{"given":"Koji","family":"Tsuda","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2011,4,9]]},"reference":[{"key":"16_CR1_16","unstructured":"Agrawal, R., & Srikant, R. (1994). Fast algorithms for mining association rules in large databases. In Proceedings of VLDB 1994 (pp. 487\u2013499)."},{"key":"16_CR2_16","doi-asserted-by":"crossref","unstructured":"Asai, T., Abe, K., Kawasoe, S., Arimura, H., Sakamoto, H., & Arikawa, S. (2002). Efficient substructure discovery from large semi-structured data. In Proceedings of 2nd SIAM data mining conference (SDM) (pp. 158\u2013174).","DOI":"10.1137\/1.9781611972726.10"},{"key":"16_CR3_16","doi-asserted-by":"crossref","unstructured":"Boley, M., & Grosskreutz, H. (2008). A randomized approach for approximating the number of frequent sets. In Proceedings of the 8th IEEE international conference on data mining (pp. 43\u201352).","DOI":"10.1109\/ICDM.2008.85"},{"issue":"Suppl. 1","key":"16_CR4_16","first-page":"i47","volume":"21","author":"KM Borgwardt","year":"2006","unstructured":"Borgwardt, K. M., Ong, C. S., Sch\u00f6nauer, S., Vishwanathan, S. V. N., Smola, A. J., & Kriegel, H.-P. (2006). Protein function prediction via graph kernels. Bioinformatics, 21(Suppl. 1), i47\u2013i56.","journal-title":"Bioinformatics"},{"key":"16_CR5_16","doi-asserted-by":"crossref","unstructured":"Cheng, H., Lo, D., Zhou, Y., Wang, X., & Yan, X. (2009). Identifying bug signatures using discriminative graph mining. In Proceedings of the 18th international symposium on software testing and analysis (pp. 141\u2013152).","DOI":"10.1145\/1572272.1572290"},{"issue":"1\u20133","key":"16_CR6_16","doi-asserted-by":"publisher","first-page":"225","DOI":"10.1023\/A:1012470815092","volume":"46","author":"A Demiriz","year":"2002","unstructured":"Demiriz, A., Bennet, K. P., & Shawe-Taylor, J. (2002). Linear programming boosting via column generation. Machine Learning, 46(1\u20133), 225\u2013254.","journal-title":"Machine Learning"},{"issue":"8","key":"16_CR7_16","doi-asserted-by":"publisher","first-page":"1036","DOI":"10.1109\/TKDE.2005.127","volume":"17","author":"M Deshpande","year":"2005","unstructured":"Deshpande, M., Kuramochi, M., Wale, N., & Karypis, G. (2005). Frequent sub-structure-based approaches for classifying chemical compounds. IEEE Transactions on Knowledge and Data Engineering, 17(8), 1036\u20131050.","journal-title":"IEEE Transactions on Knowledge and Data Engineering"},{"key":"16_CR8_16","doi-asserted-by":"publisher","first-page":"229","DOI":"10.1016\/S0012-365X(98)00213-1","volume":"194","author":"O Merle du","year":"1999","unstructured":"du\u00a0Merle, O., Villeneuve, D., Desrosiers, J., & Hansen, P. (1999). Stabilized column generation. Discrete Mathematics, 194, 229\u2013237.","journal-title":"Discrete Mathematics"},{"key":"16_CR9_16","doi-asserted-by":"crossref","unstructured":"Eichinger, F., B\u00f6hm, K., & Huber, M. (2008). Mining edge-weighted call graphs to localise software bugs. In Proceedings of the European conference on machine learning and principles and practice of knowledge discovery in databases (ECML PKDD) (pp. 333\u2013348).","DOI":"10.1007\/978-3-540-87479-9_40"},{"key":"16_CR10_16","doi-asserted-by":"publisher","DOI":"10.1002\/3527601643","volume-title":"Chemoinformatics: A textbook","author":"J Gasteiger","year":"2003","unstructured":"Gasteiger, J., & Engel, T. (2003). Chemoinformatics: A textbook. Weinheim, Germany: Wiley-VCH."},{"issue":"1\u20133","key":"16_CR11_16","doi-asserted-by":"publisher","first-page":"389","DOI":"10.1023\/A:1012487302797","volume":"46","author":"I Guyon","year":"2002","unstructured":"Guyon, I., Weston, J., Bahnhill, S., & Vapnik, V. (2002). Gene selection for cancer classification using support vector machines. Machine Learning, 46(1\u20133), 389\u2013422.","journal-title":"Machine Learning"},{"key":"16_CR12_16","doi-asserted-by":"publisher","first-page":"2480","DOI":"10.1093\/bioinformatics\/btl431","volume":"22","author":"M Hamada","year":"2006","unstructured":"Hamada, M., Tsuda, K., Kudo, T., Kin, T., & Asai, K. (2006). Mining frequent stem patterns from unaligned RNA sequences. Bioinformatics, 22, 2480\u20132487.","journal-title":"Bioinformatics"},{"key":"16_CR13_16","volume-title":"Data mining: Concepts and techniques","author":"J Han","year":"2000","unstructured":"Han, J., & Kamber, M. (2000). Data mining: Concepts and techniques. San Francisco: Morgan Kaufmann."},{"key":"16_CR14_16","doi-asserted-by":"crossref","first-page":"1402","DOI":"10.1021\/ci034254q","volume":"44","author":"C Helma","year":"2004","unstructured":"Helma, C., Cramer, T., Kramer, S., & Raedt, L. D. (2004). Data mining and machine learning techniques for the identification of mutagenicity inducing substructures and structure activity relationships of noncongeneric compounds. Journal of Chemical Information Computer Science, 44, 1402\u20131411.","journal-title":"Journal of Chemical Information Computer Science"},{"key":"16_CR15_16","unstructured":"Inokuchi, A. (2005). Mining generalized substructures from a set of labeled graphs. In Proceedings of the 4th IEEE internatinal conference on data mining (pp. 415\u2013418). Los Alamitos, CA: IEEE Computer Society."},{"key":"16_CR16_16","unstructured":"Kashima, H., Tsuda, K., & Inokuchi, A. (2003). Marginalized kernels between labeled graphs. In Proceedings of the 21st international conference on machine learning (pp. 321\u2013328). New York: AAAI."},{"key":"16_CR17_16","doi-asserted-by":"publisher","first-page":"597","DOI":"10.1021\/ci0503715","volume":"46","author":"J Kazius","year":"2006","unstructured":"Kazius, J., Nijssen, S., Kok, J., B\u00e4ck, T., & Ijzerman, A. P. (2006). Substructure mining using elaborate chemical representation. Journal of Chemical Information Modeling, 46, 597\u2013605.","journal-title":"Journal of Chemical Information Modeling"},{"key":"16_CR18_16","doi-asserted-by":"publisher","first-page":"273","DOI":"10.1016\/S0004-3702(97)00043-X","volume":"1\u20132","author":"R Kohavi","year":"1997","unstructured":"Kohavi, R., & John, G. H. (1997). Wrappers for feature subset selection. Artificial Intelligence, 1\u20132, 273\u2013324.","journal-title":"Artificial Intelligence"},{"key":"16_CR19_16","unstructured":"Kudo, T., Maeda, E., & Matsumoto, Y. (2005). An application of boosting to graph classification. In Advances in neural information processing systems (Vol. 17, pp. 729\u2013736). Cambridge, MA: MIT."},{"key":"16_CR20_16","volume-title":"Optimization by vector space methods","author":"DG Luenberger","year":"1969","unstructured":"Luenberger, D. G. (1969). Optimization by vector space methods. New York: Wiley."},{"key":"16_CR21_16","doi-asserted-by":"publisher","first-page":"939","DOI":"10.1021\/ci050039t","volume":"45","author":"P Mah\u00e9","year":"2005","unstructured":"Mah\u00e9, P., Ueda, N., Akutsu, T., Perret, J.-L., & Vert, J.-P. (2005). Graph kernels for molecular structure \u2013 activity relationship analysis with support vector machines. Journal of Chemical and Information Modeling, 45, 939\u2013951.","journal-title":"Journal of Chemical and Information Modeling"},{"key":"16_CR22_16","unstructured":"Morishita, S. (2001). Computing optimal hypotheses efficiently for boosting. In Discovery science (pp. 471\u2013481)."},{"key":"16_CR23_16","unstructured":"Morishita, S., & Sese, J. (2000). Traversing itemset lattices with statistical metric pruning. In Proceedings of ACM SIGACT-SIGMOD-SIGART symposium on database systems (PODS) (pp. 226\u2013236)."},{"key":"16_CR24_16","doi-asserted-by":"crossref","unstructured":"Nijssen, S., & Kok, J. N. (2004). A quickstart in frequent structure mining can make a difference. In Proceedings of the 10th ACM SIGKDD international conference on knowledge discovery and data mining (pp. 647\u2013652). New York: ACM Press.","DOI":"10.1145\/1014052.1014134"},{"key":"16_CR25_16","doi-asserted-by":"crossref","unstructured":"Nowozin, S., Tsuda, K., Uno, T., Kudo, T., & Bakir, G. (2007). Weighted substructure mining for image analysis. In IEEE computer society conference on computer vision and pattern recognition (CVPR). Los Alamitos, CA: IEEE Computer Society.","DOI":"10.1109\/CVPR.2007.383171"},{"issue":"11","key":"16_CR26_16","doi-asserted-by":"publisher","first-page":"1424","DOI":"10.1109\/TKDE.2004.77","volume":"16","author":"J Pei","year":"2004","unstructured":"Pei, J., Han, J., Mortazavi-asl, B., Wang, J., Pinto, H., Chen, Q., Dayal, U., & Hsu, M. (2004). Mining sequential patterns by pattern-growth: The prefixspan approach. IEEE Transactions on Knowledge and Data Engineering, 16(11), 1424\u20131440.","journal-title":"IEEE Transactions on Knowledge and Data Engineering"},{"issue":"9","key":"16_CR27_16","doi-asserted-by":"publisher","first-page":"1184","DOI":"10.1109\/TPAMI.2002.1033211","volume":"24","author":"G R\u00e4tsch","year":"2002","unstructured":"R\u00e4tsch, G., Mika, S., Sch\u00f6lkopf, B., & M\u00fcller, K.-R. (2002). Constructing boosting algorithms from SVMs: An application to one-class classification. IEEE Transactions on Pattern Analysis Machine Intelligence, 24(9), 1184\u20131199.","journal-title":"IEEE Transactions on Pattern Analysis Machine Intelligence"},{"key":"16_CR28_16","doi-asserted-by":"crossref","unstructured":"Rosipal, R., & Kr\u00e4mer, N. (2006). Overview and recent advances in partial least squares. In Subspace, latent structure and feature selection techniques (pp. 34\u201351). Springer.","DOI":"10.1007\/11752790_2"},{"key":"16_CR29_16","doi-asserted-by":"crossref","unstructured":"Saigo, H., Kr\u00e4mer, N., & Tsuda, K. (2008). Partial least squares regression for graph mining. In Proceedings of the 14th ACM SIGKDD international conference on knowledge discovery and data mining (pp. 578\u2013586).","DOI":"10.1145\/1401890.1401961"},{"key":"16_CR30_16","unstructured":"Saigo, H., Nowozin, S., Kadowaki, T., Kudo, T., & Tsuda, K. (2008). GBoost: A mathematical programming approach to graph classification and regression. Machine Learning."},{"key":"16_CR31_16","doi-asserted-by":"publisher","first-page":"353","DOI":"10.1109\/TSMC.1983.6313167","volume":"13","author":"A Sanfeliu","year":"1983","unstructured":"Sanfeliu, A., & Fu, K. S. (1983). A distance measure between attributed relational graphs for pattern recognition. IEEE Transactions on System, Man and Cybernetics, 13, 353\u2013362.","journal-title":"IEEE Transactions on System, Man and Cybernetics"},{"key":"16_CR32_16","volume-title":"Learning with Kernels: Support vector machines, regularization, optimization, and beyond","author":"B Sch\u00f6lkopf","year":"2002","unstructured":"Sch\u00f6lkopf, B., & Smola, A. J. (2002). Learning with Kernels: Support vector machines, regularization, optimization, and beyond. Cambridge, MA: MIT."},{"key":"16_CR33_16","doi-asserted-by":"crossref","unstructured":"Tsuda, K. (2007). Entire regularization paths for graph data. In Proceedings of the 24th international conference on machine learning (pp. 919\u2013926).","DOI":"10.1145\/1273496.1273612"},{"key":"16_CR34_16","doi-asserted-by":"crossref","unstructured":"Tsuda, K., & Kudo, T. (2006). Clustering graphs by weighted substructure mining. In Proceedings of the 23rd international conference on machine learning (pp. 953\u2013960). New York: ACM.","DOI":"10.1145\/1143844.1143964"},{"key":"16_CR35_16","doi-asserted-by":"crossref","unstructured":"Tsuda, K., & Kurihara, K. (2008). Graph mining with variational dirichlet process mixture models. In SIAM Conference on Data Mining (SDM).","DOI":"10.1137\/1.9781611972788.39"},{"key":"16_CR36_16","doi-asserted-by":"crossref","unstructured":"Wale, N., & Karypis, G. (2006). Comparison of descriptor spaces for chemical compound retrieval and classification. In Proceedings of the 2006 IEEE international conference on data mining (pp. 678\u2013689).","DOI":"10.1109\/ICDM.2006.39"},{"key":"16_CR37_16","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 ACM SIGMOD international conference on management of data (pp. 433\u2013444).","DOI":"10.1145\/1376616.1376662"},{"key":"16_CR38_16","unstructured":"Yan, X., & Han, J. (2002). gSpan: Graph-based substructure pattern mining. In Proceedings of the 2002 IEEE international conference on data mining (pp. 721\u2013724). Los Alamitos, CA: IEEE Computer Society."},{"key":"16_CR39_16","unstructured":"Zaki, M., Parthasarathy, S., Ogihara, M., & Li, W. (1997). New algorithms for fast discovery of association rules. In KDD 1997 (pp. 283\u2013286)."}],"container-title":["Handbook of Statistical Bioinformatics"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-16345-6_16","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,1,25]],"date-time":"2019-01-25T20:03:47Z","timestamp":1548446627000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-16345-6_16"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011]]},"ISBN":["9783642163449","9783642163456"],"references-count":39,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-16345-6_16","relation":{},"subject":[],"published":{"date-parts":[[2011]]}}}