A Fully Polynomial-Time Approximation Scheme for a Special Case of a Balanced 2-Clustering Problem.
Alexander Kel'manovAnna MotkovaPublished in: DOOR (2016)
Keyphrases
- special case
- clustering algorithm
- k means
- clustering method
- graph theoretic
- approximation algorithms
- categorical data
- cluster analysis
- hierarchical clustering
- unsupervised learning
- data clustering
- information theoretic
- self organizing maps
- np hard
- real time
- document clustering
- pairwise
- high dimensional data
- unsupervised clustering
- fuzzy clustering
- data points
- case study
- website