6181 search results - page 186 / 1237 » Transactional Cluster Computing |
129
click to vote
SDM
2009
SIAM
16 years 12 days ago
2009
SIAM
Given the pairwise affinity relations associated with a set of data items, the goal of a clustering algorithm is to automatically partition the data into a small number of homogen...
112
click to vote
CORR
2010
Springer
14 years 10 months ago
2010
Springer
The diameter k-clustering problem is the problem of partitioning a finite subset of Rd into k subsets called clusters such that the maximum diameter of the clusters is minimized. ...
148
click to vote
CVPR
2011
IEEE
14 years 7 months ago
2011
IEEE
Given a unlabelled set of points X ∈ RN belonging to k groups, we propose a method to identify cluster assignments that provides maximum separating margin among the clusters. We...
247
Voted
ICDE
2009
IEEE
16 years 5 months ago
2009
IEEE
Modern database systems increasingly make use of networked storage. This storage can be in the form of SAN's or in the form of shared-nothing nodes in a cluster. One type of a...
151
Voted
SDM
2009
SIAM
16 years 12 days ago
2009
SIAM
Large amounts of remotely sensed data calls for data mining techniques to fully utilize their rich information content. In this paper, we study new means of discovery and summariz...