1039 search results - page 4 / 208 » Kernels and Regularization on Graphs |
144
click to vote
JMLR
2006
15 years 1 months ago
2006
We propose a family of learning algorithms based on a new form of regularization that allows us to exploit the geometry of the marginal distribution. We focus on a semi-supervised...
127
click to vote
NIPS
2008
15 years 2 months ago
2008
By attempting to simultaneously partition both the rows (examples) and columns (features) of a data matrix, Co-clustering algorithms often demonstrate surprisingly impressive perf...
101
click to vote
ICDM
2009
IEEE
14 years 11 months ago
2009
IEEE
The design of a good kernel is fundamental for knowledge discovery from graph-structured data. Existing graph kernels exploit only limited information about the graph structures bu...
126
click to vote
ICML
2007
IEEE
16 years 1 months ago
2007
IEEE
The paper presents a kernel for learning from ordered hypergraphs, a formalization that captures relational data as used in Inductive Logic Programming (ILP). The kernel generaliz...
142
click to vote
NIPS
2004
15 years 2 months ago
2004
The problem of learning a sparse conic combination of kernel functions or kernel matrices for classification or regression can be achieved via the regularization by a block 1-norm...