Combining implicit and explicit topic representations for result diversification

Result diversification deals with ambiguous or multi-faceted queries by providing documents that cover as many subtopics of a query as possible. Various approaches to subtopic modeling have been proposed. Subtopics have been extracted internally, e.g., from retrieved documents, and externally, e.g., from Web resources such as query logs. Internally modeled subtopics are often implicitly represented, e.g., as latent topics, while externally modeled subtopics are often explicitly represented, e.g., as reformulated queries. We propose a framework that: i) combines both implicitly and explicitly represented subtopics; and ii) allows flexible combination of multiple external resources in a transparent and unified manner. Specifically, we use a random walk based approach to estimate the similarities of the explicit subtopics mined from a number of heterogeneous resources: click logs, anchor text, and web n-grams. We then use these similarities to regularize the latent topics extracted from the top-ranked documents, i.e., the internal (implicit) subtopics. Empirical results show that regularization with explicit subtopics extracted from the right resource leads to improved diversification results, indicating that the proposed regularization with (explicit) external resources forms better (implicit) topic models. Click logs and anchor text are shown to be more effective resources than web n-grams under current experimental settings. Combining resources does not always lead to better results, but achieves a robust performance. This robustness is important for two reasons: it cannot be predicted which resources will be most effective for a given query, and it is not yet known how to reliably determine the optimal model parameters for building implicit topic models

Implicit relevance feedback from a multi-step search process: a use of query-logs

We evaluate the use of clickthrough information as implicit relevance feedback in sessions. We employ records of user interactions with a search system for pictures retrieval: issued queries, clicked images, and purchased content; we investigate whether and how much of the past search history should be used in a feedback loop. We also assess the benefit of using clicked data as positive tokens of relevance to the task of estimating the probability of an image to be purchased

Adapting Query Expansion to Search Proficiency

We argue that query expansion (QE) based on the full ses- sion improves the overall search experience provided that we know how to adapt the QE weighting schema to a user's search proficiency. We propose a strategy to predict search ability from session parameters. Us- ing an exponential model and these metrics we set user dependent QE coefficients. We evaluate this approach on TREC 2011 session track data