Friday, January 6, 2017

Click Models



http://www.cnblogs.com/bentuwuying/p/6227645.html

http://www.cnblogs.com/bentuwuying/p/6241504.html


http://www.sciencedirect.com/science/article/pii/S2468232216300245
Vertical-aware Click Model
Sequential Click Model
Most click models follow the examination hypothesis [6]: a document being clicked (Ci=1) should satisfy () two conditions: it is examined (Ei=1) and it is relevant (Ri=1) (most click models assume P(Ri=1)=ru, which is the probability of the perceived relevance), and these two conditions are independent of each other.
equation1
Ci=1Ei=1,Ri=1
equation2
Ei=0Ci=0
equation3
Ri=0Ci=0
Following this assumption, the probability of a document being clicked is determined as follows:
equation4
P(Ci=1)=P(Ei=1)P(Ri=1)

Craswell et al. [6] proposed the cascade model, which assumes that while a user examines the results from top to bottom sequentially, he/she immediately decides whether to click on a result. The cascade model is mostly suitable for single-click sessions. A number of succeeding models were proposed to improve both its applicability and performance.
equation5
equation6
P(Ei+1=1|Ei=1,Ci)=1Ci
Here the examination of the (i+1)-th result indicates the i-th result has been examined but not clicked. Although the cascade model performs well in predicting the click-through rates, this model is only suited for a single-click scenario.

Based on the cascade hypothesis, the Dependency Click Model (DCM) [9] extends the cascade model in order to model user interactions within multi-click sessions. DCM assumes that a user may have a certain probability of examining the next document after clicking the current document, and this probability is influenced by the ranking position of the result. The DCM model is characterized as follows:
equation7
P(Ei+1=1|Ei=1,Ci=0)=1
equation8
P(Ei+1=1|Ei=1,Ci=1)=λi
where λi represents the preservation probability1 of the position i.

Labels

Review (572) System Design (334) System Design - Review (198) Java (189) Coding (75) Interview-System Design (65) Interview (63) Book Notes (59) Coding - Review (59) to-do (45) Linux (43) Knowledge (39) Interview-Java (35) Knowledge - Review (32) Database (31) Design Patterns (31) Big Data (29) Product Architecture (28) MultiThread (27) Soft Skills (27) Concurrency (26) Cracking Code Interview (26) Miscs (25) Distributed (24) OOD Design (24) Google (23) Career (22) Interview - Review (21) Java - Code (21) Operating System (21) Interview Q&A (20) System Design - Practice (20) Tips (19) Algorithm (17) Company - Facebook (17) Security (17) How to Ace Interview (16) Brain Teaser (14) Linux - Shell (14) Redis (14) Testing (14) Tools (14) Code Quality (13) Search (13) Spark (13) Spring (13) Company - LinkedIn (12) How to (12) Interview-Database (12) Interview-Operating System (12) Solr (12) Architecture Principles (11) Resource (10) Amazon (9) Cache (9) Git (9) Interview - MultiThread (9) Scalability (9) Trouble Shooting (9) Web Dev (9) Architecture Model (8) Better Programmer (8) Cassandra (8) Company - Uber (8) Java67 (8) Math (8) OO Design principles (8) SOLID (8) Design (7) Interview Corner (7) JVM (7) Java Basics (7) Kafka (7) Mac (7) Machine Learning (7) NoSQL (7) C++ (6) Chrome (6) File System (6) Highscalability (6) How to Better (6) Network (6) Restful (6) CareerCup (5) Code Review (5) Hash (5) How to Interview (5) JDK Source Code (5) JavaScript (5) Leetcode (5) Must Known (5) Python (5)

Popular Posts