Sciweavers

11 search results - page 2 / 3
» Learnability of Bipartite Ranking Functions
Sort
View
COLING
2010
13 years 8 days ago
Extracting and Ranking Product Features in Opinion Documents
An important task of opinion mining is to extract people's opinions on features of an entity. For example, the sentence, "I love the GPS function of Motorola Droid"...
Lei Zhang, Bing Liu, Suk Hwan Lim, Eamonn O'Brien-...
NIPS
2004
13 years 6 months ago
A Large Deviation Bound for the Area Under the ROC Curve
The area under the ROC curve (AUC) has been advocated as an evaluation criterion for the bipartite ranking problem. We study large deviation properties of the AUC; in particular, ...
Shivani Agarwal, Thore Graepel, Ralf Herbrich, Dan...
COLT
2008
Springer
13 years 7 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
JMLR
2006
125views more  JMLR 2006»
13 years 5 months ago
Efficient Learning of Label Ranking by Soft Projections onto Polyhedra
We discuss the problem of learning to rank labels from a real valued feedback associated with each label. We cast the feedback as a preferences graph where the nodes of the graph ...
Shai Shalev-Shwartz, Yoram Singer
ICML
2009
IEEE
14 years 6 months ago
Learning spectral graph transformations for link prediction
We present a unified framework for learning link prediction and edge weight prediction functions in large networks, based on the transformation of a graph's algebraic spectru...
Andreas Lommatzsch, Jérôme Kunegis