Parallelizing feature selection

DOI10.1007/S00453-006-1220-3MaRDI QIDQ2502291zbMATH OpenOpenAlexWikidataFDO

Authors Jerffeson Teixeira de Souza, Stan Matwin, Nathalie Japkowicz

Publication date 12 September 2006

Published in Algorithmica (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/s00453-006-1220-3

Mathematics Subject Classification ID

Learning and adaptive systems in artificial intelligence (68T05) Pattern recognition, speech recognition (68T10) Parallel algorithms in computer science (68W10)

Recommendations

• Solving feature subset selection problem by a parallel scatter search
• scientific article; zbMATH DE number 2000345
• A greedy feature selection algorithm for big data of high dimensionality
• Genetic algorithm for feature selection for parallel classifiers
• scientific article; zbMATH DE number 2085221

Cited in

(6)

• A semi-parallel framework for greedy information-theoretic feature selection
• A distributed feature selection scheme with partial information sharing
• Solving feature subset selection problem by a parallel scatter search
• On resilient feature selection: computational foundations of \(r\)-\(\mathbb{C} \)-reducts
• Hadoop neural network for parallel and distributed feature selection
• Massively parallel feature selection: an approach based on variance preservation

This page was built for publication: Parallelizing feature selection

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2502291)