scholarly journals Late Acceptance Hill Climbing Based Social Ski Driver Algorithm for Feature Selection

IEEE Access ◽  
2020 ◽  
Vol 8 ◽  
pp. 75393-75408 ◽  
Author(s):  
Bitanu Chatterjee ◽  
Trinav Bhattacharyya ◽  
Kushal Kanti Ghosh ◽  
Pawan Kumar Singh ◽  
Zong Woo Geem ◽  
...  
F1000Research ◽  
2016 ◽  
Vol 5 ◽  
pp. 2673 ◽  
Author(s):  
Daniel Kristiyanto ◽  
Kevin E. Anderson ◽  
Ling-Hong Hung ◽  
Ka Yee Yeung

Prostate cancer is the most common cancer among men in developed countries. Androgen deprivation therapy (ADT) is the standard treatment for prostate cancer. However, approximately one third of all patients with metastatic disease treated with ADT develop resistance to ADT. This condition is called metastatic castrate-resistant prostate cancer (mCRPC). Patients who do not respond to hormone therapy are often treated with a chemotherapy drug called docetaxel. Sub-challenge 2 of the Prostate Cancer DREAM Challenge aims to improve the prediction of whether a patient with mCRPC would discontinue docetaxel treatment due to adverse effects. Specifically, a dataset containing three distinct clinical studies of patients with mCRPC treated with docetaxel was provided. We  applied the k-nearest neighbor method for missing data imputation, the hill climbing algorithm and random forest importance for feature selection, and the random forest algorithm for classification. We also empirically studied the performance of many classification algorithms, including support vector machines and neural networks. Additionally, we found using random forest importance for feature selection provided slightly better results than the more computationally expensive method of hill climbing.


2015 ◽  
Vol 19 (4) ◽  
pp. 453-465 ◽  
Author(s):  
George H. G. Fonseca ◽  
Haroldo G. Santos ◽  
Eduardo G. Carrano

2011 ◽  
pp. 70-107 ◽  
Author(s):  
Richard Jensen

Feature selection aims to determine a minimal feature subset from a problem domain while retaining a suitably high accuracy in representing the original features. Rough set theory (RST) has been used as such a tool with much success. RST enables the discovery of data dependencies and the reduction of the number of attributes contained in a dataset using the data alone, requiring no additional information. This chapter describes the fundamental ideas behind RST-based approaches and reviews related feature selection methods that build on these ideas. Extensions to the traditional rough set approach are discussed, including recent selection methods based on tolerance rough sets, variable precision rough sets and fuzzy-rough sets. Alternative search mechanisms are also highly important in rough set feature selection. The chapter includes the latest developments in this area, including RST strategies based on hill-climbing, genetic algorithms and ant colony optimization.


IEEE Access ◽  
2020 ◽  
Vol 8 ◽  
pp. 83548-83560 ◽  
Author(s):  
Kushal Kanti Ghosh ◽  
Shameem Ahmed ◽  
Pawan Kumar Singh ◽  
Zong Woo Geem ◽  
Ram Sarkar

Sign in / Sign up

Export Citation Format

Share Document