22 search results - page 2 / 5 » Semi-supervised graph clustering: a kernel approach |
PAMI
2007
13 years 4 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....
PR
2008
13 years 5 months ago
2008
Clustering algorithms are a useful tool to explore data structures and have been employed in many disciplines. The focus of this paper is the partitioning clustering problem with ...
ICPR
2008
IEEE
13 years 11 months ago
2008
IEEE
Graph structures have been proved important in high level-vision since they can be used to represent structural and relational arrangements of objects in a scene. One of the probl...
ISBRA
2007
Springer
13 years 11 months ago
2007
Springer
The biological interpretation of large-scale gene expression data is one of the challenges in current bioinformatics. The state-of-theart approach is to perform clustering and then...
NIPS
2004
13 years 6 months ago
2004
We propose a family of kernels based on the Binet-Cauchy theorem and its extension to Fredholm operators. This includes as special cases all currently known kernels derived from t...