Sciweavers

417 search results - page 6 / 84
» Generalization Bounds for Some Ordinal Regression Algorithms
Sort
View
DAGSTUHL
2008
13 years 8 months ago
Interactive Multiobjective Optimization Using a Set of Additive Value Functions
Abstract. In this chapter, we present a new interactive procedure for multiobjective optimization, which is based on the use of a set of value functions as a preference model built...
José Rui Figueira, Salvatore Greco, Vincent...
INCDM
2009
Springer
96views Data Mining» more  INCDM 2009»
14 years 1 months ago
Ordinal Evaluation: A New Perspective on Country Images
We present a novel use of ordinal evaluation (OrdEval) algorithm as a promising technique to study various marketing phenomena. OrdEval algorithm has originated in data mining and ...
Marko Robnik-Sikonja, Kris Brijs, Koen Vanhoof
ICML
2001
IEEE
14 years 8 months ago
Some Theoretical Aspects of Boosting in the Presence of Noisy Data
This is a survey of some theoretical results on boosting obtained from an analogous treatment of some regression and classi cation boosting algorithms. Some related papers include...
Wenxin Jiang
JMLR
2012
11 years 9 months ago
Algorithms for Learning Kernels Based on Centered Alignment
This paper presents new and effective algorithms for learning kernels. In particular, as shown by our empirical results, these algorithms consistently outperform the so-called uni...
Corinna Cortes, Mehryar Mohri, Afshin Rostamizadeh
COLT
2000
Springer
13 years 11 months ago
Leveraging for Regression
In this paper we examine master regression algorithms that leverage base regressors by iteratively calling them on modified samples. The most successful leveraging algorithm for c...
Nigel Duffy, David P. Helmbold