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...
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...
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...
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...
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...