Using temporal profiles of queries for precision prediction

Dı́az, Fernando; Jones, Rosie

doi:10.1145/1008992.1008998

Cited by 67 publications

(72 citation statements)

References 8 publications

Supporting

Mentioning

Contrasting

Unclassified

Order By: Relevance

“…Starting with identifying new events in event-based IR (Papka, 1999), accomplishments include a time-dependent language model to address the temporality of relevance (Li and Croft, 2003), and using timestamps on queries to assess average precision on the basis of time-dependent probability distributions (Diaz and Jones, 2004). In a similar vein, Krause et al (2006) have come up with a unified model of topic intensity tracking combined with document classification.…”

Section: Previous Researchmentioning

confidence: 99%

Demonstrating conceptual dynamics in an evolving text collection

Daranyi

Wittek

2013

J Am Soc Inf Sci Tec

View full text Add to dashboard Cite

Based on real world user demands, we demonstrate how animated visualisation of evolving text corpora displays the underlying dynamics of semantic content. To interpret the results, one needs a dynamic theory of word meaning. We suggest that conceptual dynamics as the interaction between kinds of intellectual, emotional etc. content, and language, is key for such a theory. We demonstrate our methodology by two-way seriation which is a popular technique to analyse groups of similar instances and their features, as well as the connections between the groups themselves. The two-way seriated data may be visualised as a two-dimensional heat map or as a three-dimensional landscape where colour codes or height correspond to the values in the matrix. In this paper we focus on two-way seriation of sparse data in the Reuters-21568 test collection. To achieve a meaningful visualisation thereof we introduce a compactly supported convolution kernel similar to filter kernels used in image reconstruction and geostatistics. This filter populates the high-dimensional sparse space with values that interpolate nearby elements, and provides insight into the clustering structure. We also extend two-way seriation to deal with online updates of both the row and column spaces, and, combined with the convolution kernel, demonstrate a three-dimensional visualisation of dynamics.

show abstract

Section: Previous Researchmentioning

confidence: 99%

Demonstrating conceptual dynamics in an evolving text collection

Daranyi

Wittek

2013

J Am Soc Inf Sci Tec

View full text Add to dashboard Cite

show abstract

“…Because of that, the clarity score method has been widely used for query performance prediction in the area. Some applications include query expansion (anticipating poorly performing queries as good candidates to be expanded), rank fusion, link extraction in topic detection and tracking [15], and document segmentation [8]. A prolific sequel of variants and enhancements on the notion of clarity followed the original works [8,11].…”

Section: Introductionmentioning

confidence: 99%

A Performance Prediction Approach to Enhance Collaborative Filtering Performance

Bellogín

Castells

2010

Lecture Notes in Computer Science

View full text Add to dashboard Cite

Esta es la versión de autor de la comunicación de congreso publicada en: This is an author produced version of a paper published in: Abstract. Performance prediction has gained increasing attention in the IR field since the half of the past decade and has become an established research topic in the field. The present work restates the problem in the area of Collaborative Filtering (CF), where it has barely been researched so far. We investigate the adaptation of clarity-based query performance predictors to predict neighbor performance in CF. A predictor is proposed and introduced in a kNN CF algorithm to produce a dynamic variant where neighbor ratings are weighted based on their predicted performance. The properties of the predictor are empirically studied by, first, checking the correlation of the predictor output with a proposed measure of neighbor performance. Then, the performance of the dynamic kNN variant is examined on different sparsity and neighborhood size conditions, where the variant consistently outperforms the baseline algorithm, with increasing difference on small neighborhoods.

show abstract

“…Because of that, the clarity score method has been widely used for query performance prediction in the area. Some applications include query expansion (anticipating poorly performing queries as good candidates to be expanded), rank aggregation, link extraction in topic detection and tracking [16], and document segmentation [8]. A prolific sequel of variants and enhancements on the notion of clarity followed the original works [8,11].…”

Section: Introductionmentioning

confidence: 99%

Predicting Neighbor Goodness in Collaborative Filtering

Bellogín

Castells

2009

Flexible Query Answering Systems

View full text Add to dashboard Cite

Esta es la versión de autor de la comunicación de congreso publicada en: This is an author produced version of a paper published in: Abstract. Performance prediction has gained increasing attention in the IR field since the half of the past decade and has become an established research topic in the field. The present work restates the problem in the subarea of Collaborative Filtering (CF), where it has barely been researched so far. We investigate the adaptation of clarity-based query performance predictors to define predictors of neighbor performance in CF. The proposed predictors are introduced in a memory-based CF algorithm to produce a dynamic variant where neighbor ratings are weighted based on their predicted performance. The approach is tested with encouraging empirical results, as the dynamic variants consistently outperform the baseline algorithms, with increasing difference on small neighborhoods.

show abstract

Using temporal profiles of queries for precision prediction

Cited by 67 publications

References 8 publications

Demonstrating conceptual dynamics in an evolving text collection

Demonstrating conceptual dynamics in an evolving text collection

A Performance Prediction Approach to Enhance Collaborative Filtering Performance

Predicting Neighbor Goodness in Collaborative Filtering

Contact Info

Product

Resources

About