Multi-class Classification with Fuzzy-feature Observations: Theory and Algorithms
Not on the map. Why?
Abstract (arXiv)
The theoretical analysis of multi-class classification has proved that the existing multi-class classification methods can train a classifier with high classification accuracy on the test set, when the instances are precise in the training and test sets with same distribution and enough instances can be collected in the training set. However, one limitation with multi-class classification has not been solved: how to improve the classification accuracy of multi-class classification problems when only imprecise observations are available. Hence, in this paper, we propose a novel framework to address a new realistic problem called multi-class classification with imprecise observations (MCIMO), where we need to train a classifier with fuzzy-feature observations. Firstly, we give the theoretical analysis of the MCIMO problem based on fuzzy Rademacher complexity. Then, two practical algorithms based on support vector machine and neural networks are constructed to solve the proposed new problem. Experiments on both synthetic and real-world datasets verify the rationality of our theoretical analysis and the efficacy of the proposed algorithms.
Key facts. Cited by 1 paper in the map (data through 14 Oct 2026). Builds on 13 of its 70 references that are in the map. First posted on arXiv 9 Jun 2022.
Builds on
13 of 70 references.
References · 13
- 2014Adam: A Method for Stochastic Optimizationcited by 37,240
- 2015Train faster, generalize better: Stability of stochastic gradient descentcited by 552
- 2020Learning Deep Kernels for Non-Parametric Two-Sample Testscited by 130
- 2014Optimal Learners for Multiclass Problemscited by 65
- 2019Open Set Domain Adaptation: Theoretical Bound and Algorithmcited by 48
- 2013A PAC-Bayesian Tutorial with A Dropout Boundcited by 43
- 2017Oversampling for Imbalanced Learning Based on K-Means and SMOTEcited by 38
- 2021Meta Two-Sample Testing: Learning Kernels for Testing with Limited Datacited by 18
- 2020How does the Combined Risk Affect the Performance of Unsupervised Domain Adaptation Approaches?cited by 17
- 2016Rademacher Complexity Bounds for a Penalized Multiclass Semi-Supervised Algorithmcited by 15
- 2018Unsupervised Identification of Disease Marker Candidates in Retinal OCT Imaging Datacited by 11
- 2020Clarinet: A One-step Approach Towards Budget-friendly Unsupervised Domain Adaptationcited by 8
1 more
- 2014Local Rademacher Complexity for Multi-label Learningcited by 5
Built on by
Citing papers per year: 2023: 1.
1 paper.