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

Wiley Greiner

dblp:34/3861 · DBLP profile ↗
← Back
3ranked-venue papers
0as first author
0since 2021 · last 2009
—ORCID · none

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

Artificial intelligence and machine learning · 2Databases, data management, data science and information retrieval · 1Applied, 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.

Artificial intelligence
2 papers
Learning theory · 75% Information extraction and text analysis · 25%
Databases, data mining, and information retrieval
1 paper
Information retrieval · 100%

Topics — the 6 heaviest of 7, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Machine learning › Learning theory
online learning
0.112009
Learning When Concepts Abound · J. Mach. Learn. Res. 2009
Natural language and speech › Information extraction and text analysis › lexical semantics › lexicon learning
semantic class induction
0.112006
N Semantic Classes are Harder than Two · ACL 2006
Information retrieval
query processing
0.112006
Generating query substitutions · WWW 2006
Information retrieval › query reformulation
query substitution
0.112006
Generating query substitutions · WWW 2006
Information retrieval
query suggestion
0.112006
Generating query substitutions · WWW 2006
Information retrieval › online advertising
sponsored search
0.012006
Generating query substitutions · WWW 2006

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

human relevance judgments · 0.1feature-based candidate selection · 0.1clustering · 0.1
YearPublicationVenuePosition
2009 Learning When Concepts Abound
Omid Madani, Michael Connor, Wiley Greiner
J. Mach. Learn. Res.3
2006 N Semantic Classes are Harder than Two
Ben Carterette, Rosie Jones, Wiley Greiner, Cory Barr
ACL3
2006 Generating query substitutions
abstract
We introduce the notion of query substitution, that is, generating a new query to replace a user’s original search query. Our technique uses modifications based on typical substitutions web searchers make to their queries. In this way the new query is strongly related to the original query, containing terms closely related to all of the original terms. This contrasts with query expansion through pseudo-relevance feedback, which is costly and can lead to query drift. This also contrasts with query relaxation through boolean or TFIDF retrieval, which reduces the specificity of the query. We define a scale for evaluating query substitution, and show that our method performs well at generating new queries related to the original queries. We build a model for selecting between candidates, by using a number of features relating the query-candidate pair, and by fitting the model to human judgments of relevance of query suggestions. This further improves the quality of the candidates generated. Experiments show that our techniques significantly increase coverage and effectiveness in the setting of sponsored search.
Rosie Jones, Benjamin Rey, Omid Madani, Wiley Greiner
WWW4