Skip to content
New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

Sign up for GitHub

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

Jump to bottom

Update rbo.py #20

Open
wants to merge 1 commit into
base: master
Choose a base branch
from
Open

Update rbo.py #20

Changes from all commits
Commits
Show all changes
1 commit
Select commit
File filter

Filter by extension

Filter by extension
Conversations
Failed to load comments.
Loading
Jump to
Jump to file
Failed to load files.
Loading
Diff view
Diff view
12 changes: 9 additions & 3 deletions rbo/rbo.py
View file
Open in desktop
Original file line number Diff line number Diff line change
Expand Up @@ -80,11 +80,17 @@ def rbo(
Unlike Kendall tau which is correlation based, this is intersection
based.
The implementation if from Eq. (4) or Eq. (7) (for p != 1) from the
RBO paper: http://www.williamwebber.com/research/papers/wmz10_tois.pdf
RBO paper:
Webber, W., Moffat, A. and Zobel, J., 2010. A similarity measure for
indefinite rankings. ACM Transactions on Information Systems (TOIS),
28(4), pp.1-38.
http://www.williamwebber.com/research/papers/wmz10_tois.pdf

If p = 1, it returns to the un-bounded set-intersection overlap,
according to Fagin et al.
https://researcher.watson.ibm.com/researcher/files/us-fagin/topk.pdf
according to Fagin et al:
Fagin, R., Kumar, R. and Sivakumar, D., 2003. Comparing top k lists.
SIAM Journal on discrete mathematics, 17(1), pp.134-160.
https://doi.org/10.1137/S0895480102412856

The fig. 5 in that RBO paper can be used as test case.
Note there the choice of p is of great importance, since it
Expand Down