Two novel feature selection algorithms based on crowding distance
In this paper, two novel algorithms for features selection are proposed. The first one is a filter method while the second is wrapper method. Both the proposed algorithms use the crowding distance used in the multiobjective optimization as a metric in order to sort the features. The less crowded features have great effects on the target attribute (class). The experimental results have shown the effectiveness and the robustness of the proposed algorithms.
Code (0)
등록된 구현이 없습니다.
Tasks
Attributefeature selectionMultiobjective OptimizationVocal Bursts Valence PredictionSimilar Papers 제목 키워드 기반
A Crowding Distance That Provably Solves the Difficulties of the NSGA-II in Many-Objective Optimization
Recent theoretical works have shown that the NSGA-II can have enormous difficulties to solve problems with more than two objectives. In contrast, algorithms like the NSGA-III or SMS-EMOA, differing from the NSGA-II only …
Approximation Guarantees for the Non-Dominated Sorting Genetic Algorithm II (NSGA-II)
Recent theoretical works have shown that the NSGA-II efficiently computes the full Pareto front when the population size is large enough. In this work, we study how well it approximates the Pareto front when the populati…
Mathematical ProofsA Grid-Based Evolutionary Algorithm for Many-Objective Optimization
Balancing convergence and diversity plays a key role in evolutionary multiobjective optimization (EMO). Most current EMO algorithms perform well on problems with two or three objectives, but encounter difficulties in the…
DiversityMultiobjective OptimizationImproved Crowding Distance for NSGA-II
Non-dominated sorting genetic algorithm II (NSGA-II) does well in dealing with multi-objective problems. When evaluating validity of an algorithm for multi-objective problems, two kinds of indices are often considered si…
CKmeans and FCKmeans : Two deterministic initialization procedures for Kmeans algorithm using a modified crowding distance
This paper presents two novel deterministic initialization procedures for K-means clustering based on a modified crowding distance. The procedures, named CKmeans and FCKmeans, use more crowded points as initial centroids…
Clustering