{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T18:06:29Z","timestamp":1725559589438},"publisher-location":"Berlin, Heidelberg","reference-count":18,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540269236"},{"type":"electronic","value":"9783540318910"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2005]]},"DOI":"10.1007\/11510888_10","type":"book-chapter","created":{"date-parts":[[2010,7,18]],"date-time":"2010-07-18T17:37:46Z","timestamp":1279474666000},"page":"90-99","source":"Crossref","is-referenced-by-count":1,"title":["The Convex Subclass Method: Combinatorial Classifier Based on a Family of Convex Sets"],"prefix":"10.1007","author":[{"given":"Ichigaku","family":"Takigawa","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Mineichi","family":"Kudo","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Atsuyoshi","family":"Nakamura","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"10_CR1","doi-asserted-by":"crossref","unstructured":"Bousquet, O., Boucheron, S., Lugosi, G.: Theory of classification: A survey of recent advances. ESAIM Probability and Statistics (2004) (to appear)","DOI":"10.1051\/ps:2005018"},{"key":"10_CR2","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4612-0711-5","volume-title":"A Probabilistic Theory of Pattern Recognition","author":"L. Devroye","year":"1996","unstructured":"Devroye, L., Gy\u00f6rfi, L., Lugosi, G.: A Probabilistic Theory of Pattern Recognition. Springer, Heidelberg (1996)"},{"key":"10_CR3","volume-title":"Pattern Classification","author":"R.O. Duda","year":"2001","unstructured":"Duda, R.O., Hart, P.E., Stork, D.G.: Pattern Classification, 2nd edn. John Wiley & Sons, Chichester (2001)","edition":"2"},{"key":"10_CR4","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4757-3264-1","volume-title":"The Nature of Statistical Learning Theory","author":"V.N. Vapnik","year":"2000","unstructured":"Vapnik, V.N.: The Nature of Statistical Learning Theory, 2nd edn. Springer, Heidelberg (2000)","edition":"2"},{"key":"10_CR5","doi-asserted-by":"publisher","first-page":"581","DOI":"10.1016\/0031-3203(95)00107-7","volume":"29","author":"M. Kudo","year":"1996","unstructured":"Kudo, M., Yanagi, S., Shimbo, M.: Construction of class regions by a randomized algorithm: A randomized subclass method. Pattern Recognition\u00a029, 581\u2013588 (1996)","journal-title":"Pattern Recognition"},{"key":"10_CR6","first-page":"311","volume":"14","author":"I. Takigawa","year":"2004","unstructured":"Takigawa, I., Abe, N., Shidara, Y., Kudo, M.: The boosted\/bagged subclass method. International Journal of Computing Anticipatory Systems\u00a014, 311\u2013320 (2004)","journal-title":"International Journal of Computing Anticipatory Systems"},{"key":"10_CR7","doi-asserted-by":"publisher","first-page":"281","DOI":"10.1016\/0012-365X(74)90140-X","volume":"8","author":"P. Erd\u0151s","year":"1974","unstructured":"Erd\u0151s, P., Kleitman, D.: Extremal problems among subsets of a set. Discrete Mathematics\u00a08, 281\u2013294 (1974)","journal-title":"Discrete Mathematics"},{"key":"10_CR8","doi-asserted-by":"publisher","first-page":"215","DOI":"10.1023\/B:AMAI.0000012867.03976.a5","volume":"40","author":"A.H. Cannon","year":"2004","unstructured":"Cannon, A.H., Cowen, L.J.: Approximation algorithms for the class cover problem. Annals of Mathematics and Artificial Intelligence\u00a040, 215\u2013223 (2004)","journal-title":"Annals of Mathematics and Artificial Intelligence"},{"key":"10_CR9","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1007\/s00357-003-0003-7","volume":"20","author":"C.E. Priebe","year":"2003","unstructured":"Priebe, C.E., Marchette, D.J., DeVinney, J.G., Socolinsky, D.A.: Classification using class cover catch digraphs. Journal of Classification\u00a020, 3\u201323 (2003)","journal-title":"Journal of Classification"},{"key":"10_CR10","doi-asserted-by":"publisher","DOI":"10.1002\/047172209X","volume-title":"Random Graphs for Statistical Pattern Recognition","author":"D.J. Marchette","year":"2004","unstructured":"Marchette, D.J.: Random Graphs for Statistical Pattern Recognition. John Wiley & Sons, Chichester (2004)"},{"key":"10_CR11","unstructured":"DeVinney, J.G.: The Class Cover Problem and Its Application in Pattern Recognition. Ph.D. Thesis, The Johns Hopkins University (2003)"},{"key":"10_CR12","volume-title":"Introduction to Algorithms","author":"T.H. Cormen","year":"2001","unstructured":"Cormen, T.H., Leiserson, C.E., Rivest, R.L., Stein, C.: Introduction to Algorithms, 2nd edn. MIT Press, Cambridge (2001)","edition":"2"},{"key":"10_CR13","doi-asserted-by":"publisher","first-page":"335","DOI":"10.1162\/153244302760200650","volume":"2","author":"A.H. Cannon","year":"2002","unstructured":"Cannon, A.H., Ettinger, J.M., Hush, D., Scovel, C.: Machine learning with data dependent hypothesis classes. Journal of Machine Learning Research\u00a02, 335\u2013358 (2002)","journal-title":"Journal of Machine Learning Research"},{"key":"10_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"359","DOI":"10.1007\/BFb0038202","volume-title":"New Results and New Trends in Computer Science","author":"E. Welzl","year":"1991","unstructured":"Welzl, E.: Smallest enclosing disks (balls and ellipsoids). In: Maurer, H.A. (ed.) New Results and New Trends in Computer Science. LNCS, vol.\u00a0555, pp. 359\u2013370. Springer, Heidelberg (1991)"},{"key":"10_CR15","series-title":"Lecture Notes in Computer Science","first-page":"325","volume-title":"Algorithms - ESA\u201999","author":"B. G\u00e4rtner","year":"1999","unstructured":"G\u00e4rtner, B., Sch\u00f6nher, S.: Fast and robust smallest enclosing balls. In: Ne\u0161et\u0159il, J. (ed.) ESA 1999. LNCS, vol.\u00a01643, pp. 325\u2013338. Springer, Heidelberg (1999)"},{"key":"10_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"630","DOI":"10.1007\/978-3-540-39658-1_57","volume-title":"Algorithms - ESA 2003","author":"K. Fischer","year":"2003","unstructured":"Fischer, K., G\u00e4rtner, B., Kutz, M.: Fast smallest-enclosing-ball computation in high dimensions. In: Di Battista, G., Zwick, U. (eds.) ESA 2003. LNCS, vol.\u00a02832, pp. 630\u2013641. Springer, Heidelberg (2003)"},{"key":"10_CR17","doi-asserted-by":"crossref","unstructured":"Zhou, G.L., Toh, K.C., Sun, J.: Efficient algorithms for the smallest enclosing ball problem. Computational Optimization and Applications (2004) (accepted)","DOI":"10.1090\/fic\/037\/12"},{"key":"10_CR18","unstructured":"Blake, C., Merz, C.: UCI repository of machine learning databases (1998)"}],"container-title":["Lecture Notes in Computer Science","Machine Learning and Data Mining in Pattern Recognition"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11510888_10.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,17]],"date-time":"2020-11-17T20:04:23Z","timestamp":1605643463000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11510888_10"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2005]]},"ISBN":["9783540269236","9783540318910"],"references-count":18,"URL":"https:\/\/doi.org\/10.1007\/11510888_10","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2005]]}}}