{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,1]],"date-time":"2022-04-01T02:24:59Z","timestamp":1648779899237},"reference-count":29,"publisher":"Institute of Electronics, Information and Communications Engineers (IEICE)","issue":"3","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEICE Trans. Inf. & Syst."],"published-print":{"date-parts":[[2016]]},"DOI":"10.1587\/transinf.2015edp7294","type":"journal-article","created":{"date-parts":[[2016,2,29]],"date-time":"2016-02-29T22:11:13Z","timestamp":1456783873000},"page":"714-723","source":"Crossref","is-referenced-by-count":0,"title":["Protein Fold Classification Using Large Margin Combination of Distance Metrics"],"prefix":"10.1587","volume":"E99.D","author":[{"given":"Chendra Hadi","family":"SURYANTO","sequence":"first","affiliation":[{"name":"Graduate School of Systems and Information Engineering, University of Tsukuba"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Kazuhiro","family":"FUKUI","sequence":"additional","affiliation":[{"name":"Graduate School of Systems and Information Engineering, University of Tsukuba"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Hideitsu","family":"HINO","sequence":"additional","affiliation":[{"name":"Graduate School of Systems and Information Engineering, University of Tsukuba"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"532","reference":[{"key":"1","doi-asserted-by":"crossref","unstructured":"[1] P. Koehl, \u201cProtein structure similarities,\u201d Current Opinion in Structural Biology, vol.11, no.3, pp.348-353, 2001.","DOI":"10.1016\/S0959-440X(00)00214-1"},{"key":"2","doi-asserted-by":"crossref","unstructured":"[2] I.N. Shindyalov and P.E. Bourne, \u201cProtein structure alignment by incremental combinatorial extension (CE) of the optimal path,\u201d Protein engineering, vol.11, no.9, pp.739-747, 1998.","DOI":"10.1093\/protein\/11.9.739"},{"key":"3","doi-asserted-by":"crossref","unstructured":"[3] L. Holm and C. Sander, \u201cProtein structure comparison by alignment of distance matrices,\u201d Journal of molecular biology, vol.233, no.1, pp.123-138, 1993.","DOI":"10.1006\/jmbi.1993.1489"},{"key":"4","doi-asserted-by":"crossref","unstructured":"[4] Y. Ye and A. Godzik, \u201cFlexible structure alignment by chaining aligned fragment pairs allowing twists,\u201d Bioinformatics, vol.19, no.Suppl 2, pp.ii246-ii255, 2003.","DOI":"10.1093\/bioinformatics\/btg1086"},{"key":"5","doi-asserted-by":"crossref","unstructured":"[5] Y. Zhang and J. Skolnick, \u201cTM-align: a protein structure alignment algorithm based on the TM-score,\u201d Nucleic acids research, vol.33, no.7, pp.2302-2309, 2005.","DOI":"10.1093\/nar\/gki524"},{"key":"6","doi-asserted-by":"crossref","unstructured":"[6] A. Prlic, S. Bliven, P.W. Rose, W.F. Bluhm, C. Bizon, A. Godzik, and P.E. Bourne, \u201cPrecalculated protein structure alignments at the RCSB PDB website,\u201d Bioinformatics, vol.26, no.23, pp.2983-2985, 2010.","DOI":"10.1093\/bioinformatics\/btq572"},{"key":"7","unstructured":"[7] C.H. Suryanto, S. Jiang, and K. Fukui, \u201cProtein structure similarity based on multi-view images generated from 3D molecular visualization,\u201d Proc. of the 21st International Conference on Pattern Recognition, pp.3447-3451, 2012."},{"key":"8","unstructured":"[8] N. Shental, T. Hertz, D. Weinshall, and M. Pavel, \u201cAdjustment learning and relevant component analysis,\u201d in Computer Vision-ECCV 2002, ed. A. Heyden, G. Sparr, M. Nielsen, and P. Johansen, Lecture Notes in Computer Science, vol.2353, pp.776-790, Springer Berlin Heidelberg, 2002."},{"key":"9","unstructured":"[9] J. Goldberger, S. Roweis, G. Hinton, and R. Salakhutdinov, \u201cNeighbourhood components analysis,\u201d Advances in Neural Information Processing Systems, pp.513-520, 2005."},{"key":"10","unstructured":"[10] K.Q. Weinberger and L.K. Saul, \u201cDistance metric learning for large margin nearest neighbor classification,\u201d Journal of Machine Learning Research, vol.10, pp.207-244, 2009."},{"key":"11","doi-asserted-by":"crossref","unstructured":"[11] C. Xiong, D. Johnson, R. Xu, and J.J. Corso, \u201cRandom forests for metric learning with implicit pairwise position dependence,\u201d Proc. of the 18th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, pp.958-966, 2012.","DOI":"10.1145\/2339530.2339680"},{"key":"12","doi-asserted-by":"crossref","unstructured":"[12] F. Wang, J. Sun, and S. Ebadollahi, \u201cComposite distance metric integration by leveraging multiple experts' inputs and its application in patient similarity assessment,\u201d Statistical Analysis and Data Mining, vol.5, no.1, pp.54-69, 2012.","DOI":"10.1002\/sam.11135"},{"key":"13","unstructured":"[13] Z. Cui, W. Li, D. Xu, S. Shan, and X. Chen, \u201cFusing robust face region descriptors via multiple metric learning for face recognition in the wild,\u201d Proc. of the Computer Vision and Pattern Recognition, pp.3554-3561, 2013."},{"key":"14","unstructured":"[14] X. Zhai, Y. Peng, and J. Xiao, \u201cHeterogeneous metric learning with joint graph regularization for cross-media retrieval,\u201d Proc. of the 27th AAAI Conference on Artificial Intelligence Heterogeneous, pp.1198-1204, 2013."},{"key":"15","doi-asserted-by":"crossref","unstructured":"[15] K.M. Borgwardt, C.S. Ong, S. Sch\u00f6nauer, S.V.N. Vishwanathan, A.J. Smola, and H.P. Kriegel, \u201cProtein function prediction via graph kernels,\u201d Bioinformatics, vol.21, pp.47-56, 2005.","DOI":"10.1093\/bioinformatics\/bti1007"},{"key":"16","doi-asserted-by":"crossref","unstructured":"[16] C.H.Q. Ding and I. Dubchak, \u201cMulti-class protein fold recognition using support vector machines and neural networks,\u201d Bioinformatics, vol.17, no.4, pp.349-358, 2001.","DOI":"10.1093\/bioinformatics\/17.4.349"},{"key":"17","doi-asserted-by":"crossref","unstructured":"[17] T. Damoulas and M.A. Girolami, \u201cProbabilistic multi-class multi-kernel learning: on protein fold recognition and remote homology detection,\u201d Bioinformatics, vol.24, no.10, pp.1264-1270, 2008.","DOI":"10.1093\/bioinformatics\/btn112"},{"key":"18","unstructured":"[18] G.R.G. Lanckriet, N. Cristianini, P. Bartlett, L.E. Ghaoui, and M.I. Jordan, \u201cLearning the kernel matrix with semidefinite programming,\u201d Journal of Machine Learning Research, vol.5, pp.27-72, 2004."},{"key":"19","unstructured":"[19] M. Varma and B.R. Babu, \u201cMore generality in efficient multiple kernel learning,\u201d Proc. of the 26th Annual International Conference on Machine Learning, ICML '09, New York, NY, USA, pp.1065-1072, ACM, 2009."},{"key":"20","doi-asserted-by":"crossref","unstructured":"[20] H. Hino, N. Reyhani, and N. Murata, \u201cMultiple kernel learning with gaussianity measures,\u201d Neural Computation, vol.24, no.7, pp.1853-1881, 2012.","DOI":"10.1162\/NECO_a_00299"},{"key":"21","doi-asserted-by":"crossref","unstructured":"[21] C.H. Suryanto, H. Hino, and K. Fukui, \u201cCombination of multiple distance measures for protein fold classification,\u201d Proc. of the 2nd Asian Conference on Pattern Recognition, pp.440-445, 2013.","DOI":"10.1109\/ACPR.2013.139"},{"key":"22","doi-asserted-by":"crossref","unstructured":"[22] B. Kulis, \u201cMetric learning: A survey,\u201d Foundations and Trends in Machine Learning, vol.5, no.4, pp.287-364, 2013.","DOI":"10.1561\/2200000019"},{"key":"23","unstructured":"[23] J.D.M. Rennie and N. Srebro, \u201cLoss functions for preference levels: Regression with discrete ordered labels,\u201d Proc. of the IJCAI Multidisciplinary Workshop on Advances in Preference Handling, pp.180-186, 2005."},{"key":"24","doi-asserted-by":"crossref","unstructured":"[24] J.M.M. Chandonia, G. Hon, N.S. Walker, L. Lo Conte, P. Koehl, M. Levitt, and S.E. Brenner, \u201cThe ASTRAL Compendium in 2004,\u201d Nucleic Acids Research, vol.32, pp.D189-D192, 2004.","DOI":"10.1093\/nar\/gkh034"},{"key":"25","unstructured":"[25] N. Shervashidze and K. Borgwardt, \u201cFast subtree kernels on graphs,\u201d Proc. of the Neural Information Processing Systems, pp.1660-1668, Neural Information Processing Systems Foundation, 2009."},{"key":"26","doi-asserted-by":"crossref","unstructured":"[26] M. Neumann, N. Patricia, R. Garnett, and K. Kersting, \u201cEfficient graph kernels by randomization,\u201d Proc. of the 2012 European Conference on Machine Learning and Knowledge Discovery in Databases-Volume Part I, pp.378-393, 2012.","DOI":"10.1007\/978-3-642-33460-3_30"},{"key":"27","unstructured":"[27] A. Feragen, N. Kasenburg, J. Petersen, M. de Bruijne, and K.M. Borgwardt, \u201cScalable kernels for graphs with continuous attributes,\u201d Proc. of the Neural Information Processing Systems, pp.216-224, 2013."},{"key":"28","doi-asserted-by":"crossref","unstructured":"[28] C.T. Kelley, \u201cLine search methods and the Armijo rule,\u201d in Iterative Methods for Optimization, pp.40-52, SIAM, 1999.","DOI":"10.1137\/1.9781611970920"},{"key":"29","unstructured":"[29] J. Wang, A. Woznica, and A. Kalousis, \u201cParametric local metric learning for nearest neighbor classification,\u201d Advances in Neural Information Processing Systems, pp.1610-1618, 2012."}],"container-title":["IEICE Transactions on Information and Systems"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.jstage.jst.go.jp\/article\/transinf\/E99.D\/3\/E99.D_2015EDP7294\/_pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,9,5]],"date-time":"2019-09-05T03:55:03Z","timestamp":1567655703000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.jstage.jst.go.jp\/article\/transinf\/E99.D\/3\/E99.D_2015EDP7294\/_article"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016]]},"references-count":29,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2016]]}},"URL":"https:\/\/doi.org\/10.1587\/transinf.2015edp7294","relation":{},"ISSN":["0916-8532","1745-1361"],"issn-type":[{"value":"0916-8532","type":"print"},{"value":"1745-1361","type":"electronic"}],"subject":[],"published":{"date-parts":[[2016]]}}}