deletion operator

deletion operator

[di′lē·shən ‚äp·ə‚rād·ər]
(computer science)
The part of a data structure which allows components to be deleted.
References in periodicals archive ?
Addition operator adds a randomly new feature to a given solution (subset of feature) and deletion operator deletes randomly one feature from a given solution.
The production rate of seeds is linearly computed based on their fitness in the range [[R.sub.min], [R.sub.max]] (vi) Addition: applying addition operator on each seed produced from the previous step with the probability of [P.sub.a] while the length of solutions must be less than or equal to L (vii) Deletion: applying deletion operator on each seed produced from the previous step with the probability of [P.sub.d] while the length of solutions must be greater than or equal to 1 (viii) Spatial Dispersal: the produced seeds are being randomly dispread over the search space and grow (ix) Competitive Exclusion: if the maximum number of plants is greater than [S.sub.max], now only [S.sub.min] plants with the highest fitness values can survive and produce seeds.
Also, new elements of the proposed framework are addition and deletion operators. Thus, we propose a generic structure for changing ordinary EAs and make them more suitable for feature selection.