Advertisement

Induction of Voting Assemblies

  • Miroslav Kubat
Chapter

Abstract

A popular way of dealing with difficult problems is to organize a brainstorming session in which specialists from different fields share their knowledge, offering diverse points of view that complement each other to the point where they may inspire innovative solutions. Something similar can be done in machine learning, too. A group of classifiers is created in a way that makes each of them somewhat different. When they vote about the recommended class, their “collective wisdom” often compensates for each individual’s imperfections.

References

  1. 9.
    Breiman, L. (1996). Bagging predictors. Machine Learning, 24, 123–140.zbMATHGoogle Scholar
  2. 10.
    Breiman, L. (2001). Random forests. Machine Learning, 45, 5–32.CrossRefzbMATHGoogle Scholar
  3. 28.
    Freund, Y. & Schapire, R. E. (1996). Experiments with a new boosting algorithm. In Machine Learning: Proceedings of the Thirteenth International Conference, Bari (pp. 148–156).Google Scholar
  4. 85.
    Schapire, R. E. (1990). The strength of weak learnability. Machine Learning, 5, 197–227.Google Scholar
  5. 99.
    Wolpert, D. (1992). Stacked generalization. Neural Networks, 5, 241–259.CrossRefGoogle Scholar

Copyright information

© Springer International Publishing AG 2017

Authors and Affiliations

  • Miroslav Kubat
    • 1
  1. 1.Department of Electrical and Computer EngineeringUniversity of MiamiCoral GablesUSA

Personalised recommendations