3204 search results - page 410 / 641 » Online Learning with Constraints |
287
click to vote
ICDE
2005
IEEE
16 years 8 months ago
2005
IEEE
Schema Matching is the problem of identifying corresponding elements in different schemas. Discovering these correspondences or matches is inherently difficult to automate. Past s...
145
click to vote
ICML
2008
IEEE
16 years 7 months ago
2008
IEEE
We consider feature extraction (dimensionality reduction) for compositional data, where the data vectors are constrained to be positive and constant-sum. In real-world problems, t...
199
click to vote
COLT
2005
Springer
16 years 5 days ago
2005
Springer
We discuss a simple sparse linear problem that is hard to learn with any algorithm that uses a linear combination of the training instances as its weight vector. The hardness holds...
154
click to vote
EMNLP
2006
15 years 8 months ago
2006
We study unsupervised methods for learning refinements of the nonterminals in a treebank. Following Matsuzaki et al. (2005) and Prescher (2005), we may for example split NP withou...
184
click to vote
ICML
2010
IEEE
15 years 7 months ago
2010
IEEE
Pseudo-likelihood and contrastive divergence are two well-known examples of contrastive methods. These algorithms trade off the probability of the correct label with the probabili...