{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,3]],"date-time":"2022-04-03T16:21:42Z","timestamp":1649002902850},"reference-count":12,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2006,11,1]],"date-time":"2006-11-01T00:00:00Z","timestamp":1162339200000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["New Gener. Comput."],"published-print":{"date-parts":[[2006,11]]},"DOI":"10.1007\/s00354-006-0006-0","type":"journal-article","created":{"date-parts":[[2008,3,7]],"date-time":"2008-03-07T14:32:58Z","timestamp":1204900378000},"page":"117-141","source":"Crossref","is-referenced-by-count":1,"title":["Part 6: Geometrical Structure of Boosting Algorithm"],"prefix":"10.1007","volume":"25","author":[{"given":"Takafumi","family":"Kanamori","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Takashi","family":"Takenouchi","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Noboru","family":"Murata","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2008,3,8]]},"reference":[{"key":"6_CR1","unstructured":"Bartlett, P.L., Jordan, M.I. and McAuliffe, J.D., \u201cConvexity, Classification and Risk Bounds,\" Technical Report 638, Statistics Department, University of California, Berkeley, Nov., 2003."},{"key":"6_CR2","doi-asserted-by":"crossref","first-page":"337","DOI":"10.1214\/aos\/1016218223","volume":"28","author":"J.H. Friedman","year":"2000","unstructured":"Friedman, J.H., Hastie, T. and Tibshirani, R., \u201cAdditive Logistic Regression: A Statistical View of Boosting,\u201d Annals of Statistics, 28, pp. 337\u2013407, 2000.","journal-title":"Annals of Statistics"},{"key":"6_CR3","unstructured":"Hampel, F.R., Rousseeuw, P.J., Ronchetti, E.M. and Stahel, W.A., Robust Statistics, John Wiley and Sons, Inc., 1986."},{"key":"6_CR4","doi-asserted-by":"crossref","unstructured":"Kanamori, T., Takenouchi, T. Eguchi, S. and Murata, N., \u201cThe Most Robust Loss Function for Boosting,\u201d in Neural Information Processing: 11th International Conference, ICONIP, LNCS, pp. 496\u2013501, 2004.","DOI":"10.1007\/978-3-540-30499-9_76"},{"key":"6_CR5","unstructured":"Kearns, M. and Valiant, L.G., \u201cLearning Boolean Formulae or Finte Automata is as Hard as Foctoring,\u201d Technical Report TR-14-88, Harvard University Aiken Computation Laboratry, Aug., 1988."},{"key":"6_CR6","doi-asserted-by":"crossref","unstructured":"Freund, Y. and Schapire, R.E., \u201cA Decision-theoretic Generalization of On-line Learning and an Application to Boosting,\u201d Journ. of Computer and System Sciences, 55, 1, pp. 119\u2013139, Aug., 1997.","DOI":"10.1006\/jcss.1997.1504"},{"key":"6_CR7","unstructured":"Lebanon, G. and Lafferty, J., \u201cBoosting and Maximum Likelihood for Exponential Models,\u201d Technical Report CMU-CS-01-144, School of Computer Science, Carnegie Mellon University, Pittsburgh, PA, Aug., 2001."},{"key":"6_CR8","first-page":"1859","volume":"14","author":"M. Minami","year":"2004","unstructured":"Minami, M. and Eguchi, S., \u201cRobust Blind Source Separation by Beta-divergence,\u201d Neural Computation, 14, pp. 1859\u20131886, 2004.","journal-title":"Neural Computation"},{"key":"6_CR9","doi-asserted-by":"crossref","first-page":"1437","DOI":"10.1162\/089976604323057452","volume":"16","author":"N. Murata","year":"2004","unstructured":"Murata, N., Takenouchi, T., Kanamori, T. and Eguchi, S., \u201cInformation Geometry of U-boost and Bregman Divergence,\u201d Neural Computation, 16, pp. 1437\u20131481, 2004.","journal-title":"Neural Computation"},{"key":"6_CR10","first-page":"197","volume":"5","author":"R.E. Schapire","year":"1990","unstructured":"Schapire, R.E., \u201cThe Strength of Weak Learnability,\u201d Machine Learning, 5, pp. 197\u2013227, 1990.","journal-title":"Machine Learning"},{"issue":"5","key":"6_CR11","doi-asserted-by":"crossref","first-page":"1651","DOI":"10.1214\/aos\/1024691352","volume":"26","author":"R.E. Schapire","year":"1998","unstructured":"Schapire, R.E., Freund, Y., Bartlett, P. and Lee, W.S., \u201cBoosting the Margin: A New Explanation for the Effectiveness of Voting Methods,\u201d The Annals of Statistics, 26, 5, pp. 1651\u20131686, 1998.","journal-title":"The Annals of Statistics"},{"key":"6_CR12","doi-asserted-by":"crossref","unstructured":"Takenouchi, T. and Eguchi, S., \u201cRobustifying AdaBoost by Adding the Naive Error Rate,\u201d Neural Computation, 16, 4, 2004.","DOI":"10.1162\/089976604322860695"}],"container-title":["New Generation Computing"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00354-006-0006-0.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00354-006-0006-0\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00354-006-0006-0","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,28]],"date-time":"2019-05-28T14:27:49Z","timestamp":1559053669000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00354-006-0006-0"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2006,11]]},"references-count":12,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2006,11]]}},"alternative-id":["6"],"URL":"https:\/\/doi.org\/10.1007\/s00354-006-0006-0","relation":{},"ISSN":["0288-3635","1882-7055"],"issn-type":[{"value":"0288-3635","type":"print"},{"value":"1882-7055","type":"electronic"}],"subject":[],"published":{"date-parts":[[2006,11]]}}}