A Binary Linear Programming-Based K-Means Approach for the Capacitated Centered Clustering Problem.
Philipp BaumannPublished in: IEEM (2019)
Keyphrases
- k means
- linear programming
- clustering algorithm
- clustering method
- hierarchical clustering
- data clustering
- np hard
- cluster analysis
- spectral clustering
- self organizing maps
- linear program
- unsupervised clustering
- text clustering
- document clustering
- rough k means
- fuzzy c means
- clustering analysis
- clustering quality
- center based clustering
- clustering result
- feasible solution
- dynamic programming
- kohonen self organizing maps
- classical clustering algorithms
- expectation maximization
- clustering approaches
- binary data
- fuzzy k means
- objective function
- subspace clustering
- optimal solution
- partitional clustering
- high dimensional
- vehicle routing problem
- quadratic programming
- cluster centers
- routing problem