Proceedings of the 36th International ACM SIGIR Conference on Research and Development in Information Retrieval 2013
DOI: 10.1145/2484028.2484042
|View full text |Cite
|
Sign up to set email alerts
|

Ranking document clusters using markov random fields

Abstract: An important challenge in cluster-based document retrieval is ranking document clusters by their relevance to the query. We present a novel cluster ranking approach that utilizes Markov Random Fields (MRFs). MRFs enable the integration of various types of cluster-relevance evidence; e.g., the query-similarity values of the cluster's documents and queryindependent measures of the cluster. We use our method to re-rank an initially retrieved document list by ranking clusters that are created from the documents mo… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1
1

Citation Types

1
41
0

Year Published

2014
2014
2020
2020

Publication Types

Select...
3
2
2

Relationship

1
6

Authors

Journals

citations
Cited by 36 publications
(43 citation statements)
references
References 36 publications
1
41
0
Order By: Relevance
“…Interestingly, the significant improvements observed on the Robust-04 and GOV2 collections, are much lower on the Clueweb-09-Cat-B collection. The relatively low performance improvements with dependency models using the current Clueweb-09 queries has also been observed at TREC and in recent publications [4,23]. As more queries are developed for this corpus, we plan to study this issue further.…”
Section: Bi-term Dependency Model Comparisonmentioning
confidence: 67%
“…Interestingly, the significant improvements observed on the Robust-04 and GOV2 collections, are much lower on the Clueweb-09-Cat-B collection. The relatively low performance improvements with dependency models using the current Clueweb-09 queries has also been observed at TREC and in recent publications [4,23]. As more queries are developed for this corpus, we plan to study this issue further.…”
Section: Bi-term Dependency Model Comparisonmentioning
confidence: 67%
“…Recall that k is also the number of nearest neighbors in the NN cluster hypothesis test. Using such small overlapping clusters was shown to be highly effective, with respect to other clustering schemes, for cluster-based retrieval [4,11,7,14,15].…”
Section: Methodsmentioning
confidence: 99%
“…Document clusters can be created either in a query dependent manner, i.e., from the list of documents most highly ranked in response to a query [21] or in a query independent fashion from all the documents in a collection [5,10]. In this paper we study the correlation between cluster hypothesis tests and the effectiveness of retrieval methods that utilize query dependent clusters [6,7,15]. The reason is threefold.…”
Section: Related Workmentioning
confidence: 99%
See 2 more Smart Citations