ICANN
2011
Springer
13 years 3 months ago
2011
Springer
The definition of appropriate kernel functions is crucial for the performance of a kernel method. In many of the state-of-the-art kernels for trees, matching substructures are con...
PR
2010
13 years 11 months ago
2010
Most existing representative works in semi-supervised clustering do not sufficiently solve the violation problem of pairwise constraints. On the other hand, traditional kernel met...
PR
2007
13 years 12 months ago
2007
The advantage of a kernel method often depends critically on a proper choice of the kernel function. A promising approach is to learn the kernel from data automatically. In this p...
IJON
2006
14 years 12 days ago
2006
In this paper, we first design a more generalized network model, Improved CBP, based on the same structure as Circular BackPropagation (CBP) proposed by Ridella et al. The novelty ...
PG
2000
IEEE
14 years 4 months ago
2000
IEEE
Inparticle-tracing radiosityalgorithms, energy-carrying particles are traced through an environmentfor simulating global illumination. Illumination on a surface is reconstructed f...
RECOMB
2004
Springer
14 years 5 months ago
2004
Springer
Transcription factor binding sites often contain several subtypes of sequences that follow not just one but several different patterns. We developed a novel sensitive method based ...
PAKDD
2007
ACM
14 years 6 months ago
2007
ACM
This work presents a kernel method for clustering the nodes of a weighted, undirected, graph. The algorithm is based on a two-step procedure. First, the sigmoid commute-time kernel...