0.25
0.5
0.75
1.25
1.5
1.75
2
Identifying Task-based Sessions in Search Engine Query Logs
Published on Aug 09, 20113337 Views
The research challenge addressed in this paper is to devise effective techniques for identifying task-based sessions, i.e. sets of possibly non contiguous queries issued by the user of a Web Search En
Related categories
Chapter list
Identifying Task-based Sessions in Search Engine Query Logs00:00
Agenda00:10
Agenda: Introduction00:30
Problem Statement: TSDP00:31
Background (1)00:58
Background (2)01:02
Background (3)01:21
Background (4)01:27
Background (5)01:36
Background (6)01:52
Motivation (1)02:05
Motivation (2)02:20
Motivation (3)02:28
Motivation (4)02:44
The Big Picture (1)03:04
The Big Picture (2)03:12
The Big Picture (3)03:15
The Big Picture (4)03:17
The Big Picture (5)03:25
The Big Picture (6)03:42
The Big Picture (7)03:55
The Big Picture (8)04:05
Related Work04:19
Related Work: time-based (1)04:28
Related Work: time-based (2)04:51
Related Work: content-based (1)05:08
Related Work: content-based (2)05:22
Related Work: novel (1)05:59
Related Work: novel (2)06:46
Agenda: Contributions06:54
Outline (1)06:55
Outline (2)07:05
Outline (307:08
Outline (4)07:15
Outline (5)07:19
Agenda: Contributions - Query Log Analysis07:22
Data Set: AOL Query Log (1)07:24
Data Set: AOL Query Log (2)07:40
Data Analysis: query time gap (1)07:54
Data Analysis: query time gap (2)08:13
Agenda: Contributions - Ground-truth Analysis08:24
Ground-truth: construction (1)08:26
Ground-truth: construction (2)08:34
Ground-truth: construction (3)08:45
Ground-truth: construction (4)08:54
Ground-truth: statistics (1)09:03
Ground-truth: statistics (2)09:18
Ground-truth: statistics (3)09:31
Ground-truth: statistics (4)09:41
Ground-truth: statistics (5)10:02
Agenda: Contributions - Approaching TSDP10:36
TSDP: approaches (1)10:38
TSDP: approaches (2)10:55
TSDP: approaches (3)11:03
TSDP: approaches (4)11:06
TSDP: approaches (5)11:14
TSDP: approaches (6)11:35
TSDP: approaches (7)11:43
TSDP: approaches (8)11:55
Query Features (1)12:10
Query Features (2)12:33
Distance Functions: μ1 vs. μ213:23
QC-WCC (1)14:17
QC-WCC (2)14:29
QC-WCC (3)14:32
QC-WCC (4)14:36
QC-WCC (5)14:47
QC-WCC (6)14:57
QC-WCC (7)15:03
QC-WCC (8)15:08
QC-WCC (9)15:11
QC-WCC (10)15:13
QC-HTC (1)15:17
QC-HTC (2)15:23
QC-HTC (3)15:27
QC-HTC (4)15:35
QC-HTC: sequential clustering (1)15:46
QC-HTC: sequential clustering (2)15:54
QC-HTC: sequential clustering (3)16:03
QC-HTC: merging (1)16:09
QC-HTC: merging (2)16:23
QC-HTC: merging (3)16:34
QC-HTC: merging (4)16:44
QC-HTC: merging (5)16:53
QC-HTC (1)17:04
QC-HTC (2)17:08
QC-HTC (3)17:16
QC-HTC (4)17:19
QC-HTC (5)17:22
QC-HTC (6)17:33
QC-HTC (7)17:39
QC-HTC (8)17:45
QC-HTC: time complexity (1)17:52
QC-HTC: time complexity (2)18:12
Agenda: Experiments and Results18:41
Setup (1)18:42
Setup (2)18:46
Setup (3)18:54
Evaluation (1)18:59
Evaluation (2)19:15
Evaluation (3)19:18
Evaluation (4)19:19
Results: TS-t (1)19:21
Results: TS-t (2)19:26
Results: QFG19:37
Results: QC-WCC19:57
Results: QC-HTC20:11
Results: best20:15
Results: Wiki impact (1)20:33
Results: Wiki impact (2)20:57
Results: Wiki impact (3)21:20
Results: Wiki impact (4)21:24
Agenda: Conclusions and Future Work21:30
Conclusions (1)21:31
Conclusions (2)21:37
Conclusions (3)21:43
Future Work (1)21:52
Future Work (2)21:56
Future Work (3)22:02
Vision (1)22:10
Vision (2)22:18
Vision (3)22:29
Vision (4)22:41
References22:53
Thank You!22:57