From Linear Programming Approach to Metaheuristic Approach: Scaling Techniques

Complexity 2021:1-10 (2021)
  Copy   BIBTEX

Abstract

The objective of this work is to propose ten efficient scaling techniques for the Wisconsin Diagnosis Breast Cancer dataset using the support vector machine. These scaling techniques are efficient for the linear programming approach. SVM with proposed scaling techniques was applied on the WDBC dataset. The scaling techniques are, namely, arithmetic mean, de Buchet for three cases p = 1,2, and ∞, equilibration, geometric mean, IBM MPSX, and Lp-norm for three cases p = 1,2, and ∞. The experimental results show that the equilibration scaling technique overcomes the benchmark normalization scaling technique used in many commercial solvers. Finally, the experimental results also show the effectiveness of the grid search technique which gets the optimal parameters for the SVM classifier.

Other Versions

No versions found

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 103,401

External links

Setup an account with your affiliations in order to access resources via your University's proxy server

Through your library

Similar books and articles

Discriminability and scaling of linear extent.C. Douglas Creelman - 1965 - Journal of Experimental Psychology 70 (2):192.
Cross Validation Component Based Reduction for Divorce Rate Prediction.M. Shyamala Devi - 2021 - Turkish Online Journal of Qualitative Inquiry (TOJQI) 12 (6):7716-7729.

Analytics

Added to PP
2021-02-12

Downloads
17 (#1,196,561)

6 months
6 (#572,300)

Historical graph of downloads
How can I increase my downloads?

Citations of this work

No citations found.

Add more citations

References found in this work

No references found.

Add more references