Boosting method for local learning in statistical pattern recognition

Neural Computation

Volumn 20, Issue 11, 2008, Pages 2792-2838

  Kawakita, Masanori ^a   Eguchi, Shinto ^b  

^a KYUSHU UNIVERSITY   (Japan)

^b GRADUATE UNIVERSITY FOR ADVANCED STUDIES   (Japan)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHM; ARTICLE; ARTIFICIAL INTELLIGENCE; AUTOMATED PATTERN RECOGNITION; BAYES THEOREM; BIOMETRY; COMPUTER SIMULATION; HUMAN; LEARNING; STATISTICAL MODEL;

ALGORITHMS; ARTIFICIAL INTELLIGENCE; BAYES THEOREM; BIOMETRY; COMPUTER SIMULATION; HUMANS; LEARNING; LIKELIHOOD FUNCTIONS; PATTERN RECOGNITION, AUTOMATED;

EID: 55749096877     PISSN: 08997667     EISSN: 1530888X     Source Type: Journal    
DOI: 10.1162/neco.2008.06-07-549     Document Type: Article

References (28)

1. Bartlett, P. L., Jordan, M. I., & McAuliffe, J. D. (2006). Convexity, classification, and risk bounds. Journal of American Statistical Association, 101, 138-156.
2. Bartlett, P. L., & Mendelson, S. (2002). Rademacher and gaussian complexities: Risk bounds and structural results. Journal of Machine Learning Research, 3, 463-482.
3. Devroye, L., Györfi, L., & Lugosi, G. (1996). A probabilistic theory of pattern recognition. New York: Springer-Verlag.
4. Devroye, L., & Lugosi, G. (2001). Combinatorial methods in density estimation. New York: Springer-Verlag.
5. Eguchi, S., & Copas, J. (1998). A class of local likelihood methods and near-parametric asymptotics. Journal of Royal Statistical Society B, 60, 709-724.
6. Eguchi, S., Kim, T.-Y., & Park, B. U. (2003). Local likelihood method and theory for a bridge between parametric and nonparametric regression. Journal of Nonparametric Statistics, 15, 665-683.
7. Fan, J., Farmen, M., & Gijbels, I. (1998). Local maximum likelihood estimation and inference. Journal of Royal Statistical Society B, 50, 591-608.
8. Fan, J., & Gijbels, I. (1995). Data-driven bandwidth selection in local polynomial fitting: Variable bandwidth and spatial adaption. Journal of Royal Statistical Society B, 57, 371-394.
9. Fan, J., & Gijbels, I. (1996). Local polynomial modelling and its applications. London: Chapman & Hall.
10. Freund, Y., & Schapire, R. E. (1997). A decision-theoretic generalization of on-line learning and an application to boosting. Journal of Computer and System Sciences, 55 (1), 119-139.
11. Friedman, J. H., Hastie, T., & Tibshirani, R. (2000). Additive logistic regression: A statistical view of boosting. Annals of Statistics, 28, 337-407.
12. Hastie, T. J., & Tibshirani, R. J. (1990). Generalized additive models. London: Chapman & Hall.
13. Hjort, N. L., & Jones, M. C. (1996). Locally parametric nonparametric density estimation. Annals of Statistics, 24 (4), 1619-1647.
14. Höffgen, K. U., Simon, H. U., & van Horn, K. S. (1995). Robust trainability of single neurons. Journal of Computer and System Sciences, 50, 114-125.
15. Kearns, M., & Valiant, L. G. (1988). Learning boolean formulae or finite automata is as hard as factoring (Tech. Rep. TR-14-88). Cambridge, MA: Harvard University, Aiken Computation Laboratory.
16. Koltchinskii, V., & Panchenko, D. (2002). Empirical margin distributions and bounding the generalization error of combined classifiers. Annals of Statistics, 30(1), 1-30.
17. Kotsiantis, S. B., Kanellopoulos, D., & Pintelas, P. E. (2006). Local boosting of decision stumps for regression and classification problems. Journal of Computers, 1(4), 30-37.
18. Lebanon, G., & Lafferty, J. (2002). Boosting andmaximum likelihood for exponential models. In T. G. Dietterich, S. Becker, & Z. Ghahramani (Eds.), Advances in neural information processing systems, 14. Cambridge, MA: MIT Press.
19. Ledoux, M., & Talagrand, M. (1991). Probability in Banach spaces: Isoperimetry and processes. New York: Springer-Verlag.
20. Lugosi, G., & Vayatis, N. (2004). On the Bayes-risk consistency of regularized boosting methods. Annals of Statistics, 32, 30-55.
21. Mason, L., Baxter, J., Bartlett, P. L., & Frean, M. (1999). Functional gradient techniques for combining hypotheses. In A. J. Smola, P. L. Bartlett, B. Schölkopf, & D. Schuurmans (Eds.), Advances in large margin classifiers (pp. 221-247). Cambridge, MA: MIT Press.
22. McDiarmid, C. (1989). On the method of bounded differences. In J. Siemons (Ed.), Surveys in combinatorics. Cambridge: Cambridge University Press.
23. Murata, N., Takenouchi, T., Kanamori, T., & Eguchi, S. (2004). Information geometry of U-boost and Bregman divergence. Neural Computation, 16, 1437-1481.
24. Newman, D. J., Hettich, S., Blake, C. L., & Merz, C. J. (1998). UCI repository of machine learning databases. Available online at http://www.ics.uci.edu/~mlearn/MLRepository.html.
25. Roweis, S., & Saul, L. (2000). Nonlinear dimensionality reduction by locally linear embedding. Science, 290(5500), 2323-2326.
26. Schapire, R. (1990). The strength of the weak learnability. Machine Learning, 5, 197-227.
27. van der Vaart, A. W., & Wellner, J. A. (1996). Weak convergence and empirical processes: With applications to statistics. New York: Springer-Verlag.
28. Vincent, P., & Bengio, Y. (2003). Locally weighted full covariance gaussian density estimation (Technical Rep. 1240). Montreal: University of Montreal.