ICIAP
2009
ACM
13 years 2 months ago
2009
ACM
Abstract. Shape classification using graphs and skeletons usually involves edition processes in order to reduce the influence of structural noise. However, edition distances can no...
ICDM
2009
IEEE
13 years 2 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...
CORR
2008
Springer
13 years 4 months ago
2008
Springer
Graph kernels methods are based on an implicit embedding of graphs within a vector space of large dimension. This implicit embedding allows to apply to graphs methods which where u...
BMCBI
2008
13 years 4 months ago
2008
Background: Automated extraction of protein-protein interactions (PPI) is an important and widely studied task in biomedical text mining. We propose a graph kernel based approach ...
ICML
2010
IEEE
13 years 5 months ago
2010
IEEE
We introduce a novel graph kernel called the Neighborhood Subgraph Pairwise Distance Kernel. The kernel decomposes a graph into all pairs of neighborhood subgraphs of small radius...
CAIP
2009
Springer
13 years 8 months ago
2009
Springer
The medial axis being an homotopic transformation, the skeleton of a 2D shape corresponds to a planar graph having one face for each hole of the shape and one node for each junctio...
GBRPR
2009
Springer
13 years 11 months ago
2009
Springer
A large family of shape comparison methods is based on a medial axis transform combined with an encoding of the skeleton by a graph. Despite many qualities this encoding of shapes ...