An Approximation Algorithm for the Matrix Tree Multiplication Problem.
Mahmoud Abo KhamisRyan R. CurtinSungjin ImBenjamin MoseleyHung Q. NgoKirk PruhsAlireza SamadianPublished in: MFCS (2021)
Keyphrases
- tree structure
- theoretical analysis
- preprocessing
- learning algorithm
- k means
- dynamic programming
- error bounds
- segmentation algorithm
- search space
- cost function
- computational cost
- computational complexity
- closed form
- binary tree
- optimal solution
- graph structure
- recognition algorithm
- neural network
- arithmetic operations
- objective function
- worst case
- np hard
- polynomial time approximation
- induction algorithms
- mining high utility itemsets
- floating point
- convergence rate
- monte carlo
- detection algorithm
- linear programming
- probabilistic model