Advanced Click Models & their Applications to IR
|
|
- Garey Higgins
- 6 years ago
- Views:
Transcription
1 Advanced Click Models & their Applications to IR (Afternoon block 1) Aleksandr Chuklin, Ilya Markov Maarten de Rijke University of Amsterdam Google Switzerland SIGIR 2015 Tutorial AC IM MdR Advanced Click Models & their Applications to IR 1
2 Afternoon block 1 Outline 1 Introduction 2 Advanced Click Models 3 Demo 4 Recap AC IM MdR Advanced Click Models & their Applications to IR 2
3 Introduction Advanced Click Models Demo Recap Who are we? Aleksandr Software engineer at Google AC IM MdR Advanced Click Models & their Applications to IR 3
4 Introduction Advanced Click Models Demo Recap Who are we? Aleksandr Ilya Software engineer at Google Postdoc at U. Amsterdam AC IM MdR Advanced Click Models & their Applications to IR 3
5 Introduction Advanced Click Models Demo Recap Who are we? Aleksandr Ilya Maarten Software engineer at Google Postdoc at U. Amsterdam Professor at U. Amsterdam AC IM MdR Advanced Click Models & their Applications to IR 3
6 Aims Describe existing click models in a unified way, so that different models can easily be related to each other AC IM MdR Advanced Click Models & their Applications to IR 4
7 Aims Describe existing click models in a unified way, so that different models can easily be related to each other Compare commonly used click models AC IM MdR Advanced Click Models & their Applications to IR 4
8 Aims Describe existing click models in a unified way, so that different models can easily be related to each other Compare commonly used click models Provide ready-to-use formulas and implementations of existing click models and detail parameter estimation procedures to facilitate the development of new ones AC IM MdR Advanced Click Models & their Applications to IR 4
9 Aims Describe existing click models in a unified way, so that different models can easily be related to each other Compare commonly used click models Provide ready-to-use formulas and implementations of existing click models and detail parameter estimation procedures to facilitate the development of new ones Summarize current efforts on click model evaluation evaluation approaches, datasets and software packages AC IM MdR Advanced Click Models & their Applications to IR 4
10 Aims Describe existing click models in a unified way, so that different models can easily be related to each other Compare commonly used click models Provide ready-to-use formulas and implementations of existing click models and detail parameter estimation procedures to facilitate the development of new ones Summarize current efforts on click model evaluation evaluation approaches, datasets and software packages Provide an overview of click model applications and directions for future development of click models AC IM MdR Advanced Click Models & their Applications to IR 4
11 Structure of the tutorial Two parts, with two blocks each An Introduction to Click Models for Web Search Advanced Click Models and their applications to IR AC IM MdR Advanced Click Models & their Applications to IR 5
12 Structure of the tutorial Two parts, with two blocks each An Introduction to Click Models for Web Search Advanced Click Models and their applications to IR Part II (this afternoon) Introduction Advanced Click Models Break Demo Guest presentation by Yiqun Liu (Tsinghua University): Building a Click Model: From Idea to Implementation Applications Future Directions AC IM MdR Advanced Click Models & their Applications to IR 5
13 Materials Complete draft of the book on which the tutorial is based: Aleksandr Chuklin, Ilya Markov, Maarten de Rijke. Click Models for Web Search. Synthesis Lectures on Information Concepts, Retrieval, and Services. Morgan & Claypool, July, 2015 AC IM MdR Advanced Click Models & their Applications to IR 6
14 Materials Complete draft of the book on which the tutorial is based: Aleksandr Chuklin, Ilya Markov, Maarten de Rijke. Click Models for Web Search. Synthesis Lectures on Information Concepts, Retrieval, and Services. Morgan & Claypool, July, 2015 Copy of the slides Parts I and II AC IM MdR Advanced Click Models & their Applications to IR 6
15 Materials Complete draft of the book on which the tutorial is based: Aleksandr Chuklin, Ilya Markov, Maarten de Rijke. Click Models for Web Search. Synthesis Lectures on Information Concepts, Retrieval, and Services. Morgan & Claypool, July, 2015 Copy of the slides Parts I and II Code and data samples to follow live demos AC IM MdR Advanced Click Models & their Applications to IR 6
16 Materials Complete draft of the book on which the tutorial is based: Aleksandr Chuklin, Ilya Markov, Maarten de Rijke. Click Models for Web Search. Synthesis Lectures on Information Concepts, Retrieval, and Services. Morgan & Claypool, July, 2015 Copy of the slides Parts I and II Code and data samples to follow live demos See for updates and additional materials AC IM MdR Advanced Click Models & their Applications to IR 6
17 What is a click model? AC IM MdR Advanced Click Models & their Applications to IR 7
18 Why click models? Understand users Simulate users Evaluate search Improve search AC IM MdR Advanced Click Models & their Applications to IR 8
19 Click models... AC IM MdR Advanced Click Models & their Applications to IR 9
20 Click models... A set of events/random variables AC IM MdR Advanced Click Models & their Applications to IR 9
21 Click models... A set of events/random variables A directed graph with nodes corresponding to events and edges corresponding to dependencies between events AC IM MdR Advanced Click Models & their Applications to IR 9
22 Click models... A set of events/random variables A directed graph with nodes corresponding to events and edges corresponding to dependencies between events Conditional probabilities in the nodes of the dependency graph expressed by parameters AC IM MdR Advanced Click Models & their Applications to IR 9
23 Click models... A set of events/random variables A directed graph with nodes corresponding to events and edges corresponding to dependencies between events Conditional probabilities in the nodes of the dependency graph expressed by parameters A correspondence between the model s parameters and features of a SERP and user s query AC IM MdR Advanced Click Models & their Applications to IR 9
24 Position-based model ru uq E u A u C u document u AC IM MdR Advanced Click Models & their Applications to IR 10
25 Position-based model P(C u = 1) = P(E u = 1) P(A u = 1) P(A u = 1) = α uq P(E u = 1) = γ ru AC IM MdR Advanced Click Models & their Applications to IR 11
26 Click models for web search Random click model CTR models Position-based model Cascade model Dependent click model Dynamic Bayesian network model User browsing model AC IM MdR Advanced Click Models & their Applications to IR 12
27 Parameter estimation Maximum likelihood estimation Expectation-maximization and other AC IM MdR Advanced Click Models & their Applications to IR 13
28 Evaluation Log-likelihood Perplexity and other AC IM MdR Advanced Click Models & their Applications to IR 14
29 Afternoon block 1 Outline 1 Introduction 2 Advanced Click Models 3 Demo 4 Recap AC IM MdR Advanced Click Models & their Applications to IR 15
30 Advanced click models Aggregated search Beyond a single SERP User diversity Beyond clicks Non-linear examination Using features AC IM MdR Advanced Click Models & their Applications to IR 16
31 Aggregated search AC IM MdR Advanced Click Models & their Applications to IR 17
32 Federated click model (FCM) P(A = 1) = χ c AC IM MdR Advanced Click Models & their Applications to IR 18
33 Federated click model (FCM) P(A = 1) = χ c P(E r = 1 A = 0) = ɛ r AC IM MdR Advanced Click Models & their Applications to IR 18
34 Federated click model (FCM) P(A = 1) = χ c P(E r = 1 A = 0) = ɛ r P(E r = 1 A = 1) = ɛ r + (1 ɛ r )β dist AC IM MdR Advanced Click Models & their Applications to IR 18
35 Federated click model (FCM) P(A = 1) = χ c P(E r = 1 A = 0) = ɛ r P(E r = 1 A = 1) = ɛ r + (1 ɛ r )β dist χ c can depend on vertical rank: χ rvert vertical content: χ vert AC IM MdR Advanced Click Models & their Applications to IR 18
36 Federated click model (FCM) P(A = 1) = χ c P(E r = 1 A = 0) = ɛ r P(E r = 1 A = 1) = ɛ r + (1 ɛ r )β dist χ c can depend on vertical rank: χ rvert vertical content: χ vert dist = r u r vert can be negative AC IM MdR Advanced Click Models & their Applications to IR 18
37 Vertical-aware click model (VCM) 1 Attraction bias 2 Global bias 3 First place bias 4 Sequence bias AC IM MdR Advanced Click Models & their Applications to IR 19
38 Intent-aware click models P(C 1,..., C n ) = P(I = i) P(C 1,..., C n I = i) i AC IM MdR Advanced Click Models & their Applications to IR 20
39 Beyond a single SERP AC IM MdR Advanced Click Models & their Applications to IR 21
40 Pagination Pagination is clicked 5 10% of times AC IM MdR Advanced Click Models & their Applications to IR 22
41 Pagination Pagination is clicked 5 10% of times Should be considered as a separate clickable object AC IM MdR Advanced Click Models & their Applications to IR 22
42 Task-centric click model (TCM) P(M = 1) = µ SIGIR 2015 Santiago Chile Santiago hotels AC IM MdR Advanced Click Models & their Applications to IR 23
43 Task-centric click model (TCM) P(M = 1) = µ P(N = 1 M = 0) = 1 P(N = 1 M = 1) = ν SIGIR 2015 Santiago Chile Santiago hotels AC IM MdR Advanced Click Models & their Applications to IR 23
44 Task-centric click model (TCM) P(M = 1) = µ P(N = 1 M = 0) = 1 P(N = 1 M = 1) = ν H r = 1 previous examination of u r SIGIR 2015 Santiago Chile Santiago hotels AC IM MdR Advanced Click Models & their Applications to IR 23
45 Task-centric click model (TCM) P(M = 1) = µ P(N = 1 M = 0) = 1 P(N = 1 M = 1) = ν H r = 1 previous examination of u r P(F r = 1 H r = 0) = 1 P(F r = 1 H r = 1) = φ SIGIR 2015 Santiago Chile Santiago hotels AC IM MdR Advanced Click Models & their Applications to IR 23
46 Task-centric click model (TCM) P(M = 1) = µ P(N = 1 M = 0) = 1 P(N = 1 M = 1) = ν H r = 1 previous examination of u r P(F r = 1 H r = 0) = 1 P(F r = 1 H r = 1) = φ P(E r = 1 E <r, S <r, C <r ) = ɛ r SIGIR 2015 Santiago Chile Santiago hotels P(A r = 1) = α ur q C r = 1 M = 1, F r = 1, E r = 1, A r = 1 AC IM MdR Advanced Click Models & their Applications to IR 23
47 User diversity Picture taken from XXX. AC IM MdR Advanced Click Models & their Applications to IR 24
48 Matrix factorization click model (MFCM) Documents Documents (U) Queries α uqv Users Tensor Users (V) Queries (Q) P(A u = 1) = α uqv α uqv N ( U u Q q V v, σ 2) AC IM MdR Advanced Click Models & their Applications to IR 25
49 Other models with users UBM-user P(A u = 1) = α uq ɛ v AC IM MdR Advanced Click Models & their Applications to IR 26
50 Other models with users UBM-user P(A u = 1) = α uq ɛ v LOG-rd-user (logistic model) P(E r = 1 E r 1 = 1, C <r ) = σ (γ rr + ε v ) P(A r = 1) = σ (α ur q + ɛ v ) 1 σ(x) = 1 + e x AC IM MdR Advanced Click Models & their Applications to IR 26
51 Other models with users UBM-user P(A u = 1) = α uq ɛ v LOG-rd-user (logistic model) P(E r = 1 E r 1 = 1, C <r ) = σ (γ rr + ε v ) DIL-user (dilution model) P(A r = 1) = σ (α ur q + ɛ v ) 1 σ(x) = 1 + e x P(E r = 1 E r 1 = 1, C <r ) = (β v ) r 1 (λ v ) k (µ v ) r r P(A r = 1) = α ur qɛ v AC IM MdR Advanced Click Models & their Applications to IR 26
52 Beyond clicks AC IM MdR Advanced Click Models & their Applications to IR 27
53 Mousing and scrolling P(E r = 1 h H : r r h ) = 1 H set of hovered documents AC IM MdR Advanced Click Models & their Applications to IR 28
54 Mousing and scrolling P(E r = 1 h H : r r h ) = 1 P(E r = 1 r V ) = 1 H set of hovered documents V set of shown documents AC IM MdR Advanced Click Models & their Applications to IR 28
55 2) which is usually remembered by users, they carefully read and comprehend the results selected from Stage 1 and based on the reading, decide whether to click on it or not. In Figure 1, the user's examination on the third result might come into Stage 2, and the user remembers that it has been read. Introduction Advanced Click Models Demo Recap From skimming to reading Figure 1. A user's eye fixation sequence and the corresponding explicit feedback on result reading for top results in a search session of query 学雷锋作文 " (Essays on learning from Lei Feng in Chinese). Radius of circle means fixation length. Our proposed two-stage examination model and the choice of two stages are inspired by the attention selection mechanism [33] which is widely accepted in cognitive psychology studies. It says that human attention consists of two functionally independent, hierarchical stages: An early, pre-attentive stage (similar to Stage 1) that operates without capacity limitation and in parallel across the entire visual field, followed by a later, attentive limited-capacity stage (similar to Stage 2) that can deal with only one item (or at most a few items) at a time. Attention selection is one of the basic Picture taken from Y. Liu, C. Wang, K. Zhou, J. Nie, M. Zhang, and S. Ma. From skimming to reading: A two-stage examination model for web search. In CIKM, ACM Press. some concluding 2. RELAT Two lines of re current endeavo from the user s further in this lin we propose a focuses on the and exploits mou We follow this li for relevance est 2.1 Eye-tra The application a considerable industry. Eye-tr real-time eye understand how Granka et al. [1 use eye-tracking and sequence p found that the d closely related to into how user's intents. Wang e result appearanc behavior for Navalpakkam et AC IM MdR Advanced Click Models & their Applications to IR 29
56 2) which is usually remembered by users, they carefully read and comprehend the results selected from Stage 1 and based on the reading, decide whether to click on it or not. In Figure 1, the user's examination on the third result might come into Stage 2, and the user remembers that it has been read. Introduction Advanced Click Models Demo Recap From skimming to reading Figure 1. A user's eye fixation sequence and the corresponding explicit feedback on result reading for top results in a search session of query 学雷锋作文 " (Essays on learning from Lei Feng in Chinese). Radius of circle means fixation length. P(C u = 1) = P(C u = 1 R u = 1) P(R u = 1 F u = 1) P(F u = 1) Our proposed two-stage examination model and the choice of two stages are inspired by the attention selection mechanism [33] which is widely accepted in cognitive psychology studies. It says that human attention consists of two functionally independent, hierarchical stages: An early, pre-attentive stage (similar to Stage 1) that operates without capacity limitation and in parallel across the entire visual field, followed by a later, attentive limited-capacity stage (similar to Stage 2) that can deal with only one item (or at most a few items) at a time. Attention selection is one of the basic R u reading (examining) a document F u fixing eyes on a document Picture taken from Y. Liu, C. Wang, K. Zhou, J. Nie, M. Zhang, and S. Ma. From skimming to reading: A two-stage examination model for web search. In CIKM, ACM Press. some concluding 2. RELAT Two lines of re current endeavo from the user s further in this lin we propose a focuses on the and exploits mou We follow this li for relevance est 2.1 Eye-tra The application a considerable industry. Eye-tr real-time eye understand how Granka et al. [1 use eye-tracking and sequence p found that the d closely related to into how user's intents. Wang e result appearanc behavior for Navalpakkam et AC IM MdR Advanced Click Models & their Applications to IR 29
57 position Predicting mouse movements ed to examinao layouts. Figure 5: Probability of starting at di erent rank positions based on mouse-tracking data. inear scan user f partially obnon-sequential ly very close to OM model asto novel page uru present a but limit anal- [28]. a fundamental e design. Logploited to imticated models ion include asattractiveness existing SERP formation, our odels to incorodels of visual visual salience sely related to n s r h a n s r h a (a) Linear Scan n s r h a n s r h a (b) Actual Mousing Figure 6: Hinton diagrams representing the probability of transitioning between pairs page modules, including the ten algorithmic results as well as navigational modules (n), query suggestion (s), related searches (r), search history (h), and advertisements (a). Each row shows the conditional distribution of the second position (column id) given the first position (row id). Figure 6(a) reflects the transition probabilities assumed under the linear scan assumption. Figure 6(b) displaying the empirical transition probabilities from Picture taken from F. Diaz, R.W. White, G. Buscher, and D. Liebling. Robust models of mouse movement on dynamic web search results pages. In CIKM, ACM Press AC IM MdR Advanced Click Models & their Applications to IR 30
58 position Predicting mouse movements ed to examinao layouts. Figure 5: Probability of starting at di erent rank positions based on mouse-tracking data. inear scan user f partially obnon-sequential ly very close to OM model asto novel page uru present a but limit anal- [28]. a fundamental e design. Logploited to imticated models ion include asattractiveness existing SERP formation, our odels to incorodels of visual visual salience sely related to n s r h a n s r h a (a) Linear Scan n s r h a n s r h a (b) Actual Mousing Figure 6: Hinton diagrams representing the probability of transitioning between pairs page modules, including the ten algorithmic results as well as navigational modules (n), query suggestion (s), related searches (r), search history (h), and advertisements (a). Each row shows the conditional distribution of the second position (column id) given the first position (row id). Figure 6(a) reflects the transition probabilities assumed under the linear scan assumption. Figure 6(b) displaying the empirical transition probabilities from Estimate the probability of mousing element j after element i Picture taken from F. Diaz, R.W. White, G. Buscher, and D. Liebling. Robust models of mouse movement on dynamic web search results pages. In CIKM, ACM Press AC IM MdR Advanced Click Models & their Applications to IR 30
59 position Predicting mouse movements ed to examinao layouts. Figure 5: Probability of starting at di erent rank positions based on mouse-tracking data. inear scan user f partially obnon-sequential ly very close to OM model asto novel page uru present a but limit anal- [28]. a fundamental e design. Logploited to imticated models ion include asattractiveness existing SERP formation, our odels to incorodels of visual visual salience sely related to n s r h a n s r h a (a) Linear Scan n s r h a n s r h a (b) Actual Mousing Figure 6: Hinton diagrams representing the probability of transitioning between pairs page modules, including the ten algorithmic results as well as navigational modules (n), query suggestion (s), related searches (r), search history (h), and advertisements (a). Each row shows the conditional distribution of the second position (column id) given the first position (row id). Figure 6(a) reflects the transition probabilities assumed under the linear scan assumption. Figure 6(b) displaying the empirical transition probabilities from Estimate the probability of mousing element j after element i Use Maximum Likelihood Estimation and Farley-Ring Model Picture taken from F. Diaz, R.W. White, G. Buscher, and D. Liebling. Robust models of mouse movement on dynamic web search results pages. In CIKM, ACM Press AC IM MdR Advanced Click Models & their Applications to IR 30
60 Noise-aware click model (NCM) P(C r = 1 E r = 1, R r = 1, N r = 0) = α ur q P(C r = 1 E r = 1, R r = 0, N r = 0) = 0 R relevance AC IM MdR Advanced Click Models & their Applications to IR 31
61 Noise-aware click model (NCM) P(C r = 1 E r = 1, R r = 1, N r = 0) = α ur q P(C r = 1 E r = 1, R r = 0, N r = 0) = 0 P(C r = 1 E r = 1, N r = 1) = β q R relevance N noisy environment AC IM MdR Advanced Click Models & their Applications to IR 31
62 Non-linear examination t (c) Mouse Data Picture taken from F. Diaz, R.W. White, G. Buscher, and D. Liebling. Robust models of mouse movement on dynamic web search results pages. In CIKM, ACM Press AC IM MdR Advanced Click Models & their Applications to IR 32
63 Click models for aggregated search AC IM MdR Advanced Click Models & their Applications to IR 33
64 Temporal click models POM-based click models User actions as a Markov chain Temporal information in search logs AC IM MdR Advanced Click Models & their Applications to IR 34
65 Temporal click models POM-based click models User actions as a Markov chain Temporal information in search logs Temporal Hidden Click Model (THCM) P(E r+1 = 1 E r = 1) = α P(E r 1 = 1 E r = 1) = γ AC IM MdR Advanced Click Models & their Applications to IR 34
66 Temporal click models POM-based click models User actions as a Markov chain Temporal information in search logs Temporal Hidden Click Model (THCM) P(E r+1 = 1 E r = 1) = α P(E r 1 = 1 E r = 1) = γ Partially Sequential Click Model (PSCM) Between adjacent clicks users examine results in a single direction Users can skip results without examining them AC IM MdR Advanced Click Models & their Applications to IR 34
67 Whole-page click model (WPC) Search 1 1 encyclopedia ram that prints -dates the age ages... ren of all ages any language cement to any orld World for free Hello World Software Buy hello world Transitions between blocks 5 (macro-model) are modeled as a Markov 6 chain e idea of Hello ing English in as that Search 9 9 tion (b) Arrangement (c) Mouse Data representation of mouse-tracking data. The session sequence for this data wou Picture taken from F. Diaz, R.W. White, G. Buscher, and D. Liebling. Robust models of mouse movement on dynamic web search results pages. In CIKM, ACM Press m 0 m 0 AC IM MdR Advanced Click Models & their Applications to IR m 35 m 1
68 Whole-page click model (WPC) Search 1 1 encyclopedia ram that prints -dates the age ages... ren of all ages any language cement to any orld World for free e idea of Hello ing English in as that... Hello World Software Buy hello world Transitions between blocks 5 (macro-model) are modeled as a Markov 6 chain Behavior within a block 7 (micro-model) is modeled using standard 8 click models Search 9 9 tion (b) Arrangement (c) Mouse Data representation of mouse-tracking data. The session sequence for this data wou Picture taken from F. Diaz, R.W. White, G. Buscher, and D. Liebling. Robust models of mouse movement on dynamic web search results pages. In CIKM, ACM Press m 0 m 0 AC IM MdR Advanced Click Models & their Applications to IR m 35 m 1
69 Using features AC IM MdR Advanced Click Models & their Applications to IR 36
70 Using features 290 Benchmarking Learning-to-Rank Algorithms For the Gov corpus, 64 features were extracted for each query document pair, as shown in Table 6.2. For the OHSUMED corpus, 40 features were extracted in total, as shown in Table 6.3. Table 6.2 Learning features of TREC. ID Feature description 1 Term frequency (TF) of body 2 TF of anchor 3 TF of title 4 TF of URL 5 TF of whole document 6 Inverse document frequency (IDF) of body 7 IDF of anchor 8 IDF of title 9 IDF of URL 10 IDF of whole document 11 TF*IDF of body 12 TF*IDF of anchor 13 TF*IDF of title 14 TF*IDF of URL 15 TF*IDF of whole document 16 Document length (DL) of body 17 DL of anchor 18 DL of title 19 DL of URL 20 DL of whole document 21 BM25 of body 22 BM25 of anchor 23 BM25 of title 24 BM25 of URL 25 BM25 of whole document 26 LMIR.ABS of body 27 LMIR.ABS of anchor 28 LMIR.ABS of title 29 LMIR.ABS of URL 30 LMIR.ABS of whole document 31 LMIR.DIR of body AC IM MdR Advanced 32 Click LMIR.DIR Models of anchor & their Applications to IR 36
71 Regression-based click models P(C u = 1) = e Z Z = w i f i AC IM MdR Advanced Click Models & their Applications to IR 37
72 Regression-based click models P(C u = 1) = e Z Z = w i f i Factorization machines AC IM MdR Advanced Click Models & their Applications to IR 37
73 Regression-based click models P(C u = 1) = e Z Z = w i f i Factorization machines Neural networks (for click prediction in sponsored search) AC IM MdR Advanced Click Models & their Applications to IR 37
74 General click model (GCM) Click model parameters can depend on other attributes (e.g., time of the day, user browser, length of a URL, etc.) P(C r = 1 E r = 1) = P i θ f user i + j θ f url j + ɛ > 0 AC IM MdR Advanced Click Models & their Applications to IR 38
75 General click model (GCM) Click model parameters can depend on other attributes (e.g., time of the day, user browser, length of a URL, etc.) P(C r = 1 E r = 1) = P i θ f user i + j θ f url j + ɛ > 0 CM, DCM, CCM and DBN can be considered as special cases of GCM AC IM MdR Advanced Click Models & their Applications to IR 38
76 Afternoon block 1 Outline 1 Introduction 2 Advanced Click Models 3 Demo 4 Recap AC IM MdR Advanced Click Models & their Applications to IR 39
77 Live demo: Building an advanced click model Demo AC IM MdR Advanced Click Models & their Applications to IR 40
78 Setup AC IM MdR Advanced Click Models & their Applications to IR 41
79 Data and tools Publicly-available click log from Yandex (Relevance Prediction Challenge 2011) AC IM MdR Advanced Click Models & their Applications to IR 42
80 Data and tools Publicly-available click log from Yandex (Relevance Prediction Challenge 2011) PyClick an open-source Python library of click models for web search AC IM MdR Advanced Click Models & their Applications to IR 42
81 Task-centric click model (TCM) P(M = 1) = µ SIGIR 2015 Santiago Chile Santiago hotels AC IM MdR Advanced Click Models & their Applications to IR 43
82 Task-centric click model (TCM) P(M = 1) = µ P(N = 1 M = 0) = 1 P(N = 1 M = 1) = ν SIGIR 2015 Santiago Chile Santiago hotels AC IM MdR Advanced Click Models & their Applications to IR 43
83 Task-centric click model (TCM) P(M = 1) = µ P(N = 1 M = 0) = 1 P(N = 1 M = 1) = ν H r = 1 previous examination of u r SIGIR 2015 Santiago Chile Santiago hotels AC IM MdR Advanced Click Models & their Applications to IR 43
84 Task-centric click model (TCM) P(M = 1) = µ P(N = 1 M = 0) = 1 P(N = 1 M = 1) = ν H r = 1 previous examination of u r P(F r = 1 H r = 0) = 1 P(F r = 1 H r = 1) = φ SIGIR 2015 Santiago Chile Santiago hotels AC IM MdR Advanced Click Models & their Applications to IR 43
85 Task-centric click model (TCM) P(M = 1) = µ P(N = 1 M = 0) = 1 P(N = 1 M = 1) = ν H r = 1 previous examination of u r P(F r = 1 H r = 0) = 1 P(F r = 1 H r = 1) = φ P(E r = 1 E <r, S <r, C <r ) = ɛ r SIGIR 2015 Santiago Chile Santiago hotels P(A r = 1) = α ur q C r = 1 M = 1, F r = 1, E r = 1, A r = 1 AC IM MdR Advanced Click Models & their Applications to IR 43
86 Task-centric click model (TCM) P(M = 1) = µ P(N = 1 M = 0) = 1 P(N = 1 M = 1) = ν H r = 1 previous occurence of u r P(F r = 1 H r = 0) = 1 P(F r = 1 H r = 1) = φ P(E r = 1 E <r, S <r, C <r ) = ɛ r SIGIR 2015 Santiago Chile Santiago hotels P(A r = 1) = α ur q C r = 1 M = 1, F r = 1, E r = 1, A r = 1 AC IM MdR Advanced Click Models & their Applications to IR 43
87 Demo starting point TCM class copied from PBM Basic experiment Load the train and test data Train TCM Test TCM Additional classes explained during the demo AC IM MdR Advanced Click Models & their Applications to IR 44
88 Preliminaries AC IM MdR Advanced Click Models & their Applications to IR 45
89 Preliminaries AC IM MdR Advanced Click Models & their Applications to IR 45
90 Preliminaries 1 Initial run (a) Load data and train the model (b) Get the same output as for PBM, save the output 2 Switch from single query sessions to search tasks (a) Extend SearchSession into TaskCentricSearchSession (b) Create SearchTask (c) Extend the data loading procedure, re-load data (d) Output the number of search tasks 3 Train on search tasks (a) Pass search tasks to TCM.train() (b) Get an error 4 Implement new inference (a) Create TaskCentricInference as a subclass of EMInference (b) Pass a search task into Param.update() (c) Use the new inference in TCM, re-run training (d) Get the same output as for PBM (compare with the previously saved output) AC IM MdR Advanced Click Models & their Applications to IR 46
91 Afternoon block 1 Outline 1 Introduction 2 Advanced Click Models 3 Demo 4 Recap AC IM MdR Advanced Click Models & their Applications to IR 47
92 Afternoon block 1 Recap A very quick introduction to click models A landscape of advanced click models Demo AC IM MdR Advanced Click Models & their Applications to IR 48
93 Afternoon block 1 Recap A very quick introduction to click models A landscape of advanced click models Demo After the break Demo (cont d) Invited talk Applications Future directions AC IM MdR Advanced Click Models & their Applications to IR 48
94 Acknowledgments All content represents the opinion of the authors which is not necessarily shared or endorsed by their respective employers and/or sponsors. AC IM MdR Advanced Click Models & their Applications to IR 49
Click Models for Web Search
Authors version * i Click Models for Web Search Aleksandr Chuklin University of Amsterdam and Google Switzerland Ilya Markov University of Amsterdam Maarten de Rijke University of Amsterdam * The final
More informationTime-Aware Click Model
0 Time-Aware Click Model YIQUN LIU, Tsinghua University XIAOHUI XIE, Tsinghua University CHAO WANG, Tsinghua University JIAN-YUN NIE, Université de Montréal MIN ZHANG, Tsinghua University SHAOPING MA,
More informationA Comparative Study of Click Models for Web Search
A Comparative Study of Click Models for Web Search Artem Grotov, Aleksandr Chuklin, Ilya Markov Luka Stout, Finde Xumara, and Maarten de Rijke University of Amsterdam, Amsterdam, The Netherlands {a.grotov,a.chuklin,i.markov}@uva.nl,
More informationEstimating Credibility of User Clicks with Mouse Movement and Eye-tracking Information
Estimating Credibility of User Clicks with Mouse Movement and Eye-tracking Information Jiaxin Mao, Yiqun Liu, Min Zhang, Shaoping Ma Department of Computer Science and Technology, Tsinghua University Background
More informationInformation Retrieval
Information Retrieval Learning to Rank Ilya Markov i.markov@uva.nl University of Amsterdam Ilya Markov i.markov@uva.nl Information Retrieval 1 Course overview Offline Data Acquisition Data Processing Data
More informationA Neural Click Model for Web Search
A Neural Click Model for Web Search Alexey Borisov, Ilya Markov Maarten de Rijke Pavel Serdyukov alborisov@yandex-team.ru i.markov@uva.nl derijke@uva.nl pavser@yandex-team.ru Yandex, Moscow, Russia University
More informationInfluence of Vertical Result in Web Search Examination
Influence of Vertical Result in Web Search Examination Zeyang Liu, Yiqun Liu, Ke Zhou, Min Zhang, Shaoping Ma Tsinghua National Laboratory for Information Science and Technology, Department of Computer
More informationRobust Relevance-Based Language Models
Robust Relevance-Based Language Models Xiaoyan Li Department of Computer Science, Mount Holyoke College 50 College Street, South Hadley, MA 01075, USA Email: xli@mtholyoke.edu ABSTRACT We propose a new
More informationAdvanced Topics in Information Retrieval. Learning to Rank. ATIR July 14, 2016
Advanced Topics in Information Retrieval Learning to Rank Vinay Setty vsetty@mpi-inf.mpg.de Jannik Strötgen jannik.stroetgen@mpi-inf.mpg.de ATIR July 14, 2016 Before we start oral exams July 28, the full
More informationUser behavior modeling for better Web search ranking
Front. Comput. Sci. DOI 10.1007/s11704-017-6518-6 User behavior modeling for better Web search ranking Yiqun LIU, Chao WANG, Min ZHANG, Shaoping MA Department of Computer Science and Technology, Tsinghua
More informationCharacterizing Search Intent Diversity into Click Models
Characterizing Search Intent Diversity into Click Models Botao Hu 1,2, Yuchen Zhang 1,2, Weizhu Chen 2,3, Gang Wang 2, Qiang Yang 3 Institute for Interdisciplinary Information Sciences, Tsinghua University,
More informationA Dynamic Bayesian Network Click Model for Web Search Ranking
A Dynamic Bayesian Network Click Model for Web Search Ranking Olivier Chapelle and Anne Ya Zhang Apr 22, 2009 18th International World Wide Web Conference Introduction Motivation Clicks provide valuable
More informationEffective Latent Space Graph-based Re-ranking Model with Global Consistency
Effective Latent Space Graph-based Re-ranking Model with Global Consistency Feb. 12, 2009 1 Outline Introduction Related work Methodology Graph-based re-ranking model Learning a latent space graph A case
More informationA Noise-aware Click Model for Web Search
A Noise-aware Click Model for Web Search Weizhu Chen Microsoft Research Asia wzchen@microsoft.com Zheng Chen Microsoft Research Asia zhengc@microsoft.com Dong Wang Microsoft Research Asia dongw89@gmail.com
More informationHow Do Sponsored Search Results Affect User Behavior in Web Search?
How Do Sponsored Search Results Affect User Behavior in Web Search? Zeyang Liu, Yiqun Liu 1, Min Zhang, and Shaoping Ma State Key Laboratory of Intelligent Technology and Systems, Tsinghua National Laboratory
More informationTowards Predicting Web Searcher Gaze Position from Mouse Movements
Towards Predicting Web Searcher Gaze Position from Mouse Movements Qi Guo Emory University 400 Dowman Dr., W401 Atlanta, GA 30322 USA qguo3@emory.edu Eugene Agichtein Emory University 400 Dowman Dr., W401
More informationGraphical Models, Bayesian Method, Sampling, and Variational Inference
Graphical Models, Bayesian Method, Sampling, and Variational Inference With Application in Function MRI Analysis and Other Imaging Problems Wei Liu Scientific Computing and Imaging Institute University
More informationA new click model for relevance prediction in web search
A new click model for relevance prediction in web search Alexander Fishkov 1 and Sergey Nikolenko 2,3 1 St. Petersburg State Polytechnical University jetsnguns@gmail.com 2 Steklov Mathematical Institute,
More informationEntity and Knowledge Base-oriented Information Retrieval
Entity and Knowledge Base-oriented Information Retrieval Presenter: Liuqing Li liuqing@vt.edu Digital Library Research Laboratory Virginia Polytechnic Institute and State University Blacksburg, VA 24061
More informationConstructing Click Models for Mobile Search
Constructing Click Models for Mobile Search Jiaxin Mao, Cheng Luo, Min Zhang, and Shaoping Ma Department of Computer Science and Technology, Beijing National Research Center for Information Science and
More informationA Few Things to Know about Machine Learning for Web Search
AIRS 2012 Tianjin, China Dec. 19, 2012 A Few Things to Know about Machine Learning for Web Search Hang Li Noah s Ark Lab Huawei Technologies Talk Outline My projects at MSRA Some conclusions from our research
More informationMultimodal topic model for texts and images utilizing their embeddings
Multimodal topic model for texts and images utilizing their embeddings Nikolay Smelik, smelik@rain.ifmo.ru Andrey Filchenkov, afilchenkov@corp.ifmo.ru Computer Technologies Lab IDP-16. Barcelona, Spain,
More informationLink Analysis and Web Search
Link Analysis and Web Search Moreno Marzolla Dip. di Informatica Scienza e Ingegneria (DISI) Università di Bologna http://www.moreno.marzolla.name/ based on material by prof. Bing Liu http://www.cs.uic.edu/~liub/webminingbook.html
More informationAnalysis of Trail Algorithms for User Search Behavior
Analysis of Trail Algorithms for User Search Behavior Surabhi S. Golechha, Prof. R.R. Keole Abstract Web log data has been the basis for analyzing user query session behavior for a number of years. Web
More informationLearning Ranking Functions with SVMs
Learning Ranking Functions with SVMs CS4780/5780 Machine Learning Fall 2012 Thorsten Joachims Cornell University T. Joachims, Optimizing Search Engines Using Clickthrough Data, Proceedings of the ACM Conference
More informationMining Web Data. Lijun Zhang
Mining Web Data Lijun Zhang zlj@nju.edu.cn http://cs.nju.edu.cn/zlj Outline Introduction Web Crawling and Resource Discovery Search Engine Indexing and Query Processing Ranking Algorithms Recommender Systems
More informationCSE 258. Web Mining and Recommender Systems. Advanced Recommender Systems
CSE 258 Web Mining and Recommender Systems Advanced Recommender Systems This week Methodological papers Bayesian Personalized Ranking Factorizing Personalized Markov Chains Personalized Ranking Metric
More informationRisk Minimization and Language Modeling in Text Retrieval Thesis Summary
Risk Minimization and Language Modeling in Text Retrieval Thesis Summary ChengXiang Zhai Language Technologies Institute School of Computer Science Carnegie Mellon University July 21, 2002 Abstract This
More informationLetter Pair Similarity Classification and URL Ranking Based on Feedback Approach
Letter Pair Similarity Classification and URL Ranking Based on Feedback Approach P.T.Shijili 1 P.G Student, Department of CSE, Dr.Nallini Institute of Engineering & Technology, Dharapuram, Tamilnadu, India
More informationRetrieval Evaluation. Hongning Wang
Retrieval Evaluation Hongning Wang CS@UVa What we have learned so far Indexed corpus Crawler Ranking procedure Research attention Doc Analyzer Doc Rep (Index) Query Rep Feedback (Query) Evaluation User
More informationWeb Information Retrieval using WordNet
Web Information Retrieval using WordNet Jyotsna Gharat Asst. Professor, Xavier Institute of Engineering, Mumbai, India Jayant Gadge Asst. Professor, Thadomal Shahani Engineering College Mumbai, India ABSTRACT
More informationEvaluating the Accuracy of. Implicit feedback. from Clicks and Query Reformulations in Web Search. Learning with Humans in the Loop
Evaluating the Accuracy of Implicit Feedback from Clicks and Query Reformulations in Web Search Thorsten Joachims, Filip Radlinski, Geri Gay, Laura Granka, Helene Hembrooke, Bing Pang Department of Computer
More informationAdaptive Search Engines Learning Ranking Functions with SVMs
Adaptive Search Engines Learning Ranking Functions with SVMs CS478/578 Machine Learning Fall 24 Thorsten Joachims Cornell University T. Joachims, Optimizing Search Engines Using Clickthrough Data, Proceedings
More informationUMass at TREC 2017 Common Core Track
UMass at TREC 2017 Common Core Track Qingyao Ai, Hamed Zamani, Stephen Harding, Shahrzad Naseri, James Allan and W. Bruce Croft Center for Intelligent Information Retrieval College of Information and Computer
More informationCURIOUS BROWSERS: Automated Gathering of Implicit Interest Indicators by an Instrumented Browser
CURIOUS BROWSERS: Automated Gathering of Implicit Interest Indicators by an Instrumented Browser David Brown Mark Claypool Computer Science Department Worcester Polytechnic Institute Worcester, MA 01609,
More informationWhere Next? Data Mining Techniques and Challenges for Trajectory Prediction. Slides credit: Layla Pournajaf
Where Next? Data Mining Techniques and Challenges for Trajectory Prediction Slides credit: Layla Pournajaf o Navigational services. o Traffic management. o Location-based advertising. Source: A. Monreale,
More informationIdentifying Web Spam With User Behavior Analysis
Identifying Web Spam With User Behavior Analysis Yiqun Liu, Rongwei Cen, Min Zhang, Shaoping Ma, Liyun Ru State Key Lab of Intelligent Tech. & Sys. Tsinghua University 2008/04/23 Introduction simple math
More informationDescribable Visual Attributes for Face Verification and Image Search
Advanced Topics in Multimedia Analysis and Indexing, Spring 2011, NTU. 1 Describable Visual Attributes for Face Verification and Image Search Kumar, Berg, Belhumeur, Nayar. PAMI, 2011. Ryan Lei 2011/05/05
More informationQuery Likelihood with Negative Query Generation
Query Likelihood with Negative Query Generation Yuanhua Lv Department of Computer Science University of Illinois at Urbana-Champaign Urbana, IL 61801 ylv2@uiuc.edu ChengXiang Zhai Department of Computer
More informationSearch Engines. Information Retrieval in Practice
Search Engines Information Retrieval in Practice All slides Addison Wesley, 2008 Beyond Bag of Words Bag of Words a document is considered to be an unordered collection of words with no relationships Extending
More informationCHAPTER THREE INFORMATION RETRIEVAL SYSTEM
CHAPTER THREE INFORMATION RETRIEVAL SYSTEM 3.1 INTRODUCTION Search engine is one of the most effective and prominent method to find information online. It has become an essential part of life for almost
More informationGraphical Models & HMMs
Graphical Models & HMMs Henrik I. Christensen Robotics & Intelligent Machines @ GT Georgia Institute of Technology, Atlanta, GA 30332-0280 hic@cc.gatech.edu Henrik I. Christensen (RIM@GT) Graphical Models
More informationLearning Ranking Functions with SVMs
Learning Ranking Functions with SVMs CS4780/5780 Machine Learning Fall 2014 Thorsten Joachims Cornell University T. Joachims, Optimizing Search Engines Using Clickthrough Data, Proceedings of the ACM Conference
More informationConditional Random Fields and beyond D A N I E L K H A S H A B I C S U I U C,
Conditional Random Fields and beyond D A N I E L K H A S H A B I C S 5 4 6 U I U C, 2 0 1 3 Outline Modeling Inference Training Applications Outline Modeling Problem definition Discriminative vs. Generative
More informationMethods for Intelligent Systems
Methods for Intelligent Systems Lecture Notes on Clustering (II) Davide Eynard eynard@elet.polimi.it Department of Electronics and Information Politecnico di Milano Davide Eynard - Lecture Notes on Clustering
More informationDifferent Users, Different Opinions: Predicting Search Satisfaction with Mouse Movement Information
Different Users, Different Opinions: Predicting Search Satisfaction with Mouse Movement Information Yiqun Liu, Ye Chen, Jinhui Tang, Jiashen Sun, Min Zhang, Shaoping Ma, Xuan Zhu Tsinghua National Laboratory
More informationAutomatic Selection of Compiler Options Using Non-parametric Inferential Statistics
Automatic Selection of Compiler Options Using Non-parametric Inferential Statistics Masayo Haneda Peter M.W. Knijnenburg Harry A.G. Wijshoff LIACS, Leiden University Motivation An optimal compiler optimization
More informationVideo annotation based on adaptive annular spatial partition scheme
Video annotation based on adaptive annular spatial partition scheme Guiguang Ding a), Lu Zhang, and Xiaoxu Li Key Laboratory for Information System Security, Ministry of Education, Tsinghua National Laboratory
More informationCSCI 599: Applications of Natural Language Processing Information Retrieval Evaluation"
CSCI 599: Applications of Natural Language Processing Information Retrieval Evaluation" All slides Addison Wesley, Donald Metzler, and Anton Leuski, 2008, 2012! Evaluation" Evaluation is key to building
More information08 An Introduction to Dense Continuous Robotic Mapping
NAVARCH/EECS 568, ROB 530 - Winter 2018 08 An Introduction to Dense Continuous Robotic Mapping Maani Ghaffari March 14, 2018 Previously: Occupancy Grid Maps Pose SLAM graph and its associated dense occupancy
More informationBasic techniques. Text processing; term weighting; vector space model; inverted index; Web Search
Basic techniques Text processing; term weighting; vector space model; inverted index; Web Search Overview Indexes Query Indexing Ranking Results Application Documents User Information analysis Query processing
More informationOutline. Possible solutions. The basic problem. How? How? Relevance Feedback, Query Expansion, and Inputs to Ranking Beyond Similarity
Outline Relevance Feedback, Query Expansion, and Inputs to Ranking Beyond Similarity Lecture 10 CS 410/510 Information Retrieval on the Internet Query reformulation Sources of relevance for feedback Using
More informationWebSci and Learning to Rank for IR
WebSci and Learning to Rank for IR Ernesto Diaz-Aviles L3S Research Center. Hannover, Germany diaz@l3s.de Ernesto Diaz-Aviles www.l3s.de 1/16 Motivation: Information Explosion Ernesto Diaz-Aviles
More informationA Survey on Postive and Unlabelled Learning
A Survey on Postive and Unlabelled Learning Gang Li Computer & Information Sciences University of Delaware ligang@udel.edu Abstract In this paper we survey the main algorithms used in positive and unlabeled
More informationA Deep Relevance Matching Model for Ad-hoc Retrieval
A Deep Relevance Matching Model for Ad-hoc Retrieval Jiafeng Guo 1, Yixing Fan 1, Qingyao Ai 2, W. Bruce Croft 2 1 CAS Key Lab of Web Data Science and Technology, Institute of Computing Technology, Chinese
More informationLecture 3: Improving Ranking with
Modeling User Behavior and Interactions Lecture 3: Improving Ranking with Behavior Data 1 * &!" ) & $ & 6+ $ & 6+ + "& & 8 > " + & 2 Lecture 3 Plan $ ( ' # $ #! & $ #% #"! #! -( #", # + 4 / 0 3 21 0 /
More informationEvaluating Aggregated Search Using Interleaving
Evaluating Aggregated Search Using Interleaving Aleksandr Chuklin Yandex & ISLA, University of Amsterdam Moscow, Russia a.chuklin@uva.nl Pavel Serdyukov Yandex Moscow, Russia pavser@yandex-team.ru Anne
More informationCSCI 599: Applications of Natural Language Processing Information Retrieval Retrieval Models (Part 1)"
CSCI 599: Applications of Natural Language Processing Information Retrieval Retrieval Models (Part 1)" All slides Addison Wesley, Donald Metzler, and Anton Leuski, 2008, 2012! Retrieval Models" Provide
More informationDATA MINING II - 1DL460. Spring 2014"
DATA MINING II - 1DL460 Spring 2014" A second course in data mining http://www.it.uu.se/edu/course/homepage/infoutv2/vt14 Kjell Orsborn Uppsala Database Laboratory Department of Information Technology,
More informationEnd-to-End Neural Ad-hoc Ranking with Kernel Pooling
End-to-End Neural Ad-hoc Ranking with Kernel Pooling Chenyan Xiong 1,Zhuyun Dai 1, Jamie Callan 1, Zhiyuan Liu, and Russell Power 3 1 :Language Technologies Institute, Carnegie Mellon University :Tsinghua
More informationDisambiguating Search by Leveraging a Social Context Based on the Stream of User s Activity
Disambiguating Search by Leveraging a Social Context Based on the Stream of User s Activity Tomáš Kramár, Michal Barla and Mária Bieliková Faculty of Informatics and Information Technology Slovak University
More informationChapter 27 Introduction to Information Retrieval and Web Search
Chapter 27 Introduction to Information Retrieval and Web Search Copyright 2011 Pearson Education, Inc. Publishing as Pearson Addison-Wesley Chapter 27 Outline Information Retrieval (IR) Concepts Retrieval
More informationUniversity of Virginia Department of Computer Science. CS 4501: Information Retrieval Fall 2015
University of Virginia Department of Computer Science CS 4501: Information Retrieval Fall 2015 5:00pm-6:15pm, Monday, October 26th Name: ComputingID: This is a closed book and closed notes exam. No electronic
More informationDeep Learning Basic Lecture - Complex Systems & Artificial Intelligence 2017/18 (VO) Asan Agibetov, PhD.
Deep Learning 861.061 Basic Lecture - Complex Systems & Artificial Intelligence 2017/18 (VO) Asan Agibetov, PhD asan.agibetov@meduniwien.ac.at Medical University of Vienna Center for Medical Statistics,
More informationJames Mayfield! The Johns Hopkins University Applied Physics Laboratory The Human Language Technology Center of Excellence!
James Mayfield! The Johns Hopkins University Applied Physics Laboratory The Human Language Technology Center of Excellence! (301) 219-4649 james.mayfield@jhuapl.edu What is Information Retrieval? Evaluation
More informationMining the Search Trails of Surfing Crowds: Identifying Relevant Websites from User Activity Data
Mining the Search Trails of Surfing Crowds: Identifying Relevant Websites from User Activity Data Misha Bilenko and Ryen White presented by Matt Richardson Microsoft Research Search = Modeling User Behavior
More informationUMass at TREC 2006: Enterprise Track
UMass at TREC 2006: Enterprise Track Desislava Petkova and W. Bruce Croft Center for Intelligent Information Retrieval Department of Computer Science University of Massachusetts, Amherst, MA 01003 Abstract
More informationUsing Gini-index for Feature Weighting in Text Categorization
Journal of Computational Information Systems 9: 14 (2013) 5819 5826 Available at http://www.jofcis.com Using Gini-index for Feature Weighting in Text Categorization Weidong ZHU 1,, Yongmin LIN 2 1 School
More informationRanking with Query-Dependent Loss for Web Search
Ranking with Query-Dependent Loss for Web Search Jiang Bian 1, Tie-Yan Liu 2, Tao Qin 2, Hongyuan Zha 1 Georgia Institute of Technology 1 Microsoft Research Asia 2 Outline Motivation Incorporating Query
More informationTriRank: Review-aware Explainable Recommendation by Modeling Aspects
TriRank: Review-aware Explainable Recommendation by Modeling Aspects Xiangnan He, Tao Chen, Min-Yen Kan, Xiao Chen National University of Singapore Presented by Xiangnan He CIKM 15, Melbourne, Australia
More informationRelevance Feedback and Query Reformulation. Lecture 10 CS 510 Information Retrieval on the Internet Thanks to Susan Price. Outline
Relevance Feedback and Query Reformulation Lecture 10 CS 510 Information Retrieval on the Internet Thanks to Susan Price IR on the Internet, Spring 2010 1 Outline Query reformulation Sources of relevance
More informationIn the Mood to Click? Towards Inferring Receptiveness to Search Advertising
In the Mood to Click? Towards Inferring Receptiveness to Search Advertising Qi Guo Eugene Agichtein Mathematics & Computer Science Department Emory University Atlanta, USA {qguo3,eugene}@mathcs.emory.edu
More informationImproving Stack Overflow Tag Prediction Using Eye Tracking Alina Lazar Youngstown State University Bonita Sharif, Youngstown State University
Improving Stack Overflow Tag Prediction Using Eye Tracking Alina Lazar, Youngstown State University Bonita Sharif, Youngstown State University Jenna Wise, Youngstown State University Alyssa Pawluk, Youngstown
More informationLecture 21 : A Hybrid: Deep Learning and Graphical Models
10-708: Probabilistic Graphical Models, Spring 2018 Lecture 21 : A Hybrid: Deep Learning and Graphical Models Lecturer: Kayhan Batmanghelich Scribes: Paul Liang, Anirudha Rayasam 1 Introduction and Motivation
More informationInteraction Model to Predict Subjective Specificity of Search Results
Interaction Model to Predict Subjective Specificity of Search Results Kumaripaba Athukorala, Antti Oulasvirta, Dorota Glowacka, Jilles Vreeken, Giulio Jacucci Helsinki Institute for Information Technology
More informationWeb page recommendation using a stochastic process model
Data Mining VII: Data, Text and Web Mining and their Business Applications 233 Web page recommendation using a stochastic process model B. J. Park 1, W. Choi 1 & S. H. Noh 2 1 Computer Science Department,
More informationClosing the Loop in Webpage Understanding
IEEE TRANSACTIONS ON KNOWLEDGE AND DATA ENGINEERING 1 Closing the Loop in Webpage Understanding Chunyu Yang, Student Member, IEEE, Yong Cao, Zaiqing Nie, Jie Zhou, Senior Member, IEEE, and Ji-Rong Wen
More informationWeb Query Translation with Representative Synonyms in Cross Language Information Retrieval
Web Query Translation with Representative Synonyms in Cross Language Information Retrieval August 25, 2005 Bo-Young Kang, Qing Li, Yun Jin, Sung Hyon Myaeng Information Retrieval and Natural Language Processing
More informationContext based Re-ranking of Web Documents (CReWD)
Context based Re-ranking of Web Documents (CReWD) Arijit Banerjee, Jagadish Venkatraman Graduate Students, Department of Computer Science, Stanford University arijitb@stanford.edu, jagadish@stanford.edu}
More informationPh.D. in Computer Science & Technology, Tsinghua University, Beijing, China, 2007
Yiqun Liu Associate Professor & Department co-chair Department of Computer Science and Technology Email yiqunliu@tsinghua.edu.cn URL http://www.thuir.org/group/~yqliu Phone +86-10-62796672 Fax +86-10-62796672
More informationCS446: Machine Learning Fall Problem Set 4. Handed Out: October 17, 2013 Due: October 31 th, w T x i w
CS446: Machine Learning Fall 2013 Problem Set 4 Handed Out: October 17, 2013 Due: October 31 th, 2013 Feel free to talk to other members of the class in doing the homework. I am more concerned that you
More informationUniversity of Virginia Department of Computer Science. CS 4501: Information Retrieval Fall 2015
University of Virginia Department of Computer Science CS 4501: Information Retrieval Fall 2015 2:00pm-3:30pm, Tuesday, December 15th Name: ComputingID: This is a closed book and closed notes exam. No electronic
More informationOverview of Web Mining Techniques and its Application towards Web
Overview of Web Mining Techniques and its Application towards Web *Prof.Pooja Mehta Abstract The World Wide Web (WWW) acts as an interactive and popular way to transfer information. Due to the enormous
More informationUsing Temporal Profiles of Queries for Precision Prediction
Using Temporal Profiles of Queries for Precision Prediction Fernando Diaz Center for Intelligent Information Retrieval Department of Computer Science University of Massachusetts Amherst, MA 01003 fdiaz@cs.umass.edu
More informationAn Axiomatic Approach to IR UIUC TREC 2005 Robust Track Experiments
An Axiomatic Approach to IR UIUC TREC 2005 Robust Track Experiments Hui Fang ChengXiang Zhai Department of Computer Science University of Illinois at Urbana-Champaign Abstract In this paper, we report
More informationECE521: Week 11, Lecture March 2017: HMM learning/inference. With thanks to Russ Salakhutdinov
ECE521: Week 11, Lecture 20 27 March 2017: HMM learning/inference With thanks to Russ Salakhutdinov Examples of other perspectives Murphy 17.4 End of Russell & Norvig 15.2 (Artificial Intelligence: A Modern
More informationImproving Difficult Queries by Leveraging Clusters in Term Graph
Improving Difficult Queries by Leveraging Clusters in Term Graph Rajul Anand and Alexander Kotov Department of Computer Science, Wayne State University, Detroit MI 48226, USA {rajulanand,kotov}@wayne.edu
More informationBrowser-Oriented Universal Cross-Site Recommendation and Explanation based on User Browsing Logs
Browser-Oriented Universal Cross-Site Recommendation and Explanation based on User Browsing Logs Yongfeng Zhang, Tsinghua University zhangyf07@gmail.com Outline Research Background Research Topic Current
More informationMining Web Data. Lijun Zhang
Mining Web Data Lijun Zhang zlj@nju.edu.cn http://cs.nju.edu.cn/zlj Outline Introduction Web Crawling and Resource Discovery Search Engine Indexing and Query Processing Ranking Algorithms Recommender Systems
More informationText Categorization (I)
CS473 CS-473 Text Categorization (I) Luo Si Department of Computer Science Purdue University Text Categorization (I) Outline Introduction to the task of text categorization Manual v.s. automatic text categorization
More informationNortheastern University in TREC 2009 Million Query Track
Northeastern University in TREC 2009 Million Query Track Evangelos Kanoulas, Keshi Dai, Virgil Pavlu, Stefan Savev, Javed Aslam Information Studies Department, University of Sheffield, Sheffield, UK College
More informationGraphGAN: Graph Representation Learning with Generative Adversarial Nets
The 32 nd AAAI Conference on Artificial Intelligence (AAAI 2018) New Orleans, Louisiana, USA GraphGAN: Graph Representation Learning with Generative Adversarial Nets Hongwei Wang 1,2, Jia Wang 3, Jialin
More informationAutomatic Query Type Identification Based on Click Through Information
Automatic Query Type Identification Based on Click Through Information Yiqun Liu 1,MinZhang 1,LiyunRu 2, and Shaoping Ma 1 1 State Key Lab of Intelligent Tech. & Sys., Tsinghua University, Beijing, China
More informationModeling Contextual Factors of Click Rates
Modeling Contextual Factors of Click Rates Hila Becker Columbia University 500 W. 120th Street New York, NY 10027 Christopher Meek Microsoft Research 1 Microsoft Way Redmond, WA 98052 David Maxwell Chickering
More informationA Task Level Metric for Measuring Web Search Satisfaction and its Application on Improving Relevance Estimation
A Task Level Metric for Measuring Web Search Satisfaction and its Application on Improving Relevance Estimation Ahmed Hassan Microsoft Research Redmond, WA hassanam@microsoft.com Yang Song Microsoft Research
More informationCollaborative Filtering Applied to Educational Data Mining
Collaborative Filtering Applied to Educational Data Mining KDD Cup 200 July 25 th, 200 BigChaos @ KDD Team Dataset Solution Overview Michael Jahrer, Andreas Töscher from commendo research Dataset Team
More informationContent-Aware Click Modeling
Content-Aware Click Modeling Hongning Wang, ChengXiang Zhai Department of Computer Science University of Illinois at Urbana-Champaign Urbana IL, 61801 USA {wang296,czhai}@illinois.edu Anlei Dong, Yi Chang
More informationIJREAT International Journal of Research in Engineering & Advanced Technology, Volume 1, Issue 5, Oct-Nov, ISSN:
IJREAT International Journal of Research in Engineering & Advanced Technology, Volume 1, Issue 5, Oct-Nov, 20131 Improve Search Engine Relevance with Filter session Addlin Shinney R 1, Saravana Kumar T
More informationA Formal Approach to Score Normalization for Meta-search
A Formal Approach to Score Normalization for Meta-search R. Manmatha and H. Sever Center for Intelligent Information Retrieval Computer Science Department University of Massachusetts Amherst, MA 01003
More informationVIMED JWEB Manual. Victorian Stroke Telemedicine. Version: 1.0. Created by: Grant Stephens. Page 1 of 17
VIMED JWEB Manual Victorian Stroke Telemedicine Version: 1.0 Created by: Grant Stephens Page 1 of 17 1 Table of Contents 1 Table of Contents... 2 2 What is JWEB?... 4 3 Accessing JWEB... 4 3.1 For Mac
More information