Multiple kernel dimensionality reduction via ratio-trace and marginal Fisher analysis (Q2298714)

From MaRDI portal

!

This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:

scientific article; zbMATH DE number 7171160
Language Label Description Also known as
default for all languages
No label defined
    English
    Multiple kernel dimensionality reduction via ratio-trace and marginal Fisher analysis
    scientific article; zbMATH DE number 7171160

      Statements

      Multiple kernel dimensionality reduction via ratio-trace and marginal Fisher analysis (English)
      0 references
      0 references
      0 references
      0 references
      0 references
      0 references
      0 references
      20 February 2020
      0 references
      Summary: Traditional supervised multiple kernel learning (MKL) for dimensionality reduction is generally an extension of kernel discriminant analysis (KDA), which has some restrictive assumptions. In addition, they generally are based on graph embedding framework. A more general multiple kernel-based dimensionality reduction algorithm, called multiple kernel marginal Fisher analysis (MKL-MFA), is presented for supervised nonlinear dimensionality reduction combined with ratio-race optimization problem. MKL-MFA aims at relaxing the restrictive assumption that the data of each class is of a Gaussian distribution and finding an appropriate convex combination of several base kernels. To improve the efficiency of multiple kernel dimensionality reduction, the spectral regression frameworks are incorporated into the optimization model. Furthermore, the optimal weights of predefined base kernels can be obtained by solving a different convex optimization. Experimental results on benchmark datasets demonstrate that MKL-MFA outperforms the state-of-the-art supervised multiple kernel dimensionality reduction methods.
      0 references

      Identifiers