743 search results - page 74 / 149 » Solving the Multiple-Instance Problem: A Lazy Learning Appro... |
126
Voted
SIGPRO
2011
14 years 10 months ago
2011
In this paper, we survey and compare different algorithms that, given an overcomplete dictionary of elementary functions, solve the problem of simultaneous sparse signal approxim...
100
Voted
CIKM
2011
Springer
14 years 3 months ago
2011
Springer
Various semi-supervised learning methods have been proposed recently to solve the long-standing shortage problem of manually labeled data in sentiment classification. However, mos...
NAACL
2003
15 years 4 months ago
2003
Homograph ambiguity is an original issue in Text-to-Speech (TTS). To disambiguate homograph, several efficient approaches have been proposed such as part-of-speech (POS) n-gram, B...
121
click to vote
GECCO
2005
Springer
15 years 8 months ago
2005
Springer
This paper presents an approach to combine competent crossover and mutation operators via probabilistic model building. Both operators are based on the probabilistic model buildin...
119
click to vote
GECCO
2006
Springer
15 years 7 months ago
2006
Springer
The representation used by a learning algorithm introduces a bias which is more or less well-suited to any given learning problem. It is well known that, across all possible probl...