{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T20:37:12Z","timestamp":1725568632331},"publisher-location":"Berlin, Heidelberg","reference-count":18,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642161834"},{"type":"electronic","value":"9783642161841"}],"license":[{"start":{"date-parts":[[2010,1,1]],"date-time":"2010-01-01T00:00:00Z","timestamp":1262304000000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2010]]},"DOI":"10.1007\/978-3-642-16184-1_24","type":"book-chapter","created":{"date-parts":[[2010,11,2]],"date-time":"2010-11-02T09:40:58Z","timestamp":1288690858000},"page":"341-355","source":"Crossref","is-referenced-by-count":1,"title":["Adapted Transfer of Distance Measures for Quantitative Structure-Activity Relationships"],"prefix":"10.1007","author":[{"given":"Ulrich","family":"R\u00fcckert","sequence":"first","affiliation":[]},{"given":"Tobias","family":"Girschick","sequence":"additional","affiliation":[]},{"given":"Fabian","family":"Buchwald","sequence":"additional","affiliation":[]},{"given":"Stefan","family":"Kramer","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"24_CR1","first-page":"158","volume-title":"Proc. of KDD 2004","author":"T. Horv\u00e1th","year":"2004","unstructured":"Horv\u00e1th, T., G\u00e4rtner, T., Wrobel, S.: Cyclic pattern kernels for predictive graph mining. In: Proc. of KDD 2004, pp. 158\u2013167. ACM Press, New York (2004)"},{"key":"24_CR2","unstructured":"Shervashidze, N., Vishwanathan, S., Petri, T., Mehlhorn, K., Borgwardt, K.: Efficient Graphlet Kernels for Large Graph Comparison. In: Proc. of AISTATS 2009 (2009)"},{"key":"24_CR3","doi-asserted-by":"crossref","unstructured":"Goldberger, J., Roweis, S., Hinton, G., Salakhutdinov, R.: Neighborhood Component Analysis. In: Proc. of NIPS 2004, pp. 513\u2013520 (2005)","DOI":"10.1007\/978-3-476-04447-1_15"},{"key":"24_CR4","first-page":"317","volume-title":"Proc. of ECML PKDD 2008","author":"E. Eaton","year":"2008","unstructured":"Eaton, E., Desjardins, M., Lane, T.: Modeling transfer relationships between learning tasks for improved inductive transfer. In: Proc. of ECML PKDD 2008, pp. 317\u2013332. Springer, Heidelberg (2008)"},{"key":"24_CR5","unstructured":"Raymond, J.W., Willett, P.: Effectiveness of graph-based and fingerprint-based similarity measures for virtual screening of 2D chemical structure databases. JCAMD, 59\u201371 (January 2002)"},{"issue":"6","key":"24_CR6","first-page":"1906","volume":"43","author":"J.J. Sutherland","year":"2003","unstructured":"Sutherland, J.J., O\u2019Brien, L.A., Weaver, D.F.: Spline-fitting with a genetic algorithm: A method for developing classification structure-activity relationships. J. Chem. Inf. Model\u00a043(6), 1906\u20131915 (2003)","journal-title":"J. Chem. Inf. Model"},{"issue":"22","key":"24_CR7","doi-asserted-by":"publisher","first-page":"5541","DOI":"10.1021\/jm0497141","volume":"47","author":"J.J. Sutherland","year":"2004","unstructured":"Sutherland, J.J., O\u2019Brien, L.A., Weaver, D.F.: A comparison of methods for modeling quantitative structure-activity relationships. J. Med. Chem.\u00a047(22), 5541\u20135554 (2004)","journal-title":"J. Med. Chem."},{"key":"24_CR8","unstructured":"Benigni, R., Bossa, C., Vari, M.R.: Chemical carcinogens: Structures and experimental data, http:\/\/www.iss.it\/binary\/ampp\/cont\/ISSCANv2aEn.1134647480.pdf"},{"key":"24_CR9","first-page":"564","volume-title":"Proc. of SAC 2004","author":"U. R\u00fcckert","year":"2004","unstructured":"R\u00fcckert, U., Kramer, S.: Frequent free tree discovery in graph data. In: SAC 2004, pp. 564\u2013570. ACM Press, New York (2004)"},{"key":"24_CR10","first-page":"1031","volume-title":"Proc. of ICML 2007","author":"A. Woznica","year":"2007","unstructured":"Woznica, A., Kalousis, A., Hilario, M.: Learning to combine distances for complex representations. In: Proc. of ICML 2007, pp. 1031\u20131038. ACM Press, New York (2007)"},{"key":"24_CR11","first-page":"65","volume-title":"Proc. of ICML 2007","author":"A.B. Hillel","year":"2007","unstructured":"Hillel, A.B., Weinshall, D.: Learning distance function by coding similarity. In: Proc. of ICML 2007, pp. 65\u201372. ACM Press, New York (2007)"},{"key":"24_CR12","unstructured":"Weinberger, K.Q., Tesauro, G.: Metric learning for kernel regression. In: Proc. of AISTATS 2007 (2007)"},{"key":"24_CR13","first-page":"311","volume-title":"Proc. COLT 1995","author":"J. Baxter","year":"1995","unstructured":"Baxter, J.: Learning Internal Representations. In: Proc. COLT 1995, pp. 311\u2013320. ACM Press, New York (1995)"},{"key":"24_CR14","first-page":"615","volume":"6","author":"T. Evgeniou","year":"2005","unstructured":"Evgeniou, T., Micchelli, C.A., Pontil, M.: Learning multiple tasks with kernel methods. J. Mach. Learn. Res.\u00a06, 615\u2013637 (2005)","journal-title":"J. Mach. Learn. Res."},{"key":"24_CR15","first-page":"1531","volume":"7","author":"S. Sonnenburg","year":"2006","unstructured":"Sonnenburg, S., R\u00e4tsch, G., Sch\u00e4fer, C., Sch\u00f6lkopf, B.: Large scale multiple kernel learning. J. Mach. Lear. Res.\u00a07, 1531\u20131565 (2006)","journal-title":"J. Mach. Lear. Res."},{"key":"24_CR16","doi-asserted-by":"publisher","DOI":"10.1142\/6523","volume-title":"Bridging the Gap Between Graph Edit Distance and Kernel Machines","author":"M. Neuhaus","year":"2007","unstructured":"Neuhaus, M., Bunke, H.: Bridging the Gap Between Graph Edit Distance and Kernel Machines. World Scientific Publishing Co., Inc, Singapore (2007)"},{"key":"24_CR17","unstructured":"Zha, Z.J., Mei, T., Wang, M., Wang, Z., Hua, X.S.: Robust distance metric learning with auxiliary knowledge. In: Proc. of IJCAI 2009, pp. 1327\u20131332 (2009)"},{"key":"24_CR18","unstructured":"Erhan, D., Bengio, Y., L\u2019Heureux, P.J., Yue, S.Y.: Generalizing to a zero-data task: a computational chemistry case study. Technical Report 1286, D\u00e9partement d\u2019informatique et recherche op\u00e9rationnelle, University of Montreal (2006)"}],"container-title":["Lecture Notes in Computer Science","Discovery Science"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-16184-1_24","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,6,5]],"date-time":"2019-06-05T21:05:02Z","timestamp":1559768702000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-16184-1_24"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010]]},"ISBN":["9783642161834","9783642161841"],"references-count":18,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-16184-1_24","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2010]]}}}