lerot.comparison

class lerot.comparison.BalancedInterleave(arg_str=None)[source]

Bases: lerot.comparison.AbstractInterleavedComparison.AbstractInterleavedComparison

Interleave and compare rankers using the original balanced interleave method.

infer_outcome(l, a, c, query)[source]
interleave(r1, r2, query, length)[source]
class lerot.comparison.DocumentConstraints(arg_str='random')[source]

Bases: lerot.comparison.AbstractInterleavedComparison.AbstractInterleavedComparison

Interleave using balanced interleave, compare using document constraints.

check_constraints(l, a, click_ids)[source]
infer_outcome(l, a, c, query)[source]
interleave(r1, r2, query, length)[source]
class lerot.comparison.HistBalancedInterleave(arg_str=None)[source]

Bases: lerot.comparison.AbstractHistInterleavedComparison.AbstractHistInterleavedComparison

Balanced interleave method, applied to historical data.

infer_outcome(l, a, c, target_r1, target_r2, query)[source]

count clicks within the top-k interleaved list

class lerot.comparison.HistDocumentConstraints(arg_str=None)[source]

Bases: lerot.comparison.AbstractHistInterleavedComparison.AbstractHistInterleavedComparison

Document constraints method, applied to historical data.

infer_outcome(l, a, c, target_r1, target_r2, query)[source]

count clicks within the top-k interleaved list

class lerot.comparison.HistProbabilisticInterleave(arg_str=None)[source]

Bases: lerot.comparison.AbstractHistInterleavedComparison.AbstractHistInterleavedComparison

Probabilistic interleaving using historical data

infer_outcome(l, source_context, c, target_r1, target_r2, query)[source]
class lerot.comparison.HistTeamDraft(arg_str=None)[source]

Bases: lerot.comparison.AbstractHistInterleavedComparison.AbstractHistInterleavedComparison

Team draft method, applied to historical data.

infer_outcome(l, a, c, target_r1, target_r2, query)[source]

assign clicks for contributed documents

class lerot.comparison.OptimizedInterleave(arg_str='')[source]

Bases: lerot.comparison.AbstractInterleavedComparison.AbstractInterleavedComparison

An implementation of Optimized Interleave as described in:

@see: Radlinski, F., & Craswell, N. (2013, February). Optimized interleaving for online retrieval evaluation. In Proceedings of the sixth ACM international conference on Web search and data mining (pp. 245-254).

@author: Anne Schuth @contact: anne.schuth@uva.nl @since: February 2013 @requires: Gurobi from http://www.gurobi.com/

binary_credit(li, rankA, rankB)[source]
f(i)[source]
infer_outcome(l, credit, clicks, query)[source]
interleave(r1, r2, query, length, bias=0)[source]
interleave_n(r1, r2, query, length, num_repeat, bias=0)[source]
inverse_credit(li, rankA, rankB)[source]
linear_credit(li, rankA, rankB)[source]
perm_given_index(alist, apermindex)[source]

See http://stackoverflow.com/questions/5602488/random-picks-from-permutation-generator

precompute_rank(R)[source]
prefix_constraint(rankings, length)[source]
prefix_constraint_bound(rankings, length, prefix_bound)[source]
rank(li, R)[source]
reject(l, rankings)[source]
sample(docs, length)[source]
sample_prefix_constraint(rankings, length)[source]
sample_prefix_constraint_constructive(rankings, length)[source]
class lerot.comparison.OptimizedInterleaveVa(arg_str=None)[source]

Bases: lerot.comparison.OptimizedInterleave.OptimizedInterleave

precompute_rank_va(R)[source]
prefix_constraint_va(rankings, length)[source]
class lerot.comparison.ProbabilisticInterleave(arg_str=None)[source]

Bases: lerot.comparison.AbstractInterleavedComparison.AbstractInterleavedComparison

Probabilistic interleaving, marginalizes over assignments

get_probability_of_list(result_list, context, query)[source]
infer_outcome(l, a, c, query)[source]
interleave(r1, r2, query, length)[source]
class lerot.comparison.ProbabilisticInterleaveWithHistory(arg_str)[source]

Bases: lerot.comparison.ProbabilisticInterleave.ProbabilisticInterleave

Probabilistic interleaving that reuses historic data (with importance sampling).

infer_outcome(l, context, c, query)[source]
class lerot.comparison.StochasticBalancedInterleave(arg_str)[source]

Bases: lerot.comparison.AbstractInterleavedComparison.AbstractInterleavedComparison

Interleave and compare rankers using the stochastic interleave method introduced in Hofmann et al. ECIR‘11.

infer_outcome(l, a, c, query)[source]
interleave(r1, r2, query, length)[source]
class lerot.comparison.TeamDraft(arg_str=None)[source]

Bases: lerot.comparison.AbstractInterleavedComparison.AbstractInterleavedComparison

Baseline team draft method.

infer_outcome(l, a, c, query)[source]

assign clicks for contributed documents

interleave(r1, r2, query, length1=None)[source]

updated to match the original method

class lerot.comparison.VaTdi(arg_str=None)[source]

Bases: lerot.comparison.TeamDraft.TeamDraft

Algorithm described in https://bitbucket.org/varepsilon/tois2013-interleaving

interleave(r1, r2, query, length=None)[source]
static sampleSmoothly(a, b, maxVal)[source]