A two-stage algorithm for structure identification of polynomial NARX models.
William SpinelliLuigi PiroddiMarco LoveraPublished in: ACC (2006)
Keyphrases
- probabilistic model
- preprocessing
- high accuracy
- theoretical analysis
- tree structure
- optimal solution
- detection algorithm
- experimental evaluation
- np hard
- significant improvement
- computational cost
- bayesian framework
- cost function
- k means
- learning algorithm
- computationally efficient
- times faster
- optimization algorithm
- classification algorithm
- particle swarm optimization
- convergence rate
- worst case
- dynamic programming
- graph structure
- recognition algorithm
- lattice structure
- data sets
- polynomial size
- matching algorithm
- segmentation algorithm
- input data
- mobile robot
- search space
- genetic algorithm
- neural network