Local Learning vs. Global Learning: An Introduction to Maxi-Min Margin Machine

  • Huang K
  • Yang H
  • King I
  • et al.
N/ACitations
Citations of this article
29Readers
Mendeley users who have this article in their library.
Get full text

Abstract

We present a unifying theory of the Maxi-Min Margin Machine (M 4) that subsumes the Support Vector Machine (SVM), the Minimax Probability Machine (MPM), and the Linear Discriminant Analysis (LDA). As a unified approach, M 4 combines some merits from these three models. While LDA and MPM focus on building the decision plane using global information and SVM focuses on constructing the decision plane in a local manner, M 4 incorporates these two seemingly different yet complementary characteristics in an integrative framework that achieves good classification accuracy. We give some historical perspectives on the three models leading up to the development of M 4. We then outline the M 4 framework and perform investigations on various aspects including the mathematical definition, the geometrical interpretation, the time complexity, and its relationship with other existing models.

Cite

CITATION STYLE

APA

Huang, K., Yang, H., King, I., & Lyu, M. R. (2005). Local Learning vs. Global Learning: An Introduction to Maxi-Min Margin Machine (pp. 113–131). https://doi.org/10.1007/10984697_5

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free