A Hybrid Feature Selection Algorithm Based on Large Neighborhood Search

DOI10.1007/978-3-319-55453-2_3zbMath1453.68175OpenAlexW2593609150MaRDI QIDQ3304187

Gelareh Taghizadeh, Nysret Musliu

Publication date: 5 August 2020

Published in: Evolutionary Computation in Combinatorial Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-319-55453-2_3

zbMATH Keywords

classificationlarge neighborhood searchfeature selection

Mathematics Subject Classification ID

Learning and adaptive systems in artificial intelligence (68T05) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20)

Uses Software

• UCI-ml
• C4.5

Cites Work

• Unnamed Item
• Integer programming models for feature selection: new extensions and a randomized solution algorithm
• Feature subset selection in large dimensionality domains
• Using simulated annealing to optimize the feature selection problem in marketing applications
• Logic classification and feature selection for biomedical data
• On the approximability of minimizing nonzero variables or unsatisfied relations in linear systems
• maxSAT-based large neighborhood search for high school timetabling
• Hybrid feature selection algorithm using symmetrical uncertainty and a harmony search algorithm
• Tabu Search—Part I
• Tabu Search—Part II
• Rough set methods in feature selection and recognition
• 10.1162/153244303322753616
• An Effective Heuristic Algorithm for the Traveling-Salesman Problem