84 search results - page 12 / 17 » Linear Problem Kernels for NP-Hard Problems on Planar Graphs |
103
click to vote
PAMI
2007
14 years 9 months ago
2007
—A variety of clustering algorithms have recently been proposed to handle data that is not linearly separable; spectral clustering and kernel k-means are two of the main methods....
103
click to vote
BMCBI
2008
14 years 9 months ago
2008
Background: Machine-learning tools have gained considerable attention during the last few years for analyzing biological networks for protein function prediction. Kernel methods a...
140
click to vote
PAKDD
2011
ACM
14 years 8 days ago
2011
ACM
A structural similarity kernel is presented in this paper for SVM learning, especially for learning with imbalanced datasets. Kernels in SVM are usually pairwise, comparing the sim...
111
Voted
SODA
2012
ACM
12 years 12 months ago
2012
ACM
Bidimensionality theory was introduced by Demaine et al. [JACM 2005 ] as a framework to obtain algorithmic results for hard problems on minor closed graph classes. The theory has ...
ICML
2007
IEEE
15 years 10 months ago
2007
IEEE
We study the problem of discovering a manifold that best preserves information relevant to a nonlinear regression. Solving this problem involves extending and uniting two threads ...