Exact bagging with k-Nearest neighbour classifiers

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 3077, Issue , 2004, Pages 72-81

  Caprile, Bruno ^a   Merler, Stefano ^a   Furlanello, Cesare ^a   Jurman, Giuseppe ^a  

^a ITC IRST   (Italy)

Author keywords

[No Author keywords available]

Indexed keywords

NEAREST NEIGHBOR SEARCH;

BASE MODELS; BOOTSTRAP REPLICATES; EXACT COMPUTATIONS; EXACT FORMULAS; K NEAREST NEIGHBOURS (K-NN); K-NEAREST NEIGHBOURS; NEAREST NEIGHBOUR; SMOOTHING EFFECTS;

STATISTICAL METHODS;

EID: 35048884111     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-25966-4_7     Document Type: Article

References (10)

1. Breiman, L. (1996). Bagging Predictors. Machine Learning, 24, 123-140.
2. Duda, R. O., & Hart, P. E. (1973). Pattern Classification and Scene Analysis. John Wiley, New York.
3. th Int. Conf. Mach. Learn. (pp. 148-146). San Francisco, CA: Morgan Kaufmann.
4. Freund, Y., & Schapire, R. E. (1997). A Decision-theoretic Generalization of Online Learning and an Application to Boosting. J. Comput. Syst. Sci., 55:1, 119-139.
5. th Nat. Conf. on AI (pp. 725-730). Cambridge, MA: AAAI Press/MIT Press.
6. Dietterich, T. G. (2000). Ensemble methods in machine learning. In Multiple Classifier Systems, (pp. 1-15). Springer-Verlag.
7. Buhlmann, P., & Yu, B. (2002). Analyzing Bagging. Annals of Statistics, 30, 927-961.
8. Jiang, W. (2000). Process Consistency for AdaBoost. Technical report, Dept. of Statistics, Northwestern University.
9. Caprile, B., Merler, S., & Furlanello, C. (2001). Exact Bagging with k-Nearest Neighbour Classifiers. Technical report, IRST, 0106-03.
10. Efron, B., & Tibshirani, R. J. (1993). An Introduction to the Bootstrap. Chapman & Hall, New York.