Analysis of the asymptotic properties of the MOESP type of subspace algorithms.

Dietmar Bauer Magnus Jansson

Published in: Autom. (2000)

Keyphrases

learning algorithm
asymptotic properties
computational complexity
computational cost
worst case
dimensionality reduction
theoretical analysis
times faster
complexity analysis
data mining
bayesian networks
data streams
optimization problems
orders of magnitude
combinatorial optimization