8776 search results - page 460 / 1756 » Robust Data Clustering |
180
click to vote
FGR
2004
IEEE
15 years 10 months ago
2004
IEEE
We present a new unsupervised learning technique for the discovery of temporal clusters in large data sets. Our method performs hierarchical decomposition of the data to find stru...
198
click to vote
CLUSTER
2009
IEEE
16 years 1 months ago
2009
IEEE
—We present and analyze two new communication libraries, cudaMPI and glMPI, that provide an MPI-like message passing interface to communicate data stored on the graphics cards of...
204
click to vote
ICCBR
2007
Springer
16 years 28 days ago
2007
Springer
Abstract. Case retrieval from a clustered case memory consists in finding out the clusters most similar to the new input case, and then retrieving the cases from them. Although th...
205
click to vote
PAKDD
2007
ACM
16 years 27 days ago
2007
ACM
This work presents a kernel method for clustering the nodes of a weighted, undirected, graph. The algorithm is based on a two-step procedure. First, the sigmoid commute-time kernel...
177
click to vote
PAKDD
2004
ACM
16 years 4 days ago
2004
ACM
This paper proposes a two-step graph partitioning method to discover constrained clusters with an objective function that follows the well-known minmax clustering principle. Compar...