Sciweavers

37 search results - page 1 / 8
» Robust Reductions from Ranking to Classification
Sort
View
COLT
2007
Springer
13 years 8 months ago
Robust Reductions from Ranking to Classification
Abstract. We reduce ranking, as measured by the Area Under the Receiver Operating Characteristic Curve (AUC), to binary classification. The core theorem shows that a binary classif...
Maria-Florina Balcan, Nikhil Bansal, Alina Beygelz...
COLT
2008
Springer
13 years 6 months ago
An Efficient Reduction of Ranking to Classification
This paper describes an efficient reduction of the learning problem of ranking to binary classification. The reduction guarantees an average pairwise misranking regret of at most t...
Nir Ailon, Mehryar Mohri
ACMSE
2010
ACM
12 years 11 months ago
Learning to rank using 1-norm regularization and convex hull reduction
The ranking problem appears in many areas of study such as customer rating, social science, economics, and information retrieval. Ranking can be formulated as a classification pro...
Xiaofei Nan, Yixin Chen, Xin Dang, Dawn Wilkins
TSP
2010
12 years 11 months ago
Robust precoding with Bayesian error modeling for limited feedback MU-MISO systems
We consider the robust precoder design for Multi-User Multiple Input Single Output (MU-MISO) systems where the Channel State Information (CSI) is fed back from the single antenna ...
Michael Joham, Paula Maria Castro, Luis Castedo, W...
SADM
2010
173views more  SADM 2010»
12 years 11 months ago
Data reduction in classification: A simulated annealing based projection method
This paper is concerned with classifying high dimensional data into one of two categories. In various settings, such as when dealing with fMRI and microarray data, the number of v...
Tian Siva Tian, Rand R. Wilcox, Gareth M. James