An efficient algorithm for isometrically embedding weighted trees into low-dimensional ℓ∞-normed spaces.
Jonathan QueirozTiago JanuarioPublished in: Knowl. Based Syst. (2022)
Keyphrases
- detection algorithm
- preprocessing
- dynamic programming
- low dimensional spaces
- tree structure
- matching algorithm
- worst case
- learning algorithm
- np hard
- k means
- cost function
- low dimensional
- input data
- computational complexity
- vector space
- search space
- expectation maximization
- high dimensional
- input space
- semi supervised
- computationally efficient
- knn
- probabilistic model
- optimal solution