Sciweavers

377 search results - page 38 / 76
» Learning Linear Ordering Problems for Better Translation
Sort
View
JMLR
2010
147views more  JMLR 2010»
14 years 4 months ago
Spectral Regularization Algorithms for Learning Large Incomplete Matrices
We use convex relaxation techniques to provide a sequence of regularized low-rank solutions for large-scale matrix completion problems. Using the nuclear norm as a regularizer, we...
Rahul Mazumder, Trevor Hastie, Robert Tibshirani
ICDM
2003
IEEE
104views Data Mining» more  ICDM 2003»
15 years 3 months ago
Structure Search and Stability Enhancement of Bayesian Networks
Learning Bayesian network structure from large-scale data sets, without any expertspecified ordering of variables, remains a difficult problem. We propose systematic improvements ...
Hanchuan Peng, Chris H. Q. Ding
ICML
2004
IEEE
15 years 10 months ago
Training conditional random fields via gradient tree boosting
Conditional Random Fields (CRFs; Lafferty, McCallum, & Pereira, 2001) provide a flexible and powerful model for learning to assign labels to elements of sequences in such appl...
Thomas G. Dietterich, Adam Ashenfelter, Yaroslav B...
ICPR
2008
IEEE
15 years 11 months ago
Learning invariant region descriptor operators with genetic programming and the F-measure
Recognizing and localizing objects is a classical problem in computer vision that is an important stage for many automated systems. In order to perform object recognition many res...
Cynthia B. Pérez, Gustavo Olague
PRL
2011
14 years 4 months ago
Consistency of functional learning methods based on derivatives
In some real world applications, such as spectrometry, functional models achieve better predictive performances if they work on the derivatives of order m of their inputs rather t...
Fabrice Rossi, Nathalie Villa-Vialaneix