Sciweavers

1039 search results - page 14 / 208
» Kernels and Regularization on Graphs
Sort
View
FCT
2007
Springer
14 years 5 months ago
Path Algorithms on Regular Graphs
We consider standard algorithms of finite graph theory, like for instance shortest path algorithms. We present two general methods to polynomially extend these algorithms to infi...
Didier Caucal, Dinh Trong Hieu
ICML
2007
IEEE
14 years 11 months ago
Dimensionality reduction and generalization
In this paper we investigate the regularization property of Kernel Principal Component Analysis (KPCA), by studying its application as a preprocessing step to supervised learning ...
Sofia Mosci, Lorenzo Rosasco, Alessandro Verri
NIPS
2008
14 years 9 days ago
Posterior Consistency of the Silverman g-prior in Bayesian Model Choice
Kernel supervised learning methods can be unified by utilizing the tools from regularization theory. The duality between regularization and prior leads to interpreting regularizat...
Zhihua Zhang, Michael I. Jordan, Dit-Yan Yeung
GCB
2009
Springer
139views Biometrics» more  GCB 2009»
14 years 2 months ago
Graph-Kernels for the Comparative Analysis of Protein Active Sites
Abstract: Graphs are often used to describe and analyze the geometry and physicochemical composition of biomolecular structures, such as chemical compounds and protein active sites...
Thomas Fober, Marco Mernberger, Ralph Moritz, Eyke...
DM
2007
59views more  DM 2007»
13 years 11 months ago
Non-existence of nonorientable regular embeddings of n-dimensional cubes
By a regular embedding of a graph K into a surface we mean a 2-cell embedding of K into a compact connected surface with the automorphism group acting regularly on flags. Regular...
Young Soo Kwon, Roman Nedela