On the robustness of the set-membership NLMS algorithm.
Hamed YazdanpanahMarkus V. S. LimaPaulo S. R. DinizPublished in: SAM (2016)
Keyphrases
- dynamic programming
- optimization algorithm
- computational complexity
- initial set
- matching algorithm
- preprocessing
- input data
- np hard
- high accuracy
- worst case
- learning algorithm
- detection algorithm
- expectation maximization
- computational cost
- neural network
- k means
- cost function
- experimental evaluation
- probabilistic model
- optimal solution
- convex hull
- recognition algorithm
- decomposition algorithm
- linear programming
- particle swarm optimization
- significant improvement
- segmentation algorithm
- objective function
- minimum distance
- adaptive algorithms