Sciweavers

3395 search results - page 68 / 679
» Learning to efficiently rank
Sort
View
COLT
2006
Springer
15 years 3 months ago
Ranking with a P-Norm Push
We are interested in supervised ranking with the following twist: our goal is to design algorithms that perform especially well near the top of the ranked list, and are only requir...
Cynthia Rudin
FLAIRS
2008
15 years 2 months ago
Unsupervised Learning of General-Specific Noun Relations from the Web
In this paper, we propose a new methodology based on directed weighted graphs and the TextRank algorithm to automatically induce general-specific noun relations from web corpora f...
Gaël Dias, Raycho Mukelov, Guillaume Cleuziou
CORR
2010
Springer
135views Education» more  CORR 2010»
14 years 12 months ago
Constant-Weight Gray Codes for Local Rank Modulation
We consider the local rank-modulation scheme in which a sliding window going over a sequence of real-valued variables induces a sequence of permutations. The local rankmodulation, ...
Moshe Schwartz
IDEAL
2010
Springer
14 years 9 months ago
Approximating the Covariance Matrix of GMMs with Low-Rank Perturbations
: Covariance matrices capture correlations that are invaluable in modeling real-life datasets. Using all d2 elements of the covariance (in d dimensions) is costly and could result ...
Malik Magdon-Ismail, Jonathan T. Purnell
ICML
2009
IEEE
16 years 19 days ago
Ranking interesting subgroups
Subgroup discovery is the task of identifying the top k patterns in a database with most significant deviation in the distribution of a target attribute Y . Subgroup discovery is ...
Stefan Rueping