A Family of Maximum Margin Criterion for Adaptive Learning

@inproceedings{Cheng2018AFO,
  title={A Family of Maximum Margin Criterion for Adaptive Learning},
  author={Miao Cheng and Zunren Liu and Hongwei Zou and Ah Chung Tsoi},
  booktitle={ICONIP},
  year={2018}
}
In recent years, pattern analysis plays an important role in data mining and recognition, and many variants have been proposed to handle complicated scenarios. In the literature, it has been quite familiar with high dimensionality of data samples, but either such characteristics or large data sets have become usual sense in real-world applications. In this work, an improved maximum margin criterion (MMC) method is introduced firstly. With the new definition of MMC, several variants of MMC… 

Adaptive Matching of Kernel Means

  • Miao ChengXinge You
  • Computer Science
    2020 25th International Conference on Pattern Recognition (ICPR)
  • 2021
A novel approach to adaptive matching of kernel means is proposed, and selected data with high importance are adopted to achieve calculation efficiency with optimization, and scalable learning can be conducted in proposed method as a generalized solution to matching of appended data.

IVP-LDL: Label Distribution Learning via Preservation of Information Volumes

  • Miao Cheng
  • Computer Science
    2020 12th International Conference on Advanced Computational Intelligence (ICACI)
  • 2020
A novel approach to label distribution learning is proposed, and unfolded generator is adopted to produce class-specific samples of each class, which is able to achieve fascinating performance compared with existing methods.

Function Approximation for Adaptive Learning of Label Distributions

A novel approach to LDL is proposed for adaptive learning of label distributions of instances, which adopts function approximation to label predication, and the predication of probabilistic labels of instances are able to be accomplished with self-taught optimization of approximate factorizations, and stable calculation efficiency can be achieved.

Leachable Component Clustering

A novel approach to clustering of incomplete data, termed leachable component clustering, is proposed, and rather than existing methods, the proposed method handles data imputation with Bayes alignment, and collects the lost patterns in theory.

Online Nonnegative Matrix Factorization with Temporal Affinity

A novel approach to online learning of NMF is proposed, which is able to learn factorizations with temporal affinity of sequential data, and attempts to learn the ideal decomposition while reserving the affinities between temporal data.

Top- Partial Label Machine

An efficient optimization algorithm is proposed based on accelerated proximal stochastic dual coordinate ascent (Prox-SDCA) and linear programming (LP) and a theoretical analysis of the generalization error for TPLM is presented.

References

SHOWING 1-10 OF 23 REFERENCES

An Analysis of Single-Layer Networks in Unsupervised Feature Learning

The results show that large numbers of hidden nodes and dense feature extraction are critical to achieving high performance—so critical, in fact, that when these parameters are pushed to their limits, they achieve state-of-the-art performance on both CIFAR-10 and NORB using only a single layer of features.

Nonparametric Feature Extraction via Direct Maximum Margin Alignment

A novel approach to direct maximum margin alignment (DMMA) for nonparametric feature reduction and extraction, which is able to obtain comparable performance with several state-of-the-art algorithms on pattern recognition.

Extreme Learning Machine for Regression and Multiclass Classification

ELM provides a unified learning platform with a widespread type of feature mappings and can be applied in regression and multiclass classification applications directly and in theory, ELM can approximate any target continuous function and classify any disjoint regions.

Incremental Embedding and Learning in the Local Discriminant Subspace With Application to Face Recognition

A supervised learning method, called local discriminant subspace embedding (LDSE), to extract discriminative features and the benchmark incremental learning experiments on face recognition show that ILDSE bears much less computational cost compared with the batch algorithm.

PCANet: A Simple Deep Learning Baseline for Image Classification?

Surprisingly, for all tasks, such a seemingly naive PCANet model is on par with the state-of-the-art features either prefixed, highly hand-crafted, or carefully learned [by deep neural networks (DNNs)].

Efficient and robust feature extraction by maximum margin criterion

This paper proposes some new feature extractors based on maximum margin criterion (MMC) and establishes a new linear feature extractor that does not suffer from the small sample size problem, which is known to cause serious stability problems for LDA.

A direct LDA algorithm for high-dimensional data - with application to face recognition

Gradient-based learning applied to document recognition

This paper reviews various methods applied to handwritten character recognition and compares them on a standard handwritten digit recognition task, and Convolutional neural networks are shown to outperform all other techniques.

Deep Representation Learning with Target Coding

It is found that distributed binary acode with error correcting capability is more capable of encouraging discriminative features, in comparison to the 1-of-K coding that is typically used in supervised deep learning.

Simple Method for High-Performance Digit Recognition Based on Sparse Coding

It is concluded that the learning of a sparse representation of local image patches combined with a local maximum operation for feature extraction can significantly improve recognition performance.