256 search results - page 15 / 52 » A practical comparison of two K-Means clustering algorithms |
109
click to vote
KDD
2000
ACM
15 years 3 months ago
2000
ACM
Many important problems involve clustering large datasets. Although naive implementations of clustering are computationally expensive, there are established efficient techniques f...
81
Voted
ALT
2009
Springer
15 years 8 months ago
2009
Springer
Abstract. We present the first (to our knowledge) approximation algorithm for tensor clustering—a powerful generalization to basic 1D clustering. Tensors are increasingly common...
182
Voted
ADMI
2010
Springer
15 years 1 months ago
2010
Springer
A Multi-Agent based approach to clustering using a generic Multi-Agent Data Mining (MADM) framework is described. The process use a collection of agents, running several different ...
100
click to vote
IPPS
2003
IEEE
15 years 5 months ago
2003
IEEE
Aim of the paper is to develop a concise but comprehensive analytical model for the well-known Grace Hash Join algorithm on cost effective cluster architectures. This approach is ...
DATAMINE
2006
14 years 11 months ago
2006
Clustering with partial supervision finds its application in situations where data is neither entirely nor accurately labeled. This paper discusses a semisupervised clustering algo...