We found a match
Your institution may have access to this item. Find your institution then sign in to continue.
- Title
Adaptive Neighborhood Adjustment Strategy Based On MOHHO and NSGA-III Algorithms for Feature Selection.
- Authors
Papasani, Anusha; Durgam, Revathi; Devarakonda, Nagaraju
- Abstract
The efficiency of multi-objective evolutionary algorithms (MOEAs) in tackling issues with multiple objectives is examined. However, it is noted that current MOEA-based feature selection techniques often converge towards the center of the Pareto front due to inadequate selection forces. The study proposes the utilization of a novel approach known as MOEA/D, which partitions complex multi-objective problems into smaller, more feasible single-objective sub-problems. Each sub-problem may then be addressed using an equal amount of computational resources. The predetermined size of the neighborhood used by MOEA/D may lead to a delay in the algorithm's merging and reduce the effectiveness of the failure. The paper proposes the Adaptive Neighbourhood Adjustment Strategy (ANAS) as a novel approach to improve the efficiency of multi-objective optimisation algorithms in order to tackle this issue. The ANAS algorithm allows for adaptive adjustment of the subproblem neighborhood size, hence enhancing the trade-off between merging and variety. In the following section of the study, a novel feature selection technique called MOGHHNS3/DANA is introduced. This technique utilizes ANAS to expand the potential solutions for a particular subproblem. The approach evaluates the chosen features using the Regulated Extreme Learning Machine (RELM) classifier on sixteen benchmark datasets. The experimental results demonstrate that MOGHHNS3/D-ANA outperforms four commonly employed multi-objective techniques in terms of accuracy, precision, recall, F1 score, coverage, hamming loss, ranking loss, and training time, error. The APBI approach in decomposition-based multiobjective optimization focuses on handling constraints by adjusting penalty parameters to guide the search towards feasible solutions. On the other hand, the ANA approach focuses on dynamically adjusting the neighborhood size or search direction based on the proximity of solutions in the detached space to adapt the search process. The proposed approach achieves convergence by minimizing redundancy, preserving diversity in the decision space, and simultaneously enhancing classification accuracy.
- Subjects
FEATURE selection; OPTIMIZATION algorithms; NEIGHBORHOODS; EVOLUTIONARY algorithms; MACHINE learning; PHYSIOLOGICAL adaptation
- Publication
IAENG International Journal of Applied Mathematics, 2024, Vol 54, Issue 5, p917
- ISSN
1992-9978
- Publication type
Article