1227 search results - page 1 / 246 » Approximate Kernel Clustering |
FOCS
2008
IEEE
13 years 11 months ago
2008
IEEE
ICPR
2008
IEEE
14 years 6 months ago
2008
IEEE
In kernel density estimation methods, an approximation of the data probability density function is achieved by locating a kernel function at each data location. The smoothness of ...
IJCNN
2006
IEEE
13 years 10 months ago
2006
IEEE
— Recent work has revealed a close connection between certain information theoretic divergence measures and properties of Mercer kernel feature spaces. Specifically, it has been...
LATIN
2010
Springer
13 years 11 months ago
2010
Springer
Abstract. We introduce the NP-hard graph-based data clustering problem s-Plex Cluster Vertex Deletion, where the task is to delete at most k vertices from a graph so that the conne...
NIPS
2003
13 years 6 months ago
2003
Clustering aims at extracting hidden structure in dataset. While the problem of finding compact clusters has been widely studied in the literature, extracting arbitrarily formed ...