Sciweavers

1339 search results - page 140 / 268
» Learning Functions from Imperfect Positive Data
Sort
View
COLT
1999
Springer
14 years 2 months ago
On a Generalized Notion of Mistake Bounds
This paper proposes the use of constructive ordinals as mistake bounds in the on-line learning model. This approach elegantly generalizes the applicability of the on-line mistake ...
Sanjay Jain, Arun Sharma
ICML
2005
IEEE
14 years 11 months ago
Discriminative versus generative parameter and structure learning of Bayesian network classifiers
In this paper, we compare both discriminative and generative parameter learning on both discriminatively and generatively structured Bayesian network classifiers. We use either ma...
Franz Pernkopf, Jeff A. Bilmes
BMCBI
2008
112views more  BMCBI 2008»
13 years 10 months ago
A simplified approach to disulfide connectivity prediction from protein sequences
Background: Prediction of disulfide bridges from protein sequences is useful for characterizing structural and functional properties of proteins. Several methods based on differen...
Marc Vincent, Andrea Passerini, Matthieu Labb&eacu...
MM
2004
ACM
167views Multimedia» more  MM 2004»
14 years 3 months ago
Learning an image manifold for retrieval
We consider the problem of learning a mapping function from low-level feature space to high-level semantic space. Under the assumption that the data lie on a submanifold embedded ...
Xiaofei He, Wei-Ying Ma, HongJiang Zhang
EMNLP
2008
13 years 11 months ago
Phrase Translation Probabilities with ITG Priors and Smoothing as Learning Objective
The conditional phrase translation probabilities constitute the principal components of phrase-based machine translation systems. These probabilities are estimated using a heurist...
Markos Mylonakis, Khalil Sima'an