Sciweavers

Share
ICANN
2011
Springer
8 years 1 months ago
Extending Tree Kernels with Topological Information
The deļ¬nition 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...
Fabio Aiolli, Giovanni Da San Martino, Alessandro ...
PR
2010
156views more  PR 2010»
8 years 8 months ago
Semi-supervised clustering with metric learning: An adaptive kernel method
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...
Xuesong Yin, Songcan Chen, Enliang Hu, Daoqiang Zh...
PR
2007
139views more  PR 2007»
8 years 10 months ago
Learning the kernel matrix by maximizing a KFD-based class separability criterion
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...
Dit-Yan Yeung, Hong Chang, Guang Dai
IJON
2006
109views more  IJON 2006»
8 years 10 months ago
Integrating the improved CBP model with kernel SOM
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 ...
Qun Dai, Songcan Chen
PG
2000
IEEE
9 years 2 months ago
A New Adaptive Density Estimator for Particle-Tracing Radiosity
Inparticle-tracing radiosityalgorithms, energy-carrying particles are traced through an environmentfor simulating global illumination. Illumination on a surface is reconstructed f...
Wong Kam Wah
RECOMB
2004
Springer
9 years 3 months ago
Application of Kernel Method to Reveal Subtypes of TF Binding Motifs
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 ...
Alexander E. Kel, Yuri Tikunov, Nico Voss, Jü...
PAKDD
2007
ACM
224views Data Mining» more  PAKDD 2007»
9 years 4 months ago
Graph Nodes Clustering Based on the Commute-Time Kernel
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...
Luh Yen, François Fouss, Christine Decaeste...
books