67 search results - page 1 / 14 » A More Effective Linear Kernelization for Cluster Editing |
ESCAPE
2007
Springer
13 years 8 months ago
2007
Springer
In the NP-hard Cluster Editing problem, we have as input an undirected graph G and an integer k 0. The question is whether we can transform G, by inserting and deleting at most k ...
AAIM
2009
Springer
13 years 11 months ago
2009
Springer
We introduce the s-Plex Editing problem generalizing the well-studied Cluster Editing problem, both being NP-hard and both being motivated by graph-based data clustering. Instead o...
ICML
2007
IEEE
14 years 5 months ago
2007
IEEE
Many kernel learning methods have to assume parametric forms for the target kernel functions, which significantly limits the capability of kernels in fitting diverse patterns. Som...
ICCV
2009
IEEE
14 years 9 months ago
2009
IEEE
Common visual codebook generation methods used in
a Bag of Visual words model, e.g. k-means or Gaussian
Mixture Model, use the Euclidean distance to cluster features
into visual...
ICML
2006
IEEE
14 years 5 months ago
2006
IEEE
In supervised kernel methods, it has been observed that the performance of the SVM classifier is poor in cases where the diagonal entries of the Gram matrix are large relative to ...