Sciweavers

395 search results - page 5 / 79
» Learning to rank with partially-labeled data
Sort
View
NAACL
2010
13 years 8 months ago
Constraint-Driven Rank-Based Learning for Information Extraction
Most learning algorithms for undirected graphical models require complete inference over at least one instance before parameter updates can be made. SampleRank is a rankbased lear...
Sameer Singh, Limin Yao, Sebastian Riedel, Andrew ...
ALT
2009
Springer
14 years 7 months ago
Average-Case Active Learning with Costs
Abstract. We analyze the expected cost of a greedy active learning algorithm. Our analysis extends previous work to a more general setting in which different queries have differe...
Andrew Guillory, Jeff A. Bilmes
ICML
2006
IEEE
14 years 11 months ago
Ranking on graph data
In ranking, one is given examples of order relationships among objects, and the goal is to learn from these examples a real-valued ranking function that induces a ranking or order...
Shivani Agarwal
KDD
2005
ACM
143views Data Mining» more  KDD 2005»
14 years 11 months ago
SVM selective sampling for ranking with application to data retrieval
Learning ranking (or preference) functions has been a major issue in the machine learning community and has produced many applications in information retrieval. SVMs (Support Vect...
Hwanjo Yu
PAMI
2008
139views more  PAMI 2008»
13 years 10 months ago
A Fast Algorithm for Learning a Ranking Function from Large-Scale Data Sets
We consider the problem of learning a ranking function that maximizes a generalization of the Wilcoxon-Mann-Whitney statistic on the training data. Relying on an -accurate approxim...
Vikas C. Raykar, Ramani Duraiswami, Balaji Krishna...