109 search results - page 20 / 22 » Algorithm Selection as a Bandit Problem with Unbounded Losse... |
ACL
2003
13 years 6 months ago
2003
Kernel-based learning (e.g., Support Vector Machines) has been successfully applied to many hard problems in Natural Language Processing (NLP). In NLP, although feature combinatio...
ENGL
2007
13 years 5 months ago
2007
— Most research in Knowledge Mining deal with the basic models like clustering, classification, regression, association rule mining and so on. In the process of quest for knowled...
MLCW
2005
Springer
13 years 10 months ago
2005
Springer
This Chapter presents the PASCAL1 Evaluating Predictive Uncertainty Challenge, introduces the contributed Chapters by the participants who obtained outstanding results, and provide...
JACM
2006
13 years 5 months ago
2006
Abstract. Maximum likelihood (ML) is an increasingly popular optimality criterion for selecting evolutionary trees [Felsenstein 1981]. Finding optimal ML trees appears to be a very...
CIKM
2009
Springer
13 years 12 months ago
2009
Springer
We introduce a new theoretical derivation, evaluation methods, and extensive empirical analysis for an automatic query expansion framework in which model estimation is cast as a r...