rbo

Documentation

Overview

Package rbo calculates the rank biased overlap between ordered lists

Index

• func I(S, T []string, d int) []string
• func RBDext(S, T []string, p float64, userK int) float64
• func RBOext(Sinput, Tinput []string, p float64, userK int) float64
• func X(intersection []string) int

Functions

func I

func I(S, T []string, d int) []string

I is the intersection between lists S and T

func RBDext

func RBDext(S, T []string, p float64, userK int) float64

RBDext calculates the RBOext to depth k and returns the distance (1-RBOext). k should not be greater than max(len(s), len(t)), and will be set to this minimum if it is. Set k to 0 to comparse full length of lists. p is the persitence (weighting).

func RBOext

func RBOext(Sinput, Tinput []string, p float64, userK int) float64

RBOext calculates the rank biased overlap to depth k, based on formula 32 from "A Similarity Measure for Indefinite Rankings" (Webber et al.). k should not be greater than max(len(s), len(t)), and will be set to this minimum if it is. Set k to 0 to compare full length of lists. p is the persitence (weighting).

func X

func X(intersection []string) int

X calculates the size of the intersection of lists S and T.