Sciweavers

Share
11 search results - page 2 / 3
» Nonparametric Transforms of Graph Kernels for Semi-Supervise...
Sort
View
ICML
2007
IEEE
11 years 3 months ago
Learning nonparametric kernel matrices from pairwise constraints
Many kernel learning methods have to assume parametric forms for the target kernel functions, which significantly limits the capability of kernels in fitting diverse patterns. Som...
Steven C. H. Hoi, Rong Jin, Michael R. Lyu
PKDD
2010
Springer
179views Data Mining» more  PKDD 2010»
10 years 29 days ago
Laplacian Spectrum Learning
Abstract. The eigenspectrum of a graph Laplacian encodes smoothness information over the graph. A natural approach to learning involves transforming the spectrum of a graph Laplaci...
Pannagadatta K. Shivaswamy, Tony Jebara
PKDD
2009
Springer
184views Data Mining» more  PKDD 2009»
10 years 9 months ago
Learning Preferences with Hidden Common Cause Relations
Abstract. Gaussian processes have successfully been used to learn preferences among entities as they provide nonparametric Bayesian approaches for model selection and probabilistic...
Kristian Kersting, Zhao Xu
ICPR
2006
IEEE
11 years 3 months ago
Graph-based transformation manifolds for invariant pattern recognition with kernel methods
We present here an approach for applying the technique of modeling data transformation manifolds for invariant learning with kernel methods. The approach is based on building a ke...
Alexei Pozdnoukhov, Samy Bengio
ICML
2009
IEEE
11 years 3 months ago
Learning spectral graph transformations for link prediction
We present a unified framework for learning link prediction and edge weight prediction functions in large networks, based on the transformation of a graph's algebraic spectru...
Andreas Lommatzsch, Jérôme Kunegis
books