Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data. A simulation from public publication records: the people listed were not invited and did not agree to review.
? Tutorial for this page

Chris Leggetter

dblp:06/5404 · also C. J. Leggetter · DBLP profile ↗
← Back
10ranked-venue papers
3as first author
0since 2021 · last 2011
—ORCID · none

Domains — the database's venue-derived domains; a paper can count in several

Artificial intelligence and machine learning · 5 · 3 first-authorDatabases, data management, data science and information retrieval · 5Graphics, computer vision, multimedia, augmented reality and games · 3 · 2 first-authorApplied, interdisciplinary, general and emerging computing · 1

Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.

Databases, data mining, and information retrieval
4 papers
Information retrieval · 98% Spatial and temporal data management · 2%

Topics — the 10 heaviest of 11, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Information retrieval › online advertising
sponsored search
0.222010
Improving ad relevance in sponsored search · WSDM 2010
Clicked phrase document expansion for sponsored search ad retrieval · SIGIR 2010
Information retrieval › online advertising › sponsored search
ad retrieval
0.112010
Clicked phrase document expansion for sponsored search ad retrieval · SIGIR 2010
Information retrieval › user behavior › search behavior
click model
0.112010
Improving ad relevance in sponsored search · WSDM 2010
Information retrieval › document processing › document analysis › document representation
document expansion
0.112010
Clicked phrase document expansion for sponsored search ad retrieval · SIGIR 2010
Information retrieval › online advertising › sponsored search
query-ad relevance
0.112010
Improving ad relevance in sponsored search · WSDM 2010
Information retrieval › query understanding
query disambiguation
0.112010
Transitive history-based query disambiguation for query reformulation · SIGIR 2010
Information retrieval
query reformulation
0.112010
Transitive history-based query disambiguation for query reformulation · SIGIR 2010
Information retrieval
query log analysis
0.112009
Discovering users' specific geo intention in web search · WWW 2009
Information retrieval › online advertising › sponsored search
query-ad matching
0.012010
Clicked phrase document expansion for sponsored search ad retrieval · SIGIR 2010
Spatial and temporal data management › location data
geo-tagged data
0.012009
Discovering users' specific geo intention in web search · WWW 2009

Methods — techniques the papers use, named apart from their topics

translation model · 0.1transitive similarity · 0.1text overlap features · 0.1probabilistic model · 0.1machine learning · 0.1conditional random field · 0.1click logs · 0.1probabilistic language model · 0.1
YearPublicationVenuePosition
2011 The sum of its parts: reducing sparsity in click estimation with query segments
Dustin Hillard, Eren Manavoglu, Hema Raghavan, Chris Leggetter, Erick Cantú-Paz, Rukmini Iyer
Inf. Retr.4
2010 Minimally-Supervised Extraction of Entities from Text Advertisements
Sameer Singh 0001, Dustin Hillard, Chris Leggetter
HLT-NAACL3
2010 Transitive history-based query disambiguation for query reformulation
abstract
We present a probabilistic model of a user's search history and a target query reformulation. We derive a simple transitive similarity algorithm for disambiguating queries and improving history-based query reformulation accuracy. We compare the merits of this approach to other methods and present results on both examples assessed by human editors and on automatically-labeled click data.
Karim Filali, Anish Nair, Chris Leggetter
SIGIR3
2010 Clicked phrase document expansion for sponsored search ad retrieval
abstract
We present a document expansion approach that uses Conditional Random Field (CRF) segmentation to automatically extract salient phrases from ad titles. We then supplement the ad document with query segments that are probable translations of the document phrases, as learned from a large commercial search engine's click logs. Our approach provides a significant improvement in DCG and interpolated precision and recall on a large set of human labeled query-ad pairs.
Dustin Hillard, Chris Leggetter
SIGIR2
2010 Improving ad relevance in sponsored search
abstract
We describe a machine learning approach for predicting sponsored search ad relevance. Our baseline model incorporates basic features of text overlap and we then extend the model to learn from past user clicks on advertisements. We present a novel approach using translation models to learn user click propensity from sparse click logs.
Dustin Hillard, Stefan Schrödl, Eren Manavoglu, Hema Raghavan, Chris Leggetter
WSDM5
2009 Discovering users' specific geo intention in web search
abstract
Discovering users' specific and implicit geographic intention in web search can greatly help satisfy users' information needs. We build a geo intent analysis system that uses minimal supervision to learn a model from large amounts of web-search logs for this discovery. We build a city language model, which is a probabilistic representation of the language surrounding the mention of a city in web queries. We use several features derived from these language models to: (1) identify users' implicit geo intent and pinpoint the city corresponding to this intent, (2) determine whether the geo-intent is localized around the users' current geographic location, (3) predict cities for queries that have a mention of an entity that is located in a specific place. Experimental results demonstrate the effectiveness of using features derived from the city language model. We find that (1) the system has over 90% precision and more than 74% accuracy for the task of detecting users' implicit city level geo intent (2) the system achieves more than 96% accuracy in determining whether implicit geo queries are local geo queries, neighbor region geo queries or none-of-these (3) the city language model can effectively retrieve cities in location-specific queries with high precision (88%) and recall (74%); human evaluation shows that the language model predicts city labels for location-specific queries with high accuracy (84.5%).
Xing Yi, Hema Raghavan, Chris Leggetter
WWW3
1995 The 1994 HTK large vocabulary speech recognition system
abstract
This paper describes recent work on the HTK large vocabulary speech recognition system. The system uses tied-state cross-word context-dependent mixture Gaussian HMMs and a dynamic network decoder that can operate in a single pass. In the last year the decoder has been extended to produce word lattices to allow flexible and efficient system development, as well as multi-pass operation for use with computationally expensive acoustic and/or language models. The system vocabulary can now be up to 65 k words, the final acoustic models have been extended to be sensitive to more acoustic context (quinphones), a 4-gram language model has been used and unsupervised incremental speaker adaptation incorporated. The resulting system gave the lowest error rates on both the H1-P0 and H1-C1 hub tasks in the November 1994 ARPA CSR evaluation.
Philip C. Woodland, Chris Leggetter, J. J. Odell, V. Valtchev, Steve J. Young
ICASSP2
1995 Flexible speaker adaptation for large vocabulary speech recognition
Chris Leggetter, Philip C. Woodland
EUROSPEECH1
1995 Maximum likelihood linear regression for speaker adaptation of continuous density hidden Markov models
Chris Leggetter, Philip C. Woodland
Comput. Speech Lang.1
1994 Speaker adaptation of continuous density HMMs using multivariate linear regression
Chris Leggetter, Philip C. Woodland
ICSLP1