A Binary Linear Programming-Based K-Means Algorithm For Clustering with Must-Link and Cannot-Link Constraints.
Philipp BaumannPublished in: IEEM (2020)
Keyphrases
- k means
- linear programming
- clustering method
- data clustering
- hierarchical clustering
- fuzzy k means
- expectation maximization
- clustering algorithm
- rough k means
- cluster analysis
- dynamic programming
- detection algorithm
- clustering framework
- clustering quality
- cluster centers
- spectral clustering
- optimal solution
- similarity measure
- hierarchical agglomerative clustering
- clustering result
- unsupervised clustering
- synthetic datasets
- np hard
- computational complexity
- self organizing maps
- preprocessing
- search space
- worst case
- hamming distance
- quadratic programming
- clustering analysis
- lower bound
- input data
- learning algorithm