5595 search results - page 398 / 1119 » Approximation Algorithms for Clustering Problems |
193
click to vote
RCIS
2010
15 years 5 months ago
2010
—The strategies for mining frequent itemsets, which is the essential part of discovering association rules, have been widely studied over the last decade. In real-world datasets,...
146
click to vote
CORR
2010
Springer
15 years 6 months ago
2010
Springer
We consider the problem of maximizing a nonnegative (possibly non-monotone) submodular set function with or without constraints. Feige et al. [9] showed a 2/5-approximation for th...
142
click to vote
ICIP
2005
IEEE
16 years 8 months ago
2005
IEEE
A variational Bayesian framework is employed in the paper for image segmentation using color clustering. A Gaussian mixture model is used to represent color distributions. Variati...
188
click to vote
EMMCVPR
2007
Springer
16 years 1 months ago
2007
Springer
Video segmentation requires the partitioning of a series of images into groups that are both spatially coherent and smooth along the time axis. We formulate segmentation as a Bayes...
194
click to vote
ICDM
2002
IEEE
15 years 11 months ago
2002
IEEE
It is well-known that for high dimensional data clustering, standard algorithms such as EM and the K-means are often trapped in local minimum. Many initialization methods were pro...