1227 search results - page 50 / 246 » Approximate Kernel Clustering |
ICML
2007
IEEE
15 years 10 months ago
2007
IEEE
We propose a family of clustering algorithms based on the maximization of dependence between the input variables and their cluster labels, as expressed by the Hilbert-Schmidt Inde...
WILF
2007
Springer
15 years 3 months ago
2007
Springer
In this paper we propose the Possibilistic C-Means in Feature Space and the One-Cluster Possibilistic C-Means in Feature Space algorithms which are kernel methods for clustering in...
NIPS
2008
14 years 11 months ago
2008
In this paper we consider approximate policy-iteration-based reinforcement learning algorithms. In order to implement a flexible function approximation scheme we propose the use o...
NIPS
2008
14 years 11 months ago
2008
Many machine learning algorithms can be formulated in the framework of statistical independence such as the Hilbert Schmidt Independence Criterion. In this paper, we extend this c...
102
click to vote
PAMI
2012
13 years 7 days ago
2012
—We propose an efficient and robust solution for image set classification. A joint representation of an image set is proposed which includes the image samples of the set and thei...