English  |  正體中文  |  简体中文  |  Items with full text/Total items : 28611/40649
Visitors : 638177      Online Users : 84
RC Version 4.0 © Powered By DSPACE, MIT. Enhanced by NTU Library IR team.
Scope Adv. Search
LoginUploadHelpAboutAdminister

Please use this identifier to cite or link to this item: http://ntour.ntou.edu.tw:8080/ir/handle/987654321/52384

Title: An Evolutionary Gravitational Search-based Feature Selection
Authors: Mohammad Taradeha
Majdi Mafarjab
Ali Asghar Heidaricd
Hossam Farise
Ibrahim Aljarahe
Seyedali Mirjalilif
Hamido Fujita
Contributors: 國立臺灣海洋大學:資訊工程學系
Keywords: Gravitational search algorithm
Genetic algorithm
Feature selection
Supervised learning
Classification
Optimization
Date: 2019-05
Issue Date: 2019-11-18T08:00:01Z
Publisher: Information Sciences
Abstract: Abstract: With recent advancements in data collection tools and the widespread use of intelligent information systems, a huge amount of data streams with lots of redundant, irrelevant, and noisy features are collected and a large number of features (attributes) should be processed. Therefore, there is a growing demand for developing efficient Feature Selection (FS) techniques. Gravitational Search algorithm (GSA) is a successful population-based metaheuristic inspired by Newton’s law of gravity. In this research, a novel GSA-based algorithm with evolutionary crossover and mutation operators is proposed to deal with feature selection (FS) tasks. As an NP-hard problem, FS finds an optimal subset of features from a given set. For the proposed wrapper FS method, both K-Nearest Neighbors (KNN) and Decision Tree (DT) classifiers are used as evaluators. Eighteen well-known UCI datasets are utilized to assess the performance of the proposed approaches. In order to verify the efficiency of proposed algorithms, the results are compared with some popular nature-inspired algorithms (i.e. Genetic Algorithm (GA), Particle Swarm Optimizer (PSO), and Grey Wolf Optimizer (GWO)). The extensive results and comparisons demonstrate the superiority of the proposed algorithm in solving FS problems.
Relation: 497 pp.219-239
URI: http://ntour.ntou.edu.tw:8080/ir/handle/987654321/52384
Appears in Collections:[資訊工程學系] 期刊論文

Files in This Item:

File Description SizeFormat
index.html0KbHTML20View/Open


All items in NTOUR are protected by copyright, with all rights reserved.

 


著作權政策宣告: 本網站之內容為國立臺灣海洋大學所收錄之機構典藏,無償提供學術研究與公眾教育等公益性使用,請合理使用本網站之內容,以尊重著作權人之權益。
網站維護: 海大圖資處 圖書系統組
DSpace Software Copyright © 2002-2004  MIT &  Hewlett-Packard  /   Enhanced by   NTU Library IR team Copyright ©   - Feedback