Anytime Algorithm for Feature Selection.
Mark LastAbraham KandelOded MaimonEugene EberbachPublished in: Rough Sets and Current Trends in Computing (2000)
Keyphrases
- feature selection
- times faster
- learning algorithm
- linear programming
- computational complexity
- detection algorithm
- segmentation algorithm
- theoretical analysis
- worst case
- objective function
- k means
- cost function
- dynamic programming
- computational cost
- simulated annealing
- neural network
- particle swarm optimization
- classification algorithm
- convergence rate
- improved algorithm
- classification accuracy
- significant improvement
- machine learning
- optimization algorithm
- conditional mutual information
- feature weighting
- data sets
- selection algorithm
- image sequences
- optimal solution
- feature space
- mutual information
- association rules
- computationally efficient
- experimental evaluation
- input data
- high accuracy