1542 search results - page 149 / 309 » Kernelization of packing problems |
CSB
2005
IEEE
15 years 7 months ago
2005
IEEE
With hierarchical clustering methods, divisions or fusions, once made, are irrevocable. As a result, when two elements in a bottom-up algorithm are assigned to one cluster, they c...
135
click to vote
ML
2002
ACM
15 years 1 months ago
2002
ACM
A widely acknowledged drawback of many statistical modelling techniques, commonly used in machine learning, is that the resulting model is extremely difficult to interpret. A numb...
152
click to vote
CVPR
2011
IEEE
14 years 9 months ago
2011
IEEE
In real-world applications, “what you saw” during training is often not “what you get” during deployment: the distribution and even the type and dimensionality of features...
138
Voted
TNN
2010
14 years 8 months ago
2010
Abstract--Recently, sparse approximation has become a preferred method for learning large scale kernel machines. This technique attempts to represent the solution with only a subse...
129
click to vote
ICASSP
2011
IEEE
14 years 5 months ago
2011
IEEE
We propose a kernelized maximal-figure-of-merit (MFoM) learning approach to efficiently training a nonlinear model using subspace distance minimization. In particular, a fixed,...