1227 search results - page 101 / 246 » Approximate Kernel Clustering |
AAIM
2009
Springer
15 years 4 months ago
2009
Springer
We introduce the s-Plex Editing problem generalizing the well-studied Cluster Editing problem, both being NP-hard and both being motivated by graph-based data clustering. Instead o...
CCGRID
2003
IEEE
15 years 3 months ago
2003
IEEE
This paper presents Cluster-Aware Remote Disks (CARDs), a Single System I/O architecture for cluster computing. CARDs virtualize accesses to remote cluster disks over a System Are...
NIPS
2000
14 years 11 months ago
2000
We present a novel method for clustering using the support vector machine approach. Data points are mapped to a high dimensional feature space, where support vectors are used to d...
107
click to vote
SCHOLARPEDIA
2008
14 years 8 months ago
2008
We present a novel method for clustering using the support vector machine approach. Data points are mapped to a high dimensional feature space, where support vectors are used to d...
116
click to vote
KDD
2003
ACM
15 years 10 months ago
2003
ACM
The goal of clustering is to identify distinct groups in a dataset. The basic idea of model-based clustering is to approximate the data density by a mixture model, typically a mix...