C
search
search
reviewers
reviewers
feeds
feeds
assignments
assignments
settings
logout
Hardness and Non-Approximability of Bregman Clustering Problems.
Marcel R. Ackermann
Johannes Blömer
Christoph Scholz
Published in:
Electron. Colloquium Comput. Complex. (2011)
Keyphrases
</>
np complete
clustering algorithm
cluster analysis
information theoretic
clustering method
decision trees
hierarchical clustering
optimization problems
outlier detection
data mining tasks
machine learning
data clustering
self organizing maps
mutual information
multi class
np hard
k means
feature selection