Feature scaling via second-order cone programming (Q1793515)

From MaRDI portal
!
WARNING

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 6953527
Language Label Description Also known as
default for all languages
No label defined
    English
    Feature scaling via second-order cone programming
    scientific article; zbMATH DE number 6953527

      Statements

      Feature scaling via second-order cone programming (English)
      0 references
      0 references
      12 October 2018
      0 references
      Summary: Feature scaling has attracted considerable attention during the past several decades because of its important role in feature selection. In this paper, a novel algorithm for learning scaling factors of features is proposed. It first assigns a nonnegative scaling factor to each feature of data and then adopts a generalized performance measure to learn the optimal scaling factors. It is of interest to note that the proposed model can be transformed into a convex optimization problem: second-order cone programming (SOCP). Thus the scaling factors of features in our method are globally optimal in some sense. Several experiments on simulated data, UCI data sets, and the gene data set are conducted to demonstrate that the proposed method is more effective than previous methods.
      0 references
      0 references
      0 references
      0 references

      Identifiers