352 search results - page 11 / 71 » A local search approximation algorithm for k-means clusterin... |
117
Voted
GECCO
2008
Springer
14 years 10 months ago
2008
Springer
We first present a method, called Two-Phase Pareto Local Search, to find a good approximation of the efficient set of the biobjective traveling salesman problem. In the first p...
AAAI
2000
14 years 11 months ago
2000
We present a Bayesian clustering algorithm for multivariate time series. A clustering is regarded as a probabilistic model in which the unknown auto-correlation structure of a tim...
ICDM
2009
IEEE
15 years 4 months ago
2009
IEEE
Given a data matrix, the problem of finding dense/uniform sub-blocks in the matrix is becoming important in several applications. The problem is inherently combinatorial since th...
102
click to vote
PAKDD
2000
ACM
15 years 1 months ago
2000
ACM
In clustering, global feature selection algorithms attempt to select a common feature subset that is relevant to all clusters. Consequently, they are not able to identify individu...
122
Voted
SISAP
2009
IEEE
15 years 4 months ago
2009
IEEE
Abstract—We propose a strategy to perform query processing on P2P similarity search systems based on peers and superpeers. We show that by approximating global but resumed inform...