Pairwise classification as an ensemble technique

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

Volumn 2430, Issue , 2002, Pages 97-110

  Fürnkranz, Johannes ^a  

^a AUSTRIAN RESEARCH INSTITUTE FOR ARTIFICIAL INTELLIGENCE   (Austria)

Author keywords

[No Author keywords available]

Indexed keywords

DECISION TREES; SEMANTICS;

CLASSIFICATION PERFORMANCE; DECISION TREE LEARNERS; ENSEMBLE TECHNIQUES; MULTI-CLASS CLASSIFICATION; MULTI-CLASS PROBLEMS; NUMBER OF CLASS; PAIRWISE CLASSIFICATION; PERFORMANCE GAIN;

MACHINE LEARNING;

EID: 84945261092     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-36755-1_9     Document Type: Conference Paper

References (29)

1. E. L. Allwein, R. E. Schapire, and Y. Singer. Reducing multiclass to binary: A unifying approach for margin classifiers. Journal of Machine Learning Research, 1: 113-141, 2000.
2. C. L. Blake and C. J. Merz. UCI repository of machine learning databases. http://www.ics.uci.edu/~mlearn/MLRepository.html, 1998. Department of Information and Computer Science, University of California at Irvine, Irvine CA.
3. L. Breiman. Bagging predictors. Machine Learning, 24(2): 123-140, 1996.
4. P. Clark and R. Boswell. Rule induction with CN2: Some recent improvements. In Proceedings of the 5th European Working Session on Learning (EWSL-91), pages 151-163, Porto, Portugal, 1991. Springer-Verlag.
5. W. W. Cohen. Fast effective rule induction. In A. Prieditis and S. Russell, editors, Proceedings of the 12th International Conference on Machine Learning (ML-95), pages 115-123, Lake Tahoe, CA, 1995. Morgan Kaufmann.
6. W. W. Cohen and Y. Singer. A simple, fast, and effective rule learner. In Proceedings of the 16th National Conference on Artificial Intelligence (AAAI-99), pages 335-342, Menlo Park, CA, 1999. AAAI/MIT Press.
7. T. G. Dietterich. An experimental comparison of three methods for constructing ensembles of decision trees: Bagging, boosting, and randomization. Machine Learning, 40(2): 139-158, 2000.
8. T. G. Dietterich and G. Bakiri. Solving multiclass learning problems via error-correcting output codes. Journal of Artificial Intelligence Research, 2: 263-286, 1995.
9. E. Frank and M. Hall. A simple approach to ordinal classification. In L. D. Raedt and P. Flach, editors, Proceedings of the 12th European Conference on Machine Learning (ECML-01), pages 145-156, Freiburg, Germany, 2001. Springer-Verlag.
10. Y. Freund and R. E. Schapire. A decision-theoretic generalization of on-line learning and an application to boosting. Journal of Computer and System Sciences, 55(1): 119-139, 1997.
11. J. Fürnkranz. Separate-and-conquer rule learning. Artificial Intelligence Review, 13(1): 3-54, February 1999.
12. J. Fürnkranz. Round robin rule learning. In C. E. Brodley and A. P. Danyluk, editors, Proceedings of the 18th Internaationaal Conference on Machine Learning (ICML-01), pages 146-153, Williamstown, MA, 2001. MorganKaufmann Publishers.
13. J. Fürnkranz. Round robin classification. Journal of Machine Learning Research 2: 721-747, 2002.
14. J. Fürnkranz. Hyperlink ensembles: A case study in hypertext classification. Information Fusion, to appear. Special Issue on Fusion of Multiple Classifiers.
15. T. Hastie and R. Tibshirani. Classification by pairwise coupling. In M. Jordan, M. Kearns, and S. Solla, editors, Advances in Neural Information Processing Systems 10 (NIPS-97), pages 507-513. MIT Press, 1998.
16. C.-W. Hsu and C.-J. Lin. A comparison of methods for multi-class support vector machines. IEEE Transactions on Neural Networks, 13(2): 415-425, March 2002.
17. S. Knerr, L. Personnaz, and G. Dreyfus. Handwritten digit recognition by neural networks with single-layer training. IEEE Transactions on Neural Networks, 3(6): 962-968, 1992.
18. A. Krieger, A. J. Wyner, and C. Long. Boosting noisy data. In C. E. Brodley and A. P. Danyluk, editors, Proceedings of the 18th Internaationaal Conference on Machine Learning (ICML-2001), pages 274-281, Williamstown, MA, 2001. Morgan Kaufmann Publishers.
19. E. Mayoraz and M. Moreira. On the decomposition of polychotomies into dichotomies. In Proceedings of the 14th International Conference on Machine Learning (ICML-97), pages 219-226, Nashville, TN, 1997. Morgan Kaufmann.
20. D.Opitz and R. Maclin. Popular ensemble methods: An empirical study. Journal of Artificial Intelligence Research, 11: 169-198, 1999.
21. B. Pfahringer. Winning the KDD99 classification cup: Bagged boosting. SIGKDD explorations, 1(2): 65-66, 2000.
22. J. C. Platt, N. Cristianini, and J. Shawe-Taylor. Large margin DAGs for multiclass classification. In S. A. Solla, T. K. Leen, and K.-R. Muüller, editors, Advances in Neural Information Processing Systems 12 (NIPS-99), pages 547-553. MIT Press, 2000.
23. D.Pyle. Data Preparation for Data Mining. Morgan Kaufmann, San Francisco, CA, 1999.
24. J. R. Quinlan. C4.5: Programs for Machine Learning. Morgan Kaufmann, San Mateo, CA, 1993.
25. J. R. Quinlan. Bagging, boosting, and C4.5. In Proceedings of the 13th National Conference on Artificial Intelligence (AAAI-96), pages 725-730. AAAI/MIT Press, 1996.
26. R. E. Schapire. Using output codes to boost multiclass learning problems. In
27. D. H. Fisher, editor, Proceedings fo the 14th International Conference on Machine Learning (ICML-97), pages 313-321, Nachville, TN, 1997. MorganKauf-mann.
28. R. E. Schapire and Y. Singer. Improved boosting algorithms using confidencerated predictions. Machine Learning, 37(3): 297-336, 1999.
29. I. H. Witten and E. Frank. Data Mining-Practical Machine Learning Tools and Techniques with Java Implementations. Morgan Kaufmann Publishers, 2000.