5595 search results - page 271 / 1119 » Approximation Algorithms for Clustering Problems |
148
click to vote
KDD
2003
ACM
16 years 6 months ago
2003
ACM
Two-dimensional contingency or co-occurrence tables arise frequently in important applications such as text, web-log and market-basket data analysis. A basic problem in contingenc...
149
click to vote
ICASSP
2009
IEEE
16 years 1 months ago
2009
IEEE
In this paper we investigate the use of data driven clustering methods for functional connectivity analysis in fMRI. In particular, we consider the K-Means and Spectral Clustering...
172
click to vote
SDM
2007
SIAM
15 years 8 months ago
2007
SIAM
In this paper we formulate spectral clustering in directed graphs as an optimization problem, the objective being a weighted cut in the directed graph. This objective extends seve...
178
click to vote
PPSN
2004
Springer
15 years 12 months ago
2004
Springer
Abstract. The paper describes an evolutionary algorithm for the general nonlinear programming problem using a surrogate model. Surrogate models are used in optimization when model ...
174
click to vote
ICIP
2005
IEEE
16 years 8 months ago
2005
IEEE
In this paper the blind deconvolution problem is formulated using the variational framework. With its use approximations of the involved probability distributions are developed re...