From Linear Programming Approach to Metaheuristic Approach: Scaling Techniques

Elsayed Badr, Mustafa Abdul Salam, Sultan Almotairi, Hagar Ahmed and Roberto Natella

Complexity, 2021, vol. 2021, 1-10

Abstract: The objective of this work is to propose ten efficient scaling techniques for the Wisconsin Diagnosis Breast Cancer (WDBC) dataset using the support vector machine (SVM). 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 (C and gamma) for the SVM classifier.

Date: 2021
References: Add references at CitEc
Citations: View citations in EconPapers (1)

Downloads: (external link)
http://downloads.hindawi.com/journals/complexity/2021/9384318.pdf (application/pdf)
http://downloads.hindawi.com/journals/complexity/2021/9384318.xml (application/xml)

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:hin:complx:9384318

DOI: 10.1155/2021/9384318

Access Statistics for this article

More articles in Complexity from Hindawi
Bibliographic data for series maintained by Mohamed Abdelhakeem ().