Please use this identifier to cite or link to this item:
http://hdl.handle.net/10603/580089
Title: | A Novel Binary Optimization Algorithms for Feature Selection Problem |
Researcher: | Rama Krishna, Eluri |
Guide(s): | Nagaraju, Devarakonda |
Keywords: | Feature Selection Golden Eagle Optimizer Transfer Function |
University: | Vellore Institute of Technology (VIT-AP) |
Completed Date: | 2023 |
Abstract: | Feature selection (FS) become more important for getting insights from large dimensional dataset. FS, a pre-processing step that select relevant and matched significant newlinefeatures from entire dataset. FS process is classified into 2 type namely; filter based and wrapper based methods. Classical optimization techniques repeatedly fail to construct global optimisation due to the large search area. Recently, several hybrid models incorporating various search policies have been offered; however, mostly these models are deal with low dimensional datasets. In this work, different types of feature selection method with different optimization algorithm is discussed. Initially, wrapper based newlinemethod that employs BGEO-TVFL method is proposed to minimise FS problems. This newlinemethod trace optimal FS based on GEO algorithm. TVFL maintains a stability between newlineboth exploitation and exploration of GEO. Performance of BGEO-TVFL is analysed newlineby comparing with several metrics under various UCI (UC Irvine) datasets. Proposed newlineBGEO-TVFL method obtained best result than compared methods and is right choice newlinefor dealing with dimensionality decrease difficulties. Next, HBFA-GA method is pro- newlineposed to overcome FS problem using a wrapper model. HBFS-GA executes on continuous search, but the FS is in discrete space. By utilizing transfer functions, continuous search has been transformed into a discrete one. To analyze the best transfer function newlineand investigate HBFS-GA, proposed model used eight distinct transfer functions. The newlineproposed HBFS-GA can fit compact dimensionality reduction problems and become a dominant feature subset selection tool. Finally, a CBPOA method was implemented to newlineselect the optimal feature selection. Chaos theory is included in this method to reduce newlinethe slow convergence rate and local optimal issues in traditional POA. In CBPOA, eight newlinetransfer functions are used to find the best one and inspect CBPOA. CEC-2017, 2018 newlineand 2020 benchmarks datasets are utilized to validate the performance and efficiency newlineof these three im |
Pagination: | xiii,174 |
URI: | http://hdl.handle.net/10603/580089 |
Appears in Departments: | Department of Computer Science and Engineering |
Files in This Item:
File | Description | Size | Format | |
---|---|---|---|---|
01_title.pdf | Attached File | 70.41 kB | Adobe PDF | View/Open |
02_prelim pages.pdf | 67.46 kB | Adobe PDF | View/Open | |
03_content.pdf | 48.55 kB | Adobe PDF | View/Open | |
04_abstract.pdf | 58.98 kB | Adobe PDF | View/Open | |
05_chapter-1.pdf | 3.06 MB | Adobe PDF | View/Open | |
06_chapter-2.pdf | 116.28 kB | Adobe PDF | View/Open | |
07_chapter-3.pdf | 4.88 MB | Adobe PDF | View/Open | |
08_chapter-4.pdf | 8.32 MB | Adobe PDF | View/Open | |
09_chapter-5.pdf | 5.54 MB | Adobe PDF | View/Open | |
80_recommendation.pdf | 42.57 kB | Adobe PDF | View/Open | |
annexures.pdf | 125.69 kB | Adobe PDF | View/Open |
Items in Shodhganga are licensed under Creative Commons Licence Attribution-NonCommercial-ShareAlike 4.0 International (CC BY-NC-SA 4.0).
Altmetric Badge: