Anytime propagation algorithm for min-based possibilistic graphs.
Nahla Ben AmorSalem BenferhatKhaled MellouliPublished in: Soft Comput. (2003)
Keyphrases
- k means
- worst case
- experimental evaluation
- dynamic programming
- optimal solution
- high accuracy
- learning algorithm
- recognition algorithm
- times faster
- optimization algorithm
- expectation maximization
- probabilistic model
- np hard
- cost function
- significant improvement
- preprocessing
- computational complexity
- graph isomorphism
- minimum spanning tree
- weighted graph
- computational cost
- graph structure
- segmentation algorithm
- search space
- similarity measure