LGJan 11, 2015

Learning a Fuzzy Hyperplane Fat Margin Classifier with Minimum VC dimension

arXiv:1501.02432v12 citations
Originality Incremental advance
AI Analysis

This work addresses the problem of robust classification with low complexity for machine learning practitioners, but it is incremental as it builds on an existing method by adding fuzzy elements.

The paper tackles the problem of improving classifier generalization by extending the Minimal Complexity Machine (MCM) to incorporate fuzzy memberships, which reduces outlier and noise effects. The result shows that the fuzzy MCM outperforms SVMs and conventional MCM in generalization, achieving excellent test accuracies while using one-tenth the number of support vectors on benchmark datasets.

The Vapnik-Chervonenkis (VC) dimension measures the complexity of a learning machine, and a low VC dimension leads to good generalization. The recently proposed Minimal Complexity Machine (MCM) learns a hyperplane classifier by minimizing an exact bound on the VC dimension. This paper extends the MCM classifier to the fuzzy domain. The use of a fuzzy membership is known to reduce the effect of outliers, and to reduce the effect of noise on learning. Experimental results show, that on a number of benchmark datasets, the the fuzzy MCM classifier outperforms SVMs and the conventional MCM in terms of generalization, and that the fuzzy MCM uses fewer support vectors. On several benchmark datasets, the fuzzy MCM classifier yields excellent test set accuracies while using one-tenth the number of support vectors used by SVMs.

Foundations

The foundational work for this paper's niche, ranked by how specifically the neighbourhood builds on it — not by global fame.

Your Notes