Sciweavers

338 search results - page 39 / 68
» Algorithms for Learning Kernels Based on Centered Alignment
Sort
View
ECCV
2010
Springer
13 years 10 months ago
Learning Shape Segmentation Using Constrained Spectral Clustering and Probabilistic Label Transfer
We propose a spectral learning approach to shape segmentation. The method is composed of a constrained spectral clustering algorithm that is used to supervise the segmentation of a...
SIGIR
2008
ACM
13 years 7 months ago
Learning to rank with partially-labeled data
Ranking algorithms, whose goal is to appropriately order a set of objects/documents, are an important component of information retrieval systems. Previous work on ranking algorith...
Kevin Duh, Katrin Kirchhoff
BMCBI
2007
154views more  BMCBI 2007»
13 years 7 months ago
Inferring biological networks with output kernel trees
Background: Elucidating biological networks between proteins appears nowadays as one of the most important challenges in systems biology. Computational approaches to this problem ...
Pierre Geurts, Nizar Touleimat, Marie Dutreix, Flo...
ICML
2008
IEEE
14 years 8 months ago
The skew spectrum of graphs
The central issue in representing graphstructured data instances in learning algorithms is designing features which are invariant to permuting the numbering of the vertices. We pr...
Risi Imre Kondor, Karsten M. Borgwardt
CVPR
2008
IEEE
14 years 9 months ago
Joint data alignment up to (lossy) transformations
Joint data alignment is often regarded as a data simplification process. This idea is powerful and general, but raises two delicate issues. First, one must make sure that the usef...
Andrea Vedaldi, Gregorio Guidi, Stefano Soatto