Suppose that when the probability of e changes from p j ' ( e )to p j+1 ' ( e ), the positions of result tuple x and y are inverted (in R j ' , x is ranked before y; in R j+1 ' x is ranked after y). If we use x0 and xj to denote the position of x in R0 and R j ' , respectively, and y0 and yj the position of y in R0 and R j ' , respectively, then

Distance w ( R j+1 ' ,Top K 0 )= Distance w ( R j ' ,Top K 0 )+\ { 2 w x j if x 0 x j and y 0 y j ; 2 w x j if x 0 > x j and y 0 y j ; 0 if( x 0 > x j and y 0 y j )or( x 0 x j and y 0 y j ). ( 11.22 )

Hence, all the distances Distance

Get Context-Aware Computing now with the O’Reilly learning platform.

O’Reilly members experience books, live events, courses curated by job role, and more from O’Reilly and nearly 200 top publishers.