An Algorithm for General Set Unification and its Complexity.
Frieder StolzenburgPublished in: ICLP Workshop on Logic Programming with Sets (1993)
Keyphrases
- worst case
- polynomial time complexity
- dynamic programming
- computational complexity
- initial set
- expectation maximization
- improved algorithm
- probabilistic model
- np hard
- optimization algorithm
- decomposition algorithm
- detection algorithm
- computationally efficient
- theoretical analysis
- data sets
- solution space
- times faster
- input data
- significant improvement
- k means
- optimal solution
- conflict free
- lower and upper bounds
- nearest neighbour
- np complete
- convex hull
- matching algorithm
- high accuracy
- special case
- search space
- convergence rate
- space complexity
- computational cost
- preprocessing
- similarity measure
- neural network