An Efficient Algorithm To Compute Distance Between Lexicographic Preference Trees.
Minyi LiBorhan KazimipourPublished in: IJCAI (2018)
Keyphrases
- optimization algorithm
- np hard
- segmentation algorithm
- computationally efficient
- experimental evaluation
- cost function
- preprocessing
- tree structure
- optimal solution
- input data
- clustering method
- improved algorithm
- detection algorithm
- matching algorithm
- computational complexity
- probabilistic model
- similarity measure
- learning algorithm
- times faster
- distance matrix
- theoretical analysis
- expectation maximization
- dynamic programming
- significant improvement
- k means
- objective function
- image segmentation