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

Nazan Khan

dblp:92/3234 · DBLP profile ↗
← Back
3ranked-venue papers
1as first author
0since 2021 · last 2010
—ORCID · none

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

Artificial intelligence and machine learning · 2 · 1 first-authorDatabases, data management, data science and information retrieval · 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
2 papers
Information retrieval · 82% Recommender systems · 18%
Artificial intelligence
1 paper
Transfer learning and domain adaptation · 77% Kernel, tree and ensemble methods · 23%

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

TopicWeightPapersLastEvidence papers
Information retrieval › ranking
learning to rank
0.112010
How good is a span of terms?: exploiting proximity to improve web retrieval · SIGIR 2010
Information retrieval › ranking › search ranking
proximity ranking
0.112010
How good is a span of terms?: exploiting proximity to improve web retrieval · SIGIR 2010
Information retrieval
ranking
0.112010
How good is a span of terms?: exploiting proximity to improve web retrieval · SIGIR 2010
Machine learning › Transfer learning and domain adaptation › model adaptation
model interpolation
0.112009
Model Adaptation via Model Interpolation and Boosting for Web Search Ranking · EMNLP 2009
Recommender systems
model update
0.112009
Model Adaptation via Model Interpolation and Boosting for Web Search Ranking · EMNLP 2009
Information retrieval › web search
web search ranking
0.112009
Model Adaptation via Model Interpolation and Boosting for Web Search Ranking · EMNLP 2009
Machine learning › Kernel, tree and ensemble methods › ensemble learning
boosting
0.012009
Model Adaptation via Model Interpolation and Boosting for Web Search Ranking · EMNLP 2009

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

model interpolation · 0.2boosting · 0.2proximity features · 0.1phrase features · 0.1machine learning ranking · 0.1
YearPublicationVenuePosition
2010 How good is a span of terms?: exploiting proximity to improve web retrieval
abstract
Ranking search results is a fundamental problem in information retrieval. In this paper we explore whether the use of proximity and phrase information can improve web retrieval accuracy. We build on existing research by incorporating novel ranking features based on flexible proximity terms with recent state-of-the-art machine learning ranking models. We introduce a method of determining the goodness of a set of proximity terms that takes advantage of the structured nature of web documents, document metadata, and phrasal information from search engine user query logs. We perform experiments on a large real-world Web data collection and show that using the goodness score of flexible proximity terms can improve ranking accuracy over state-of-the-art ranking methods by as much as 13%. We also show that we can improve accuracy on the hardest queries by as much as 9% relative to state-of-the-art approaches.
Krysta M. Svore, Pallika H. Kanani, Nazan Khan
SIGIR3
2009 Model Adaptation via Model Interpolation and Boosting for Web Search Ranking
Jianfeng Gao 0001, Christopher J. C. Burges, Krysta M. Svore, Nazan Khan, Shalin Shah
EMNLP6
2002 Multiple-objective Bayesian Optimization Algorithm
Nazan Khan, David E. Goldberg, Martin Pelikan
GECCO1