Applying the User-over-Ranking Hypothesis to Query Formulation - - PowerPoint PPT Presentation

applying the user over ranking hypothesis to query
SMART_READER_LITE
LIVE PREVIEW

Applying the User-over-Ranking Hypothesis to Query Formulation - - PowerPoint PPT Presentation

Applying the User-over-Ranking Hypothesis to Query Formulation Matthias Hagen Benno Stein Bauhaus-Universit at Weimar matthias.hagen@uni-weimar.de ICTIR 2011 Bertinoro, Italy September 14, 2011 Matthias Hagen, Benno Stein Applying the


slide-1
SLIDE 1

Applying the User-over-Ranking Hypothesis to Query Formulation

Matthias Hagen Benno Stein

Bauhaus-Universit¨ at Weimar matthias.hagen@uni-weimar.de

ICTIR 2011 Bertinoro, Italy September 14, 2011

Matthias Hagen, Benno Stein Applying the User-over-Ranking Hypothesis to Query Formulation 1

slide-2
SLIDE 2

What is the User-over-Ranking hypothesis?

Matthias Hagen, Benno Stein Applying the User-over-Ranking Hypothesis to Query Formulation 2

slide-3
SLIDE 3

The User-over-Ranking Hypothesis

[Stein and Hagen, ECIR 2011]

Queries returning as many results as the user can consider increase retrieval performance.

Matthias Hagen, Benno Stein Applying the User-over-Ranking Hypothesis to Query Formulation 3

slide-4
SLIDE 4

The User-over-Ranking Hypothesis

[Stein and Hagen, ECIR 2011]

Queries returning as many results as the user can consider increase retrieval performance.

Fine print: If ranking works: great! Use case is not some query like ebay. But more involved information needs, automatic systems, etc.

Matthias Hagen, Benno Stein Applying the User-over-Ranking Hypothesis to Query Formulation 3

slide-5
SLIDE 5

Assumption 1: More keywords = more specific

Matthias Hagen, Benno Stein Applying the User-over-Ranking Hypothesis to Query Formulation 4

slide-6
SLIDE 6

Assumption 1: More keywords = more specific

Matthias Hagen, Benno Stein Applying the User-over-Ranking Hypothesis to Query Formulation 4

slide-7
SLIDE 7

Assumption 1: More keywords = more specific

Result list length Query length underspecific

  • verspecific

Specificity of Queries

1 10 20 106

Matthias Hagen, Benno Stein Applying the User-over-Ranking Hypothesis to Query Formulation 5

slide-8
SLIDE 8

Assumption 2: User can arbitrarily specify information need

Result list length Query length underspecific

  • verspecific

Specificity of Queries

1 10 20 106

Matthias Hagen, Benno Stein Applying the User-over-Ranking Hypothesis to Query Formulation 6

slide-9
SLIDE 9

Assumption 2: User can arbitrarily specify information need

Result list length Query length underspecific

  • verspecific

Specificity of Queries

1 10 20 106

Matthias Hagen, Benno Stein Applying the User-over-Ranking Hypothesis to Query Formulation 6

slide-10
SLIDE 10

Assumption 3: User can consider about k results.

Result list length Query length underspecific

  • verspecific

Specificity of Queries

1 10 20 106 Processing capacity k Result list length 10 100 103 104 k

Matthias Hagen, Benno Stein Applying the User-over-Ranking Hypothesis to Query Formulation 7

slide-11
SLIDE 11

Hypothesis: Specificity matches k = Optimum retrieval

Result list length Query length underspecific

  • verspecific

Specificity of Queries

1 10 20 106 Processing capacity k Result list length 10 100 103 104 k

  • ptimum retrieval

⇔ result set size = k

Probability for Retrieval Success

Matthias Hagen, Benno Stein Applying the User-over-Ranking Hypothesis to Query Formulation 8

slide-12
SLIDE 12

What is this hypothesis good for?

Matthias Hagen, Benno Stein Applying the User-over-Ranking Hypothesis to Query Formulation 9

slide-13
SLIDE 13

Query Formulation

Scenario

Given a set W of keywords Find a good query Q ⊆ W

Matthias Hagen, Benno Stein Applying the User-over-Ranking Hypothesis to Query Formulation 10

slide-14
SLIDE 14

Query Formulation

Scenario

Given a set W of keywords Find a good query Q ⊆ W

Previous approach

[Lee et al., CIKM 2009]

Learnt ranking function identifies the m best keywords from W . Based on: Known relevant documents Unrestricted index access Manually tuned m for each set W

Matthias Hagen, Benno Stein Applying the User-over-Ranking Hypothesis to Query Formulation 10

slide-15
SLIDE 15

Consider for instance . . . Known-Item Finding

Scenario

User accessed a document But did not store it

Matthias Hagen, Benno Stein Applying the User-over-Ranking Hypothesis to Query Formulation 11

slide-16
SLIDE 16

Consider for instance . . . Known-Item Finding

Scenario

User accessed a document But did not store it How can she find it again?

Matthias Hagen, Benno Stein Applying the User-over-Ranking Hypothesis to Query Formulation 11

slide-17
SLIDE 17

Consider for instance . . . Known-Item Finding

Scenario

User accessed a document But did not store it How can she find it again?

Solution

Remember some keywords

information retrieval query formulation web search search session user support search engine cost optimization

Query a search engine

Matthias Hagen, Benno Stein Applying the User-over-Ranking Hypothesis to Query Formulation 11

slide-18
SLIDE 18

But what query to formulate with the keywords?

Matthias Hagen, Benno Stein Applying the User-over-Ranking Hypothesis to Query Formulation 12

slide-19
SLIDE 19

Single keywords?

information retrieval / / / / / / / / query / / / / / / / / / / / / / / / / / / / / formulation / / / / / web / / / / / / / / / / / / search / / / / / / / / / / search / / / / / / / / / / / / / / session / / / / / / / user/ / / / / / / / / / / / / support / / / / / / / / / / search / / / / / / / / / / / / engine / / / / / / / cost/ / / / / / / / / / / / / / / / / / / / / /

  • ptimization

Matthias Hagen, Benno Stein Applying the User-over-Ranking Hypothesis to Query Formulation 13

slide-20
SLIDE 20

Single keywords?

/ / / / / / / / / / / / / / / / / / information/ / / / / / / / / / / / / / / / / retrieval query formulation / / / / / web / / / / / / / / / / / / search / / / / / / / / / / search / / / / / / / / / / / / / / session / / / / / / / user/ / / / / / / / / / / / / support / / / / / / / / / / search / / / / / / / / / / / / engine / / / / / / / cost/ / / / / / / / / / / / / / / / / / / / / /

  • ptimization

Matthias Hagen, Benno Stein Applying the User-over-Ranking Hypothesis to Query Formulation 13

slide-21
SLIDE 21

Single keywords?

/ / / / / / / / / / / / / / / / / / information/ / / / / / / / / / / / / / / / / retrieval / / / / / / / / query / / / / / / / / / / / / / / / / / / / / formulation web search / / / / / / / / / / search / / / / / / / / / / / / / / session / / / / / / / user/ / / / / / / / / / / / / support / / / / / / / / / / search / / / / / / / / / / / / engine / / / / / / / cost/ / / / / / / / / / / / / / / / / / / / / /

  • ptimization

Matthias Hagen, Benno Stein Applying the User-over-Ranking Hypothesis to Query Formulation 13

slide-22
SLIDE 22

Single keywords? Underspecific!

/ / / / / / / / / / / / / / / / / / information/ / / / / / / / / / / / / / / / / retrieval / / / / / / / / query / / / / / / / / / / / / / / / / / / / / formulation web search / / / / / / / / / / search / / / / / / / / / / / / / / session / / / / / / / user/ / / / / / / / / / / / / support / / / / / / / / / / search / / / / / / / / / / / / engine / / / / / / / cost/ / / / / / / / / / / / / / / / / / / / / /

  • ptimization

Matthias Hagen, Benno Stein Applying the User-over-Ranking Hypothesis to Query Formulation 13

slide-23
SLIDE 23

All keywords at once?

information retrieval query formulation web search search session user support search engine cost optimization

Matthias Hagen, Benno Stein Applying the User-over-Ranking Hypothesis to Query Formulation 13

slide-24
SLIDE 24

All keywords at once? Overspecific!

information retrieval query formulation web search search session user support search engine cost optimization

Matthias Hagen, Benno Stein Applying the User-over-Ranking Hypothesis to Query Formulation 13

slide-25
SLIDE 25

Remember the hypothesis . . . not too many results!

Matthias Hagen, Benno Stein Applying the User-over-Ranking Hypothesis to Query Formulation 14

slide-26
SLIDE 26

Solution: As many keywords as possible!

information retrieval query formulation web search search session / / / / / / / user/ / / / / / / / / / / / / support search engine cost optimization

Matthias Hagen, Benno Stein Applying the User-over-Ranking Hypothesis to Query Formulation 15

slide-27
SLIDE 27

“As many keywords as possible”-Query

Characteristics

Captures most of the remembered keywords Best possible description of the known-item Not too many results → user can check complete list

Matthias Hagen, Benno Stein Applying the User-over-Ranking Hypothesis to Query Formulation 16

slide-28
SLIDE 28

“As many keywords as possible”-Query

Characteristics

Captures most of the remembered keywords Best possible description of the known-item Not too many results → user can check complete list

Problem

Relevant documents not known No web index at user site Query size not known

Matthias Hagen, Benno Stein Applying the User-over-Ranking Hypothesis to Query Formulation 16

slide-29
SLIDE 29

“As many keywords as possible”-Query

Characteristics

Captures most of the remembered keywords Best possible description of the known-item Not too many results → user can check complete list

Problem

Relevant documents not known No web index at user site → Lee et al. not applicable Query size not known

Matthias Hagen, Benno Stein Applying the User-over-Ranking Hypothesis to Query Formulation 16

slide-30
SLIDE 30

We propose an approach for this scenario . . .

Matthias Hagen, Benno Stein Applying the User-over-Ranking Hypothesis to Query Formulation 17

slide-31
SLIDE 31

Problem Statement with Capacity

Promising Query

Given:

1

A set W of keywords

2

An upper bound k on the result list length

Find a largest query Q ⊆ W yielding at most k results

Optimization Problem!

Minimize the number of submitted web queries to find Q.

Matthias Hagen, Benno Stein Applying the User-over-Ranking Hypothesis to Query Formulation 18

slide-32
SLIDE 32

Problem Statement with Capacity

Promising Query

Given:

1

A set W of keywords

2

An upper bound k on the result list length

Find a largest query Q ⊆ W yielding at most k results

Optimization Problem!

Minimize the number of submitted web queries to find Q.

Matthias Hagen, Benno Stein Applying the User-over-Ranking Hypothesis to Query Formulation 18

slide-33
SLIDE 33

Baseline: Depth-First Search

w1, w2, w3, w4

Matthias Hagen, Benno Stein Applying the User-over-Ranking Hypothesis to Query Formulation 19

slide-34
SLIDE 34

Baseline: Depth-First Search

w1, w2, w3, w4 w1

Matthias Hagen, Benno Stein Applying the User-over-Ranking Hypothesis to Query Formulation 19

slide-35
SLIDE 35

Baseline: Depth-First Search

w1, w2, w3, w4 w1 [10 000 results]

(> 100)

Matthias Hagen, Benno Stein Applying the User-over-Ranking Hypothesis to Query Formulation 19

slide-36
SLIDE 36

Baseline: Depth-First Search

w1, w2, w3, w4 w1 [10 000 results]

(> 100)

w1 ∧ w2

Matthias Hagen, Benno Stein Applying the User-over-Ranking Hypothesis to Query Formulation 19

slide-37
SLIDE 37

Baseline: Depth-First Search

w1, w2, w3, w4 w1 [10 000 results]

(> 100)

w1 ∧ w2 [0 results]

Matthias Hagen, Benno Stein Applying the User-over-Ranking Hypothesis to Query Formulation 19

slide-38
SLIDE 38

Baseline: Depth-First Search

w1, w2, w3, w4 w1 [10 000 results]

(> 100)

w1 ∧ w2 [0 results] w1 ∧ w3 [90 results]

Matthias Hagen, Benno Stein Applying the User-over-Ranking Hypothesis to Query Formulation 19

slide-39
SLIDE 39

Baseline: Depth-First Search

w1, w2, w3, w4 w1 [10 000 results]

(> 100)

w1 ∧ w2 [0 results] w1 ∧ w3 [90 results]

(< 100)

Matthias Hagen, Benno Stein Applying the User-over-Ranking Hypothesis to Query Formulation 19

slide-40
SLIDE 40

Baseline: Depth-First Search

w1, w2, w3, w4 w1 [10 000 results]

(> 100)

w1 ∧ w2 [0 results] w1 ∧ w3 [90 results]

(< 100)

w1 ∧ w3 ∧ w4 [0 results]

Matthias Hagen, Benno Stein Applying the User-over-Ranking Hypothesis to Query Formulation 19

slide-41
SLIDE 41

Baseline: Depth-First Search

w1, w2, w3, w4 w1 [10 000 results]

(> 100)

w1 ∧ w2 [0 results] w1 ∧ w3 [90 results]

(< 100)

w1 ∧ w3 ∧ w4 [0 results]

Matthias Hagen, Benno Stein Applying the User-over-Ranking Hypothesis to Query Formulation 19

slide-42
SLIDE 42

Baseline: Depth-First Search

w1, w2, w3, w4 w1 [10 000 results]

(> 100)

w1 ∧ w2 [0 results] w1 ∧ w3 [90 results]

(< 100)

w1 ∧ w3 ∧ w4 [0 results]

w2 [10 000 results] w2 ∧ w3 [5 000 results] w2 ∧ w3 ∧ w4 [60 results]

Matthias Hagen, Benno Stein Applying the User-over-Ranking Hypothesis to Query Formulation 19

slide-43
SLIDE 43

Baseline: Depth-First Search

w1, w2, w3, w4 w1 [10 000 results]

(> 100)

w1 ∧ w2 [0 results] w1 ∧ w3 [90 results] w1 ∧ w3 ∧ w4 [0 results]

w2 [10 000 results] w2 ∧ w3 [5 000 results] w2 ∧ w3 ∧ w4 [60 results]

Matthias Hagen, Benno Stein Applying the User-over-Ranking Hypothesis to Query Formulation 19

slide-44
SLIDE 44

Baseline: Depth-First Search

w1, w2, w3, w4 w1 [10 000 results]

(> 100)

w1 ∧ w2 [0 results] w1 ∧ w3 [90 results] w1 ∧ w3 ∧ w4 [0 results]

w2 [10 000 results] w2 ∧ w3 [5 000 results] w2 ∧ w3 ∧ w4 [60 results]

✘ ✘

Matthias Hagen, Benno Stein Applying the User-over-Ranking Hypothesis to Query Formulation 19

slide-45
SLIDE 45

Baseline’s Analysis

Major Drawback

All intermediate queries submitted. → Bad run time!

Matthias Hagen, Benno Stein Applying the User-over-Ranking Hypothesis to Query Formulation 20

slide-46
SLIDE 46

Baseline’s Analysis

Major Drawback

All intermediate queries submitted. → Bad run time!

Idea

Estimate the result list length before query submission.

Matthias Hagen, Benno Stein Applying the User-over-Ranking Hypothesis to Query Formulation 20

slide-47
SLIDE 47

Co-occurrence based Estimations

Estimate: "information retrieval" "query formulation" + "web search"

Matthias Hagen, Benno Stein Applying the User-over-Ranking Hypothesis to Query Formulation 21

slide-48
SLIDE 48

Co-occurrence based Estimations

Estimate: "information retrieval" "query formulation" + "web search" Known:

"information retrieval" "query formulation"

87 100 results

Matthias Hagen, Benno Stein Applying the User-over-Ranking Hypothesis to Query Formulation 21

slide-49
SLIDE 49

Co-occurrence based Estimations

Estimate: "information retrieval" "query formulation" + "web search" Known:

"information retrieval" "query formulation"

87 100 results

"information retrieval" + "web search"

16 % remain

Matthias Hagen, Benno Stein Applying the User-over-Ranking Hypothesis to Query Formulation 21

slide-50
SLIDE 50

Co-occurrence based Estimations

Estimate: "information retrieval" "query formulation" + "web search" Known:

"information retrieval" "query formulation"

87 100 results

"information retrieval" + "web search"

16 % remain

"query formulation" + "web search"

22 % remain

Matthias Hagen, Benno Stein Applying the User-over-Ranking Hypothesis to Query Formulation 21

slide-51
SLIDE 51

Co-occurrence based Estimations

Estimate: "information retrieval" "query formulation" + "web search" Known:

"information retrieval" "query formulation"

87 100 results

"information retrieval" + "web search"

16 % remain

"query formulation" + "web search"

22 % remain Our estimation scheme: avg(16 % , 22 %) = 19 % 87 100 · 0.19 = 16 500 results

Matthias Hagen, Benno Stein Applying the User-over-Ranking Hypothesis to Query Formulation 21

slide-52
SLIDE 52

Co-occurrence based Estimations

Estimate: "information retrieval" "query formulation" + "web search" Known:

"information retrieval" "query formulation"

87 100 results

"information retrieval" + "web search"

16 % remain

"query formulation" + "web search"

22 % remain Our estimation scheme: avg(16 % , 22 %) = 19 % 87 100 · 0.19 = 16 500 results Control: 35 700 results

Matthias Hagen, Benno Stein Applying the User-over-Ranking Hypothesis to Query Formulation 21

slide-53
SLIDE 53

Co-occurrence based Estimations

Estimate: "information retrieval" "query formulation" + "web search" Known:

"information retrieval" "query formulation"

87 100 results

"information retrieval" + "web search"

16 % remain

"query formulation" + "web search"

22 % remain Our estimation scheme: avg(16 % , 22 %) = 19 % 87 100 · 0.19 = 16 500 results Control: 35 700 results

Observation

Our scheme usually underestimates the real result list length.

Matthias Hagen, Benno Stein Applying the User-over-Ranking Hypothesis to Query Formulation 21

slide-54
SLIDE 54

“Informed” Baseline

w1, w2, w3, w4

Matthias Hagen, Benno Stein Applying the User-over-Ranking Hypothesis to Query Formulation 22

slide-55
SLIDE 55

“Informed” Baseline

w1, w2, w3, w4 w1

Matthias Hagen, Benno Stein Applying the User-over-Ranking Hypothesis to Query Formulation 22

slide-56
SLIDE 56

“Informed” Baseline

w1, w2, w3, w4 w1 [15 000 estimated]

Matthias Hagen, Benno Stein Applying the User-over-Ranking Hypothesis to Query Formulation 22

slide-57
SLIDE 57

“Informed” Baseline

w1, w2, w3, w4 w1 [15 000 estimated] w1 ∧ w2 [50 estimated]

Matthias Hagen, Benno Stein Applying the User-over-Ranking Hypothesis to Query Formulation 22

slide-58
SLIDE 58

“Informed” Baseline

w1, w2, w3, w4 w1 [15 000 estimated] w1 ∧ w2 [50 estimated]

[0 results]

Matthias Hagen, Benno Stein Applying the User-over-Ranking Hypothesis to Query Formulation 22

slide-59
SLIDE 59

“Informed” Baseline

w1, w2, w3, w4 w1 [15 000 estimated] w1 ∧ w2 [50 estimated]

[0 results]

w1 ∧ w3 [70 estimated]

Matthias Hagen, Benno Stein Applying the User-over-Ranking Hypothesis to Query Formulation 22

slide-60
SLIDE 60

“Informed” Baseline

w1, w2, w3, w4 w1 [15 000 estimated] w1 ∧ w2 [50 estimated]

[0 results]

w1 ∧ w3 [70 estimated]

[90 results]

Matthias Hagen, Benno Stein Applying the User-over-Ranking Hypothesis to Query Formulation 22

slide-61
SLIDE 61

“Informed” Baseline

w1, w2, w3, w4 w1 [15 000 estimated] w1 ∧ w2 [50 estimated]

[0 results]

w1 ∧ w3 [70 estimated]

[90 results] (< 100)

Matthias Hagen, Benno Stein Applying the User-over-Ranking Hypothesis to Query Formulation 22

slide-62
SLIDE 62

“Informed” Baseline

w1, w2, w3, w4 w1 [15 000 estimated] w1 ∧ w2 [50 estimated]

[0 results]

w1 ∧ w3 [70 estimated]

[90 results] (< 100)

w1 ∧ w3 ∧ w4

[30 estimated] Matthias Hagen, Benno Stein Applying the User-over-Ranking Hypothesis to Query Formulation 22

slide-63
SLIDE 63

“Informed” Baseline

w1, w2, w3, w4 w1 [15 000 estimated] w1 ∧ w2 [50 estimated]

[0 results]

w1 ∧ w3 [70 estimated]

[90 results] (< 100)

w1 ∧ w3 ∧ w4

[30 estimated]

[0 results]

Matthias Hagen, Benno Stein Applying the User-over-Ranking Hypothesis to Query Formulation 22

slide-64
SLIDE 64

“Informed” Baseline

w1, w2, w3, w4 w1 [15 000 estimated] w1 ∧ w2 [50 estimated]

[0 results]

w1 ∧ w3 [70 estimated]

[90 results] (< 100)

w1 ∧ w3 ∧ w4

[30 estimated]

[0 results]

Matthias Hagen, Benno Stein Applying the User-over-Ranking Hypothesis to Query Formulation 22

slide-65
SLIDE 65

“Informed” Baseline

w1, w2, w3, w4 w1 [15 000 estimated] w1 ∧ w2 [50 estimated]

[0 results]

w1 ∧ w3 [70 estimated]

[90 results] (< 100)

w1 ∧ w3 ∧ w4

[30 estimated]

[0 results]

[20 000 estimated]

w2 w2 ∧ w3 w2 ∧ w3 ∧ w4

[1 500 estimated] [40 estimated] Matthias Hagen, Benno Stein Applying the User-over-Ranking Hypothesis to Query Formulation 22

slide-66
SLIDE 66

“Informed” Baseline

w1, w2, w3, w4 w1 [15 000 estimated] w1 ∧ w2 [50 estimated]

[0 results]

w1 ∧ w3 [70 estimated]

[90 results]

w1 ∧ w3 ∧ w4

[30 estimated]

[0 results]

[20 000 estimated]

w2 w2 ∧ w3 w2 ∧ w3 ∧ w4

[1 500 estimated] [40 estimated]

[60 results]

Matthias Hagen, Benno Stein Applying the User-over-Ranking Hypothesis to Query Formulation 22

slide-67
SLIDE 67

“Informed” Baseline

w1, w2, w3, w4 w1 [15 000 estimated] w1 ∧ w2 [50 estimated]

[0 results]

w1 ∧ w3 [70 estimated]

[90 results]

w1 ∧ w3 ∧ w4

[30 estimated]

[0 results]

[20 000 estimated]

w2 w2 ∧ w3 w2 ∧ w3 ∧ w4

[1 500 estimated] [40 estimated]

[60 results]

✘ ✘

Matthias Hagen, Benno Stein Applying the User-over-Ranking Hypothesis to Query Formulation 22

slide-68
SLIDE 68

Heuristic

Informed baseline + heuristic reordering of the keywords at each step

Matthias Hagen, Benno Stein Applying the User-over-Ranking Hypothesis to Query Formulation 23

slide-69
SLIDE 69

Experimental Setup

Corpus

775 papers on Computer Science (the known-items) 15 keywords extracted from each

System

Bing API as search engine Set k = 100 Measure number of submitted Web queries

Matthias Hagen, Benno Stein Applying the User-over-Ranking Hypothesis to Query Formulation 24

slide-70
SLIDE 70

Experimental Setup

Corpus

775 papers on Computer Science (the known-items) 15 keywords extracted from each

System

Bing API as search engine Set k = 100 Measure number of submitted Web queries

Matthias Hagen, Benno Stein Applying the User-over-Ranking Hypothesis to Query Formulation 24

slide-71
SLIDE 71

Experimental Results

Number of keywords 5 10 15 Promising query not possible 614 328 86 found 161 447 689 heuristic 10.39 24.93 53.78

  • Avg. queries submitted

informed 10.36 27.01 108.78 baseline 11.81 30.94 116.22

Matthias Hagen, Benno Stein Applying the User-over-Ranking Hypothesis to Query Formulation 25

slide-72
SLIDE 72

Experimental Results

1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 Number of keywords Heuristic Informed Baseline

  • Avg. ratio of submitted queries

0.5 0.6 0.7 0.8 1.1 1.0 0.9 0.4

Matthias Hagen, Benno Stein Applying the User-over-Ranking Hypothesis to Query Formulation 25

slide-73
SLIDE 73

Almost the end: The take-away messages!

Matthias Hagen, Benno Stein Applying the User-over-Ranking Hypothesis to Query Formulation 26

slide-74
SLIDE 74

What we have done

Results

User-over-Ranking

longer queries → fewer results

  • ptimum retrieval performance

→ user capacity

Heuristic for promising queries Use cases:

Known-item finding Empty results lists Query sessions

Future Work

Co-occurrence source User study

Matthias Hagen, Benno Stein Applying the User-over-Ranking Hypothesis to Query Formulation 27

slide-75
SLIDE 75

What we have (not) done

Results

User-over-Ranking

longer queries → fewer results

  • ptimum retrieval performance

→ user capacity

Heuristic for promising queries Use cases:

Known-item finding Empty results lists Query sessions

Future Work

Co-occurrence source User study

Matthias Hagen, Benno Stein Applying the User-over-Ranking Hypothesis to Query Formulation 27

slide-76
SLIDE 76

What we have (not) done

Results

User-over-Ranking

longer queries → fewer results

  • ptimum retrieval performance

→ user capacity

Heuristic for promising queries Use cases:

Known-item finding Empty results lists Query sessions

Future Work

Co-occurrence source User study

Thank you

  • Matthias Hagen, Benno Stein

Applying the User-over-Ranking Hypothesis to Query Formulation 27