Pages that link to "Item:Q2570148"

The following pages link to Solving feature subset selection problem by a parallel scatter search (Q2570148):

Displaying 13 items.

• Massively parallel feature selection: an approach based on variance preservation (Q374165) (← links)
• A comparison of several nearest neighbor classifier metrics using tabu search algorithm for the feature selection problem (Q941020) (← links)
• Optimization of nearest neighbor classifiers via metaheuristic algorithms for credit risk assessment (Q960116) (← links)
• A discrete particle swarm optimization method for feature selection in binary classification problems (Q976482) (← links)
• Analysis of new variable selection methods for discriminant analysis (Q1010495) (← links)
• A variable selection method based on Tabu search for logistic regression models (Q1042170) (← links)
• Consensus-based modeling using distributed feature construction with ILP (Q1640573) (← links)
• A distributed feature selection scheme with partial information sharing (Q2331680) (← links)
• Scatter search --- wellsprings and challenges (Q2570140) (← links)
• A PARALLEL METAHEURISTIC FRAMEWORK BASED ON HARMONY SEARCH FOR SCHEDULING IN DISTRIBUTED COMPUTING SYSTEMS (Q2909210) (← links)
• An Enhanced Support Vector Machines Model for Classification and Rule Generation (Q3020447) (← links)
• APPLICATION OF ANT COLONY OPTIMIZATION TO CREDIT RISK ASSESSMENT (Q3498276) (← links)
• Parallel metaheuristics: recent advances and new trends (Q4921253) (← links)