From Supervised Instance and Feature Selection Algorithms to Dual Selection: A Review

DOI10.1007/978-3-030-29349-9_4zbMath1436.62047OpenAlexW2982092489MaRDI QIDQ3297373

Serge Guillaume, Frédéric Ros

Publication date: 3 July 2020

Published in: Sampling Techniques for Supervised or Unsupervised Tasks (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-030-29349-9_4

zbMATH Keywords

classificationsupervised sampling

Mathematics Subject Classification ID

Classification and discrimination; cluster analysis (statistical aspects) (62H30) Sampling theory, sample surveys (62D05)

Uses Software

• XGBoost
• MOGWO

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Differential evolution. A practical approach to global optimization. With CD-ROM.
• The design of divide and conquer algorithms
• Wrappers for feature subset selection
• Reduction techniques for instance-based learning algorithms
• A formalism for relevance and its application in feature subset selection
• Advances in instance selection for instance-based learning algorithms
• Set characterization-selection towards classification based on interaction index
• The Grand Tour: A Tool for Viewing Multidimensional Data
• An algorithm for a selective nearest neighbor decision rule (Corresp.)
• Asymptotic Properties of Nearest Neighbor Rules Using Edited Data
• Artificial Intelligence and Soft Computing - ICAISC 2004
• Design of an optimal nearest neighbor classifier using an intelligent genetic algorithm
• 10.1162/153244303322753616
• Toward optimal feature selection using ranking methods and classification algorithms

This page was built for publication: From Supervised Instance and Feature Selection Algorithms to Dual Selection: A Review