Avoiding breakdown and near-breakdown in Lanczos type algorithms.
Claude BrezinskiMichela Redivo-ZagliaHassane SadokPublished in: Numer. Algorithms (1991)
Keyphrases
- orders of magnitude
- computationally efficient
- data structure
- learning algorithm
- times faster
- data sets
- search engine
- classification algorithm
- computational complexity
- computational cost
- machine learning algorithms
- lower bound
- graph theory
- low rank
- data mining algorithms
- case study
- feature selection
- machine learning
- neural network