No label defined (Q4535160)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 1754731
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | No label defined |
scientific article; zbMATH DE number 1754731 |
Statements
16 September 2002
0 references
feature subset selection
0 references
estimation of distribution algorithms
0 references
cross-validation
0 references
predictive accuracy
0 references
number of evaluations
0 references
genetic algorithms
0 references
0.8256978988647461
0 references
0.8226873278617859
0 references
0.7907739281654358
0 references
0.7758687734603882
0 references
Feature Subset Selection is a well known task in the Machine Learning, Data Mining, Pattern Recognition and Text Learning paradigms. In this chapter, we present a set of Estimation of Distribution Algorithms (EDAs) inspired techniques to tackle the Feature Subset Selection problem in Machine Learning and Data Mining tasks. Bayesian networks are used to factorize the probability distribution of best solutions in small and medium dimensionality datasets, and simpler probabilistic models are used in larger dimensionality domains. In a comparison with different sequential and genetic-inspired algorithms in natural and artificial datasets, EDA-based approaches have obtained encouraging accuracy results and need a smaller number of evaluations than genetic approaches. For the entire collection see [Zbl 0979.00024].
0 references