93 search results - page 4 / 19 » Learning kernels from indefinite similarities |
CIKM
2009
Springer
14 years 1 months ago
2009
Springer
Many applications in structure matching require the ability to search for graphs that are similar to a query graph, i.e., similarity graph queries. Prior works, especially in chem...
NIPS
2008
13 years 8 months ago
2008
Regularized Least Squares (RLS) algorithms have the ability to avoid over-fitting problems and to express solutions as kernel expansions. However, we observe that the current RLS ...
CVPR
2011
IEEE
12 years 11 months ago
2011
IEEE
Object segmentation needs to be driven by top-down knowledge to produce semantically meaningful results. In this paper, we propose a supervised segmentation approach that tightly ...
AAAI
2007
13 years 9 months ago
2007
String kernels directly model sequence similarities without the necessity of extracting numerical features in a vector space. Since they better capture complex traits in the seque...
CVPR
2011
IEEE
13 years 3 months ago
2011
IEEE
The goal of object category discovery is to automatically identify groups of image regions which belong to some new, previously unseen category. This task is typically performed i...