Stopping criterion for boosting-based data reduction techniques: from binary to multiclass problems

Journal of Machine Learning Research

Volumn 3, Issue 4-5, 2003, Pages 863-885

  Sebban, Marc ^a   Nock, Richard ^b   Lallich, Stéphane ^c  

^a UNIVERSITÉ JEAN MONNET   (France)

^b UNIVERSITÉ DE GUYANE   (France)

^c UNIVERSITÉ LUMIÈRE LYON 2   (France)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTATIONAL COMPLEXITY; CONSTRAINT THEORY; DATA REDUCTION; LEARNING ALGORITHMS; PROBLEM SOLVING;

BINARY PROBLEMS; MULTICLASS PROBLEMS;

LEARNING SYSTEMS;

EID: 0141830857     PISSN: 15324435     EISSN: None     Source Type: Journal    
DOI: None     Document Type: Article

References (26)

1. Erin Allwein, Robert E. Schapire and Yoram Singer. Reducing multiclass to binary: a unifying approach for margin classifiers. Journal of Machine Learning Research, 1, 113-141, 2000.
2. Leo Breiman, Jerome H. Friedman, Richard A. Olshen and C.J. Stone. Classification And Regression Trees. Wadsworth, 1984.
3. Carla Brodley and Mark A. Friedl. Identifying and eliminating mislabeled learning instances. In Proceedings of the Thirteen National Conference on Artificial Intelligence, pages 799-805, AAAI Press, 1996.
4. Thomas M. Cover and Peter E. Hart. Nearest neighbor pattern classification. IEEE Transactions on Information Theory, 13, 21-27, 1967.
5. Thomas G. Dietterich and Ghulum Bakiri. Solving multiclass learning problems via error-correcting output codes. Journal of Artificial Intelligence Research, 2, 263-286, 1995.
6. Yoav Freund and Robert E. Schapire. Experiments with a new boosting algorithm. In Proceedings of the Thirteenth International Conference on Machine Learning, pages 148-156, Morgan Kaufmann, 1996.
7. Yoav Freund and Robert E. Schapire. A decision theoretic generalization of online learning and an application to boosting. International Journal of Computer and System Sciences, 55(1), 119-139, 1997.
8. Geoffrey W. Gates. The reduced nearest neighbor rule. IEEE Transactions on Information Theory, 18, 431-433, 1972.
9. Peter E. Hart. The condensed nearest neighbor rule. IEEE Transactions on Information Theory, 14, 515-516, 1968.
10. Trevor Hastie and Robert Tibshirani. Classification by pairwise coupling, The Annals of Statistics, 26(2), 451-471, 1998.
11. George H. John, Ron Kohavi and Karl Pfleger. Irrelevant features and the subset selection problem. In Proceedings of the Eleventh International Conference on Machine Learning, pages 121-129, Morgan Kaufmann, 1994.
12. Daphne Koller and Mehran Sahami. Toward optimal feature selection. In Proceedings of the Thirteenth International Conference on Machine Learning, pages 284-292, Morgan Kaufmann, 1996.
13. Christopher J. Merz and Philip M. Murphy. UCI repository of machine learning databases, HTTP://WWW.ICS.UCI.EDU/MLEARN/MLREPOSITORY.HTML, 1996.
14. Richard Nock and Marc Sebban. Advances in adaptive prototype weighting and selection. International Journal on Artificial Intelligence Tools, 10 (1-2), 137-156, 2001a.
15. Richard Nock and Marc Sebban. An improved bound on the Finite Sample Risk of the Nearest Neighbor Rule. Pattern Recognition Letters, 22, 413-419, 2001b.
16. Richard Nock and Marc Sebba. Sharper bounds for the hardness of prototype and feature selection. In Proceedings of the International Conference on Algorithmic Learning Theory, pages 224-237, Springer Verlag, 2000.
17. Robert E. Schapire and Yoram Singer. Improved boosting algorithms using confidence-rated predictions. In Proceedings of the Eleventh Annual Conference on Computational Learning Theory, pages 80-91, ACM Press, 1998.
18. Robert E. Schapire, Yoav Freund, Peter L. Bartlett and Wee Sun Lee. Boosting the margin: a new explanation for the effectiveness of voting methods. Annals of Statistics, 26, 1651-1686, 1998.
19. Marc Sebban. On feature selection: a new filter model. In Proceedings of the Twelfth International Florida Artificial Intelligence Research Society Conference, pages 230-234, AAAI Press, 1999.
20. Marc Sebban and Richard Nock. Instance pruning as an information preserving problem. In Proceedings of the Seventeenth International Conference on Machine Learning, pages 855-862, Morgan Kaufmann, 2000.
21. Marc Sebban, Richard Nock, and Stephane Lallich. Boosting Neighborhood-Based Classifiers. In Proceedings of the Eighteenth International Conference on Machine Learning, pages 505-512, Morgan Kaufmann, 2001.
22. David Skalak. Prototype and feature selection by sampling and random mutation hill climbing algorithms. In Proceedings of the Eleventh International Conference on Machine Learning, pages 293-301, Morgan Kaufmann, 1994.
23. Godfried Toussaint. The relative neighborhood graph of a finite planar set. Pattern Recognition, 12, 261-268, 1980.
24. Vladimir N. Vapnik. Estimation of dependences based on empirical data. Springer-Verlag, 1982.
25. Randall Wilson and Tony R. Martinez. Improved heterogeneous distance functions. Journal of Artificial Intelligence Research, 6, 1-34, 1997.
26. Randall Wilson and Tony R. Martinez. Reduction techniques for exemplar-based learning algorithms. Machine Learning, 38, 257-286, 2000.