Sciweavers

99 search results - page 8 / 20
» Ranking and Scoring Using Empirical Risk Minimization
Sort
View
64
Voted
NIPS
2007
14 years 11 months ago
Structured Learning with Approximate Inference
In many structured prediction problems, the highest-scoring labeling is hard to compute exactly, leading to the use of approximate inference methods. However, when inference is us...
Alex Kulesza, Fernando Pereira
AI
2008
Springer
14 years 9 months ago
Label ranking by learning pairwise preferences
Preference learning is a challenging problem that involves the prediction of complex structures, such as weak or partial order relations, rather than single values. In the recent ...
Eyke Hüllermeier, Johannes Fürnkranz, We...
ICASSP
2011
IEEE
14 years 1 months ago
Empirical divergence maximization for quantizer design: An analysis of approximation error
Empirical divergence maximization is an estimation method similar to empirical risk minimization whereby the Kullback-Leibler divergence is maximized over a class of functions tha...
Michael A. Lexa
EDBT
2011
ACM
254views Database» more  EDBT 2011»
14 years 1 months ago
SocialSearch: enhancing entity search with social network matching
This paper introduces the problem of matching people names to their corresponding social network identities such as their Twitter accounts. Existing tools for this purpose build u...
Gae-won You, Seung-won Hwang, Zaiqing Nie, Ji-Rong...
GECCO
2010
Springer
182views Optimization» more  GECCO 2010»
15 years 2 months ago
Model selection in genetic programming
Abstract. We discuss the problem of model selection in Genetic Programming using the framework provided by Statistical Learning Theory, i.e. Vapnik-Chervonenkis theory (VC). We pre...
Cruz E. Borges, César Luis Alonso, Jos&eacu...