1435 search results - page 86 / 287 » Generalization Error Bounds Using Unlabeled Data |
ACCV
2010
Springer
14 years 4 months ago
2010
Springer
Abstract. We propose a novel unsupervised transfer learning framework that utilises unlabelled auxiliary data to quantify and select the most relevant transferrable knowledge for r...
FUN
2010
Springer
15 years 2 months ago
2010
Springer
The way memory hierarchy has evolved in recent decades has opened new challenges in the development of indexing structures in general and spatial access methods in particular. In t...
KDD
2009
ACM
15 years 10 months ago
2009
ACM
Mining discrete patterns in binary data is important for subsampling, compression, and clustering. We consider rankone binary matrix approximations that identify the dominant patt...
104
click to vote
ICALP
2011
Springer
14 years 1 months ago
2011
Springer
We consider the following Tree-Constrained Bipartite Matching problem: Given two rooted trees T1 = (V1, E1), T2 = (V2, E2) and a weight function w : V1 × V2 → R+, find a maximu...
103
click to vote
NN
2002
Springer
2002
Springer
Optimal design of regularization term and regularization parameter by subspace information criterion
14 years 9 months ago
The problem of designing the regularization term and regularization parameter for linear regression models is discussed. Previously, we derived an approximation to the generalizat...