2008
DOI: 10.1007/978-3-540-85920-8_43
|View full text |Cite
|
Sign up to set email alerts
|

Feature Selection through Dynamic Mesh Optimization

Abstract: This paper introduces the Dynamic Mesh Optimization meta-heuristic, which falls under the evolutionary computation techniques. Moreover, we outline its application to the feature selection problem. A set of nodes representing subsets of features makes up a mesh which dynamically grows and moves across the search space. The novel methodology is compared with other existing meta-heuristic approaches, thus leading to encouraging empirical results.

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1

Citation Types

0
2
0

Year Published

2012
2012
2018
2018

Publication Types

Select...
4
1
1

Relationship

2
4

Authors

Journals

citations
Cited by 8 publications
(2 citation statements)
references
References 11 publications
0
2
0
Order By: Relevance
“…For solving this complex combinatorial task the framework FCM TOOL uses 8 discrete methods, which includes a BinaryCoded Genetic Algorithm [19], Ant Colony Optimizers [26] and variants of Variable Mesh Optimization [27].…”
Section: B Optimizing the Network Topologymentioning
confidence: 99%
“…For solving this complex combinatorial task the framework FCM TOOL uses 8 discrete methods, which includes a BinaryCoded Genetic Algorithm [19], Ant Colony Optimizers [26] and variants of Variable Mesh Optimization [27].…”
Section: B Optimizing the Network Topologymentioning
confidence: 99%
“…We want to elaborate now on a novel optimization technique called "Dynamic Mesh Optimization" (DMO) [5] which follows some patterns already present in earlier evolutionary approaches but provides a unique framework for managing both discrete and continuous optimization problems.…”
Section: Dynamic Mesh Optimization In Feature Selectionmentioning
confidence: 99%