1227 search results - page 16 / 246 » Approximate Kernel Clustering |
105
click to vote
GECCO
2007
Springer
15 years 3 months ago
2007
Springer
This paper introduces a method for clustering complex and linearly non-separable datasets, without any prior knowledge of the number of naturally occurring clusters. The proposed ...
102
click to vote
PAKDD
2009
ACM
15 years 6 months ago
2009
ACM
Spectral clustering refers to a flexible class of clustering procedures that can produce high-quality clusterings on small data sets but which has limited applicability to large-...
107
click to vote
PAMI
2007
14 years 9 months ago
2007
—A variety of clustering algorithms have recently been proposed to handle data that is not linearly separable; spectral clustering and kernel k-means are two of the main methods....
BTW
2005
Springer
15 years 3 months ago
2005
Springer
Abstract. Clustering has become an increasingly important task in modern application domains. In many areas, e.g. when clustering complex objects, in distributed clustering, or whe...
102
click to vote
ICML
2007
IEEE
15 years 10 months ago
2007
IEEE
The choice of the kernel function which determines the mapping between the input space and the feature space is of crucial importance to kernel methods. The past few years have se...