Subspace algorithm for identifying bilinear repetitive processes with deterministic inputs.
José A. RamosEric RogersPaulo J. Lopes dos SantosTeresa Paula Azevedo PerdicoúlisPublished in: ECC (2016)
Keyphrases
- expectation maximization
- learning algorithm
- computational complexity
- search space
- theoretical analysis
- improved algorithm
- times faster
- preprocessing
- matching algorithm
- np hard
- experimental evaluation
- objective function
- detection algorithm
- particle swarm optimization
- input data
- high accuracy
- worst case
- computational cost
- cost function
- maximum likelihood
- dynamic programming
- optimization algorithm
- significant improvement
- k means
- search algorithm
- optimal solution
- subspace clustering