{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,9]],"date-time":"2024-09-09T13:58:37Z","timestamp":1725890317211},"publisher-location":"Berlin, Heidelberg","reference-count":7,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642344749"},{"type":"electronic","value":"9783642344756"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2012]]},"DOI":"10.1007\/978-3-642-34475-6_45","type":"book-chapter","created":{"date-parts":[[2012,11,5]],"date-time":"2012-11-05T08:33:26Z","timestamp":1352104406000},"page":"375-382","source":"Crossref","is-referenced-by-count":3,"title":["Training Minimum Enclosing Balls for Cross Tasks Knowledge Transfer"],"prefix":"10.1007","author":[{"given":"Shaoning","family":"Pang","sequence":"first","affiliation":[]},{"given":"Fan","family":"Liu","sequence":"additional","affiliation":[]},{"given":"Youki","family":"Kadobayashi","sequence":"additional","affiliation":[]},{"given":"Tao","family":"Ban","sequence":"additional","affiliation":[]},{"given":"Daisuke","family":"Inoue","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"45_CR1","doi-asserted-by":"crossref","unstructured":"Kumar, P., Mitchell, J.S.B., Yildirim, E.A.: Approximate Minimum Enclosing Balls in High Dimensions Using Core-sets. Journal of Experimental Algorithmics, 8(1.1) (2003)","DOI":"10.1145\/996546.996548"},{"key":"45_CR2","doi-asserted-by":"crossref","unstructured":"Welzl, E.: Smallest Enclosing Disks (Balls and Ellipsoids). Results and New Trends in Computer Science pp. 359\u2013370 (1991)","DOI":"10.1007\/BFb0038202"},{"key":"45_CR3","doi-asserted-by":"crossref","first-page":"300","DOI":"10.1145\/336154.336216","volume-title":"Proceedings of the 16th Annual Symposium on Computational Geometry","author":"T.M. Chan","year":"2000","unstructured":"Chan, T.M.: Approximating the Diameter, Width, Smallest Enclosing Cylinder, and Minimum-width Annulus. In: Proceedings of the 16th Annual Symposium on Computational Geometry, Clear Water Bay, Kowloon, Hong Kong, pp. 300\u2013309. ACM, New York (2000)"},{"issue":"4","key":"45_CR4","doi-asserted-by":"publisher","first-page":"759","DOI":"10.1137\/0212052","volume":"12","author":"N. Megiddo","year":"1983","unstructured":"Megiddo, N.: Linear-time Algorithms for Linear Programming in r 3 and Related Problems. SIAM Journal on Computing\u00a012(4), 759\u2013776 (1983)","journal-title":"SIAM Journal on Computing"},{"key":"45_CR5","unstructured":"Badoiu, M.: Optimal Core Sets for Balls. In: DIMACS Workshop on Computational Geometry (2002)"},{"key":"45_CR6","doi-asserted-by":"crossref","DOI":"10.7551\/mitpress\/9780262033589.001.0001","volume-title":"Semi-supervised Learning","author":"O. Chapelle","year":"2006","unstructured":"Chapelle, O., Scholkopf, B., Zien, A.: Semi-supervised Learning. MIT Press, Cambridge (2006)"},{"key":"45_CR7","unstructured":"Frank, A., Asuncion, A.: UCI Machine Learning Repository, University of California, Irvine, School of Information and Computer Sciences (2010)"}],"container-title":["Lecture Notes in Computer Science","Neural Information Processing"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-34475-6_45.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,1,30]],"date-time":"2022-01-30T21:40:23Z","timestamp":1643578823000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-34475-6_45"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012]]},"ISBN":["9783642344749","9783642344756"],"references-count":7,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-34475-6_45","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2012]]}}}