Sciweavers

1110 search results - page 39 / 222
» Clustering with the Connectivity Kernel
Sort
View
PRL
1998
91views more  PRL 1998»
13 years 9 months ago
Genetic operators for hierarchical graph clustering
In this paper we propose an encoding scheme and ad hoc operators for a genetic approach to hierarchical graph clustering. Given a connected graph whose vertices correspond to poin...
Stefano Rizzi
ICML
2007
IEEE
14 years 10 months ago
A dependence maximization view of clustering
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...
Le Song, Alexander J. Smola, Arthur Gretton, Karst...
WILF
2007
Springer
98views Fuzzy Logic» more  WILF 2007»
14 years 3 months ago
Possibilistic Clustering in Feature Space
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...
Maurizio Filippone, Francesco Masulli, Stefano Rov...
CVPR
2004
IEEE
14 years 11 months ago
Multiple Kernel Tracking with SSD
Kernel-based objective functions optimized using the mean shift algorithm have been demonstrated as an effective means of tracking in video sequences. The resulting algorithms com...
Gregory D. Hager, Maneesh Dewan, Charles V. Stewar...
NIPS
2008
13 years 11 months ago
Kernel Measures of Independence for non-iid Data
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...
Xinhua Zhang, Le Song, Arthur Gretton, Alex J. Smo...