Fast algorithms for anti-distance matrices as a generalization of Boolean matrices.
Michiel de BondtPublished in: CoRR (2017)
Keyphrases
- matrix multiplication
- orders of magnitude
- eigendecomposition
- learning algorithm
- perturbation theory
- linear algebra
- optimization problems
- significant improvement
- times faster
- computational complexity
- data structure
- data mining
- distance measure
- computationally efficient
- machine learning algorithms
- distance function
- distance metric
- singular value decomposition
- singular values
- matrix completion