Efficient algorithm for low-rank matrix factorization with missing components and performance comparison of latest algorithms.
Takayuki OkataniTakahiro YoshidaKoichiro DeguchiPublished in: ICCV (2011)
Keyphrases
- computationally efficient
- learning algorithm
- computational complexity
- times faster
- single pass
- significant improvement
- computationally intensive
- computational cost
- complexity analysis
- worst case
- highly efficient
- computationally demanding
- theoretical analysis
- expectation maximization
- space complexity
- convergence rate
- np hard
- k means
- objective function
- pruning strategy
- data sets
- simulated annealing
- closed form
- input data
- data mining