Binary Differential Evolution with Self-learning for Multi-objective Feature Selection

Main Author: ZHANG, YONG
Format: Dataset
Terbitan: Mendeley , 2018
Subjects:
Online Access: https:/data.mendeley.com/datasets/vsw9gdh2py
ctrlnum 0.17632-vsw9gdh2py.1
fullrecord <?xml version="1.0"?> <dc><creator>ZHANG, YONG</creator><title>Binary Differential Evolution with Self-learning for Multi-objective Feature Selection</title><publisher>Mendeley</publisher><description>This data "Binary Differential Evolution with Self-learning for Multi-objective Feature Selection" is a Matlab toolbox we developed for multi-objective feature selection based on an binary differential evolution with self-learning strategy, called MOFS-BDE. The details of this program can be found in the paper "Binary Differential Evolution with Self-learning for Multi-objective Feature Selection ", which has been submitted to the journal INFORMATION SCIENCES. 1. The idea of this algorithm Feature selection is an important preprocessing technique of data, which is generally modeled as a NP-hard multi-objective optimization problem. Focusing on Multi-Objective Feature Selection problems, this data shows our proposed multi-objective feature selection method, effective Binary Differential Evolution with self-learning strategy, called MOFS-BDE. First, a binary mutation based on probability difference is presented to locate potentially optimal areas fast by performing a large-scale search in the variable spaces. Second, a problem-specific self-learning strategy, named one-bit purifying search (OPS), is proposed to refine elite individuals obtained by the population in order to improve the exploitation performance of the algorithm. In addition, an efficient non-dominated sorting technology with the crowding distance is introduced to maintain the optimality and distribution of the population. 2. How to use this data or algorithm. (1) In this toolbox, the main function is named as &#x201C;MOFSBDE&#x201D;. In this function, you can select different data sets by changing the value of &#x201C;fly&#x201D;. (2) The file "data_t.m" saves all the test datasets; you can add new dataset you need; (3) the file "create.m" is used to update the population; (4) the file "non_domination_sort_mod1.m" is used to update the population by non-domination sorting method; (5) the file ""local_sech1.m" is our proposed the one-bit purifying search operator. (6) the final output is a matrix AC, which is a non-domination solution set. If you have any questions, please contact me in time. my email: YONGZH401@126.COM.</description><subject>Evolutionary Computation</subject><subject>Feature Selection</subject><subject>Multi-Objective Optimization</subject><type>Other:Dataset</type><identifier>10.17632/vsw9gdh2py.1</identifier><rights>Creative Commons Attribution 4.0 International</rights><rights>http://creativecommons.org/licenses/by/4.0</rights><relation>https:/data.mendeley.com/datasets/vsw9gdh2py</relation><date>2018-08-23T02:04:46Z</date><recordID>0.17632-vsw9gdh2py.1</recordID></dc>
format Other:Dataset
Other
author ZHANG, YONG
title Binary Differential Evolution with Self-learning for Multi-objective Feature Selection
publisher Mendeley
publishDate 2018
topic Evolutionary Computation
Feature Selection
Multi-Objective Optimization
url https:/data.mendeley.com/datasets/vsw9gdh2py
contents This data "Binary Differential Evolution with Self-learning for Multi-objective Feature Selection" is a Matlab toolbox we developed for multi-objective feature selection based on an binary differential evolution with self-learning strategy, called MOFS-BDE. The details of this program can be found in the paper "Binary Differential Evolution with Self-learning for Multi-objective Feature Selection ", which has been submitted to the journal INFORMATION SCIENCES. 1. The idea of this algorithm Feature selection is an important preprocessing technique of data, which is generally modeled as a NP-hard multi-objective optimization problem. Focusing on Multi-Objective Feature Selection problems, this data shows our proposed multi-objective feature selection method, effective Binary Differential Evolution with self-learning strategy, called MOFS-BDE. First, a binary mutation based on probability difference is presented to locate potentially optimal areas fast by performing a large-scale search in the variable spaces. Second, a problem-specific self-learning strategy, named one-bit purifying search (OPS), is proposed to refine elite individuals obtained by the population in order to improve the exploitation performance of the algorithm. In addition, an efficient non-dominated sorting technology with the crowding distance is introduced to maintain the optimality and distribution of the population. 2. How to use this data or algorithm. (1) In this toolbox, the main function is named as “MOFSBDE”. In this function, you can select different data sets by changing the value of “fly”. (2) The file "data_t.m" saves all the test datasets; you can add new dataset you need; (3) the file "create.m" is used to update the population; (4) the file "non_domination_sort_mod1.m" is used to update the population by non-domination sorting method; (5) the file ""local_sech1.m" is our proposed the one-bit purifying search operator. (6) the final output is a matrix AC, which is a non-domination solution set. If you have any questions, please contact me in time. my email: YONGZH401@126.COM.
id IOS7969.0.17632-vsw9gdh2py.1
institution Universitas Islam Indragiri
affiliation onesearch.perpusnas.go.id
institution_id 804
institution_type library:university
library
library Teknologi Pangan UNISI
library_id 2816
collection Artikel mulono
repository_id 7969
city INDRAGIRI HILIR
province RIAU
shared_to_ipusnas_str 1
repoId IOS7969
first_indexed 2020-04-08T08:18:35Z
last_indexed 2020-04-08T08:18:35Z
recordtype dc
_version_ 1686587539718144000
score 17.538404