Skip to main content

Stacking with Multi-response Model Trees

  • Conference paper
  • First Online:
Multiple Classifier Systems (MCS 2002)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 2364))

Included in the following conference series:

Abstract

We empirically evaluate several state-of-the-art methods for constructing ensembles of classifiers with stacking and show that they perform (at best) comparably to selecting the best classifier from the ensemble by cross validation. We then propose a new method for stacking, that uses multi-response model trees at the meta-level, and show that it outperforms existing stacking approaches, as well as selecting the best classifier from the ensemble by cross validation.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. D. Aha, D.W. Kibler, and M. K. Albert. Instance-based learning algorithms. Machine Learning, 6:37–66, 1991.

    Google Scholar 

  2. C.L. Blake and C.J. Merz. UCI repository of machine learning databases, 1998.

    Google Scholar 

  3. T. G. Dietterich. Machine-learning research: Four current directions. AI Magazine, 18(4):97–136, 1997.

    Google Scholar 

  4. T. G. Dietterich. Ensemble methods in machine learning. In Proceedings of the First International Workshop on Multiple Classifier Systems, pages 1–15, Berlin, 2000. Springer.

    Google Scholar 

  5. E. Frank, Y. Wang, S. Inglis, G. Holmes, and I. H. Witten. Using model trees for classification. Machine Learning, 32(1):63–76, 1998.

    Article  MATH  Google Scholar 

  6. G. C. John and E. T. Leonard. K*: An instance-based learner using an entropic distance measure. In Proceedings of the 12th International Conference on Machine Learning, pages 108–114, San Francisco, 1995. Morgan Kaufmann.

    Google Scholar 

  7. G. H. John and P. Langley. Estimating continuous distributions in bayesian classifiers. In Proceedings of the Eleventh Conference on Uncertainty in Artificial Intelligence, pages 338–345, San Francisco, 1995. Morgan Kaufmann.

    Google Scholar 

  8. R. Kohavi. The power of decision tables. In Proceedings of the Eighth European Conference on Machine Learning, pages 174–189, 1995.

    Google Scholar 

  9. C. J. Merz. Using correspondence analysis to combine classifiers. Machine Learning, 36(1/2):33–58, 1999.

    Article  Google Scholar 

  10. J. R. Quinlan. Learning with continuous classes. In Proceedings of the Fifth Australian Joint Conference on Artificial Intelligence, pages 343–348, Singapore, 1992. World Scientific.

    Google Scholar 

  11. J. R. Quinlan. C4.5: Programs for Machine Learning. Morgan Kaufmann, San Francisco, 1993.

    Google Scholar 

  12. A. K. Seewald and J. Fürnkranz. An evaluation of grading classifiers. In Advances in Intelligent Data Analysis: Proceedings of the Fourth International Symposium (IDA-01), pages 221–232, Berlin, 2001. Springer.

    Google Scholar 

  13. K. M. Ting and I. H. Witten. Issues in stacked generalization. Journal of Artificial Intelligence Research, 10:271–289, 1999.

    MATH  Google Scholar 

  14. L. Todorovski and S. Džeroski. Combining multiple models with meta decision trees. In Proceedings of the Fourth European Conference on Principles of Data Mining and Knowledge Discovery, pages 54–64, Berlin, 2000. Springer.

    Google Scholar 

  15. L. Todorovski and S. Džeroski. Combining classifiers with meta decision trees. Machine Learning, In press, 2002.

    Google Scholar 

  16. Y. Wang and I. H. Witten. Induction of model trees for predicting continuous classes. In Proceedings of the Poster Papers of the European Conference on Machine Learning, Prague, 1997. University of Economics, Faculty of Informatics and Statistics.

    Google Scholar 

  17. I. H. Witten and E. Frank. Data Mining: Practical Machine Learning Tools and Techniques with Java Implementations. Morgan Kaufmann, San Francisco, 1999.

    Google Scholar 

  18. D. Wolpert. Stacked generalization. Neural Networks, 5(2):241–260, 1992.

    Article  Google Scholar 

  19. B. Ženko, L. Todorovski, and S. Džeroski. A comparison of stacking with mdts to bagging, boosting, and other stacking methods. In Proceedings of the First IEEE International Conference on Data Mining, pages 669–670, Los Alamitos, 2001. IEEE Computer Society.

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2002 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Džeroski, S., Ženko, B. (2002). Stacking with Multi-response Model Trees. In: Roli, F., Kittler, J. (eds) Multiple Classifier Systems. MCS 2002. Lecture Notes in Computer Science, vol 2364. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-45428-4_20

Download citation

  • DOI: https://doi.org/10.1007/3-540-45428-4_20

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-43818-2

  • Online ISBN: 978-3-540-45428-1

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics