On the growth factor upper bound for Aasen's algorithm.
Yuehua FengLinzhang LuPublished in: Appl. Math. Lett. (2019)
Keyphrases
- upper bound
- learning algorithm
- times faster
- worst case
- k means
- computational complexity
- experimental study
- high accuracy
- detection algorithm
- experimental evaluation
- convergence rate
- objective function
- preprocessing
- expectation maximization
- theoretical analysis
- np hard
- matching algorithm
- recognition algorithm
- optimization algorithm
- improved algorithm
- search space
- computational cost
- cost function
- estimation algorithm
- single pass
- constant factor
- classification algorithm
- clustering method
- computationally efficient
- input data
- search algorithm
- similarity measure