Derivation of User Browsing Model

Mathematicians hate words like “trivial, traditional, … “

Prelude

UBM1is a simple but ecient model in estimating position bias. The model
structures as following:
UBM: Multiple Browsing
Figure 1 UBM: Multiple Browsing

The complete-data likelihood:

P(c,a,e,m|q,u,r,d,Θ)=P(c|a,e)P(a|q,u)P(e|r,d,m)P(m|q)

The incomplete-data likelihood:

P(c|q,u,r,d,Θ)=a,eP(c|a,e)P(a|q,u)mP(e|r,d,m)P(m|q)

The conditional distribution of a,e is Bernoulli:

P(a|q,u)={αuq1αuqifa=1ifa=0

P(e|r,d,m)={γrdm1γrdmife=1ife=0

With deterministic assumption:

c=1a=e=1

The complete-data likelihood becomes:

P(c,a,e,m|q,u,r,d,Θ)=αuqγrdmμmqαuq(1γrdm)μmq(1αuq)γrdmμmq(1αuq)(1γrdm)μmq,ifc=1,ifa=1&e=0,ifa=0&e=1,ifa=0&e=0

The incomplete-data likelihood becomes:

P(c|q,u,r,d,Θ)={αuqmγrdmμmq1αuqmγrdmμmq,ifc=1,ifc=0

The log-likelihood function becomes:

logL(Θ)===all recordlogP(c|q,u,r,d,Θ)u,qr,d{SuqrdlogP(c=1|q,u,r,d,Θ)+SuqrdlogP(c=0|q,u,r,d,Θ)}u,qr,d{Suqrdlog[αuqmγrdmμmq]+Suqrdlog[(1αuqmγrdmμmq)]}

The so-called deterministic relationship c(a,e) and upon formula of log-likelihood are so misleading that at first I omited a,e as latent variables. Despite all kinds of tricks tried in M-step, I failed to deduce the iteration formulas appended in the paper.

Derivation in detail

E-step

Posterior distributions of latent variables after t -th iteration is:

Qt(a,e,m|c,u,q,r,d,Θt)=P(c,a,e,m|u,q,r,d,Θt)a,e,mP(c,a,e,m|u,q,r,d,Θt)

, thus

Qt(a=1,e=1,m|c=1,u,q,r,d,Θt)=γrdmμmqmγrdmμmq

Qt(a=1,e=0,m|c=0,u,q,r,d,Θt)=αtuq(1γtrdm)μtmq1αtuqmγtrdmμtmq

Qt(a=0,e=1,m|c=0,u,q,r,d,Θt)=(1αtuq)γtrdmμtmq1αtuqmγtrdmμtmq

Qt(a=0,e=0,m|c=0,u,q,r,d,Θt)=(1αtuq)(1γtrdm)μtmq1αtuqmγtrdmμtmq

M-step

The free energy with respect to Qt is:

F(Qt,Θ)==+=++obsa,e,mQt(a,e,m|obs)logP(c,a,e,m|u,q,r,d,Θ)u,qr,d{SuqrdmQt(a=1,e=1,m|c=1,r,d,u,q)log(αuqγrdmμmq)Suqrd[mQt(a=1,e=0,m|c=0,r,d,u,q)log(αuq(1γrdm)μmq)+mQt(a=0,e=1,m|c=0,r,d,u,q)log((1αuq)γrdmμmq)+mQt(a=0,e=0,m|c=0,r,d,u,q)log((1αuq)(1γrdm)μmq)]}u,qr,d[(Suqrd+SuqrdQt(a=1,e=0|c=0,r,d,u,q))logαuq+SuqrdQt(a=0|c=0,r,d,u,q)log(1αuq)]r,d,m{[u,q(SuqrdQt(a=1,e=1,m|c=1,r,d,u,q)+SuqrdQt(a=0,e=1,m|c=0,r,d,u,q))]logγrdm+[u,qSuqrdQt(e=0,m|c=0,r,d,u,q)]log(1γrdm)}m,q{u,r,d[SuqrdQt(m|c=1,r,d,u,q)+SuqrdQt(m|c=0,r,d,u,q)]}logμmq

Maximization over αuq,γrdm,μmq with contraint mμmq=1 leads to the updating formulas:

  • for αuq ,

    αt+1uq===r,d(Suqrd+SuqrdQt(a=1,e=0|c=0,r,d,u,q))r,d[Suqrd+Suqrd(Qt(a=1,e=0|c=0,r,d,u,q)+Qt(a=0|c=0,r,d,u,q))]r,d(Suqrd+SuqrdQt(a=1,e=0|c=0,r,d,u,q))r,d(Suqrd+Suqrd)1Suq(rdSuqrdαtuq(1mγtrdmμtmq)1αtuqmγtrdmμtmq+Suq)

  • for γrdm ,

    γt+1rdm=u,q(SuqrdQt(m|c=1,r,d,u,q)+SuqrdQt(e=1,m|c=0,r,d,u,q))u,q(SuqrdQt(m|c=1,r,d,u,q)+SuqrdQt(m|c=0,r,d,u,q))A/B,

    in which,
    AB====u,q(SuqrdQt(m|c=1,r,d,u,q)+SuqrdQt(e=1,m|c=0,r,d,u,q))u,q(Suqrd(1αtuq)γtrdmμtmq1αtuqmγtrdmμtmq+Suqrdγtrdmμtmqmγtrdmμtmq)u,q(SuqrdQt(m|c=1,r,d,u,q)+SuqrdQt(m|c=0,r,d,u,q))u,q(Suqrd(1αtuqγtrdm)μtmq1αtuqmγtrdmμtmq+Suqrdγtrdmμtmqmγtrdmμtmq)

  • for μmq ,
    μmq=λqu,r,d[SuqrdQt(m|c=1,r,d,u,q)+SuqrdQt(m|c=0,r,d,u,q)].

    mμmq=1λqSq=1λq=1Sq , thus
    μmq==1Squ,r,d[Suqrd(1αtuqγtrdm)μtmq1αtuqmγtrdmμtmq+Suqrdγtrdmμtmqmγtrdmμtmq]μtmqSqu,r,d[Suqrd1αtuqγtrdm1αtuqmγtrdmμtmq+Suqrdγtrdmmγtrdmμtmq]

  1. G. Dupret and B. Piwowarski, A user browsing model to predict search engine click data from past observations, In ACM SIGIR Conference, 2008.
  • 0
    点赞
  • 0
    收藏
    觉得还不错? 一键收藏
  • 0
    评论
评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

当前余额3.43前往充值 >
需支付:10.00
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包
实付
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明:

1.余额是钱包充值的虚拟货币,按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载,可以购买VIP、付费专栏及课程。

余额充值