A Feasible Algorithm for Locating Concave and Convex Zones of Interval Data and Its Use in Statistics-Based Clustering.
Vladik KreinovichEric J. PauwelsScott FersonLev GinzburgPublished in: Numer. Algorithms (2004)
Keyphrases
- k means
- clustering method
- dynamic programming
- piecewise linear
- shortest path problem
- expectation maximization
- interval data
- data clustering
- objective function
- linear programming
- learning algorithm
- cost function
- optimal solution
- np hard
- similarity measure
- clustering algorithm
- search space
- scheduling problem
- simulated annealing
- data sets