179 search results - page 1 / 36 » Parallel k h-Means Clustering for Large Data Sets |
PAMI
1998
13 years 10 months ago
1998
—Algorithmic enhancements are described that enable large computational reduction in mean square-error data clustering. These improvements are incorporated into a parallel data-c...
ICDM
2007
IEEE
14 years 5 months ago
2007
IEEE
It is not surprising that there is strong interest in kNN queries to enable clustering, classification and outlierdetection tasks. However, previous approaches to privacypreservi...
ISVC
2009
Springer
14 years 5 months ago
2009
Springer
In this paper, we propose an inherent parallel scheme for 3D image segmentation of large volume data on a GPU cluster. This method originates from an extended Lattice Boltzmann Mod...
EUROPAR
1999
Springer
14 years 3 months ago
1999
Springer
This paper describes the realization of a parallel version of the k/h-means clustering algorithm. This is one of the basic algorithms used in a wide range of data mining tasks. We ...
JPDC
2007
13 years 10 months ago
2007
High-dimensional problems arising from robot motion planning, biology, data mining, and geographic information systems often require the computation of k nearest neighbor (knn) gr...