An iterative Jacobi-like algorithm to compute a few sparse eigenvalue-eigenvector pairs.
Cristian RusuPublished in: CoRR (2021)
Keyphrases
- worst case
- preprocessing
- segmentation algorithm
- cost function
- search space
- k means
- dynamic programming
- computational cost
- computational complexity
- detection algorithm
- input data
- learning algorithm
- np hard
- convergence rate
- data clustering
- optimal solution
- optimization algorithm
- significant improvement
- expectation maximization
- linear programming
- times faster
- evolutionary algorithm
- iterative optimization