1351 search results - page 141 / 271 » Learning from compressed observations |
129
click to vote
ICML
2003
IEEE
16 years 5 months ago
2003
IEEE
We consider the problem of unsupervised learning from a matrix of data vectors where in each row the observed values are randomly permuted in an unknown fashion. Such problems ari...
116
click to vote
KDD
2009
ACM
15 years 9 months ago
2009
ACM
Learning temporal graph structures from time series data reveals important dependency relationships between current observations and histories. Most previous work focuses on learn...
121
click to vote
NIPS
2008
15 years 5 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 ...
144
click to vote
UAI
2000
15 years 5 months ago
2000
In this paper we present decomposable priors, a family of priors over structure and parameters of tree belief nets for which Bayesian learning with complete observations is tracta...
126
click to vote
JCP
2006
15 years 4 months ago
2006
Gliomas are malignant brain tumors that grow by invading adjacent tissue. We propose and evaluate a 3D classification-based growth model, CDM, that predicts how a glioma will grow ...