Cluster editing problem for points on the real line: A polynomial time algorithm.
Bassel MannaaPublished in: Inf. Process. Lett. (2010)
Keyphrases
- computational complexity
- experimental evaluation
- dynamic programming
- worst case
- strongly polynomial
- significant improvement
- learning algorithm
- delaunay triangulation
- hierarchical clustering
- preprocessing
- cost function
- data points
- high accuracy
- simulated annealing
- segmentation algorithm
- optimization algorithm
- detection algorithm
- objective function
- neural network
- k means
- similarity measure
- geometric constraints
- convergence rate
- convex hull
- linear programming
- search algorithm
- computational cost
- association rules