352 search results - page 26 / 71 » A local search approximation algorithm for k-means clusterin... |
55
Voted
PODS
2005
ACM
15 years 9 months ago
2005
ACM
We present a divide-and-merge methodology for clustering a set of objects that combines a top-down "divide" phase with a bottom-up "merge" phase. In contrast, ...
WAIM
2009
Springer
15 years 4 months ago
2009
Springer
Finding linear correlations in dataset is an important data mining task, which can be widely applied in the real world. Existing correlation clustering methods combine clustering w...
60
Voted
CONSTRAINTS
2007
14 years 9 months ago
2007
SAT is probably one of the most-studied constraint satisfaction problems. In this paper, a new hybrid technique based on local search is introduced in order to approximate and ext...
86
Voted
KDD
2004
ACM
15 years 3 months ago
2004
ACM
We present a graph-theoretic approach to discover storylines from search results. Storylines are windows that offer glimpses into interesting themes latent among the top search re...
87
Voted
MICAI
2005
Springer
15 years 3 months ago
2005
Springer
Abstract. Kernel based methods (such as k-nearest neighbors classifiers) for AI tasks translate the classification problem into a proximity search problem, in a space that is usu...