-
Ye, Z.; He, B.; Wang, L.; Luo, T.: Utilizing term proximity for blog post retrieval (2013)
0.01
0.005731291 = product of:
0.017193872 = sum of:
0.017193872 = product of:
0.051581617 = sum of:
0.051581617 = weight(_text_:retrieval in 1126) [ClassicSimilarity], result of:
0.051581617 = score(doc=1126,freq=8.0), product of:
0.15433937 = queryWeight, product of:
3.024915 = idf(docFreq=5836, maxDocs=44218)
0.051022716 = queryNorm
0.33420905 = fieldWeight in 1126, product of:
2.828427 = tf(freq=8.0), with freq of:
8.0 = termFreq=8.0
3.024915 = idf(docFreq=5836, maxDocs=44218)
0.0390625 = fieldNorm(doc=1126)
0.33333334 = coord(1/3)
0.33333334 = coord(1/3)
- Abstract
- Term proximity is effective for many information retrieval (IR) research fields yet remains unexplored in blogosphere IR. The blogosphere is characterized by large amounts of noise, including incohesive, off-topic content and spam. Consequently, the classical bag-of-words unigram IR models are not reliable enough to provide robust and effective retrieval performance. In this article, we propose to boost the blog postretrieval performance by employing term proximity information. We investigate a variety of popular and state-of-the-art proximity-based statistical IR models, including a proximity-based counting model, the Markov random field (MRF) model, and the divergence from randomness (DFR) multinomial model. Extensive experimentation on the standard TREC Blog06 test dataset demonstrates that the introduction of term proximity information is indeed beneficial to retrieval from the blogosphere. Results also indicate the superiority of the unordered bi-gram model with the sequential-dependence phrases over other variants of the proximity-based models. Finally, inspired by the effectiveness of proximity models, we extend our study by exploring the proximity evidence between query terms and opinionated terms. The consequent opinionated proximity model shows promising performance in the experiments.
-
Ye, Z.; Huang, J.X.; He, B.; Lin, H.: Mining a multilingual association dictionary from Wikipedia for cross-language information retrieval (2012)
0.00
0.0049634436 = product of:
0.014890331 = sum of:
0.014890331 = product of:
0.04467099 = sum of:
0.04467099 = weight(_text_:retrieval in 513) [ClassicSimilarity], result of:
0.04467099 = score(doc=513,freq=6.0), product of:
0.15433937 = queryWeight, product of:
3.024915 = idf(docFreq=5836, maxDocs=44218)
0.051022716 = queryNorm
0.28943354 = fieldWeight in 513, product of:
2.4494898 = tf(freq=6.0), with freq of:
6.0 = termFreq=6.0
3.024915 = idf(docFreq=5836, maxDocs=44218)
0.0390625 = fieldNorm(doc=513)
0.33333334 = coord(1/3)
0.33333334 = coord(1/3)
- Abstract
- Wikipedia is characterized by its dense link structure and a large number of articles in different languages, which make it a notable Web corpus for knowledge extraction and mining, in particular for mining the multilingual associations. In this paper, motivated by a psychological theory of word meaning, we propose a graph-based approach to constructing a cross-language association dictionary (CLAD) from Wikipedia, which can be used in a variety of cross-language accessing and processing applications. In order to evaluate the quality of the mined CLAD, and to demonstrate how the mined CLAD can be used in practice, we explore two different applications of the mined CLAD to cross-language information retrieval (CLIR). First, we use the mined CLAD to conduct cross-language query expansion; and, second, we use it to filter out translation candidates with low translation probabilities. Experimental results on a variety of standard CLIR test collections show that the CLIR retrieval performance can be substantially improved with the above two applications of CLAD, which indicates that the mined CLAD is of sound quality.
-
Ye, Z.; Huang, J.X.; Lin, H.: Finding a good query-related topic for boosting pseudo-relevance feedback (2011)
0.00
0.004052635 = product of:
0.012157904 = sum of:
0.012157904 = product of:
0.03647371 = sum of:
0.03647371 = weight(_text_:retrieval in 4372) [ClassicSimilarity], result of:
0.03647371 = score(doc=4372,freq=4.0), product of:
0.15433937 = queryWeight, product of:
3.024915 = idf(docFreq=5836, maxDocs=44218)
0.051022716 = queryNorm
0.23632148 = fieldWeight in 4372, product of:
2.0 = tf(freq=4.0), with freq of:
4.0 = termFreq=4.0
3.024915 = idf(docFreq=5836, maxDocs=44218)
0.0390625 = fieldNorm(doc=4372)
0.33333334 = coord(1/3)
0.33333334 = coord(1/3)
- Abstract
- Pseudo-relevance feedback (PRF) via query expansion (QE) assumes that the top-ranked documents from the first-pass retrieval are relevant. The most informative terms in the pseudo-relevant feedback documents are then used to update the original query representation in order to boost the retrieval performance. Most current PRF approaches estimate the importance of the candidate expansion terms based on their statistics on document level. However, a document for PRF may consist of different topics, which may not be all related to the query even if the document is judged relevant. The main argument of this article is the proposal to conduct PRF on a granularity smaller than on the document level. In this article, we propose a topic-based feedback model with three different strategies for finding a good query-related topic based on the Latent Dirichlet Allocation model. The experimental results on four representative TREC collections show that QE based on the derived topic achieves statistically significant improvements over a strong feedback model in the language modeling framework, which updates the query representation based on the top-ranked documents.
-
Ye, Z.; Huang, J.X.: ¬A learning to rank approach for quality-aware pseudo-relevance feedback (2016)
0.00
0.004052635 = product of:
0.012157904 = sum of:
0.012157904 = product of:
0.03647371 = sum of:
0.03647371 = weight(_text_:retrieval in 2855) [ClassicSimilarity], result of:
0.03647371 = score(doc=2855,freq=4.0), product of:
0.15433937 = queryWeight, product of:
3.024915 = idf(docFreq=5836, maxDocs=44218)
0.051022716 = queryNorm
0.23632148 = fieldWeight in 2855, product of:
2.0 = tf(freq=4.0), with freq of:
4.0 = termFreq=4.0
3.024915 = idf(docFreq=5836, maxDocs=44218)
0.0390625 = fieldNorm(doc=2855)
0.33333334 = coord(1/3)
0.33333334 = coord(1/3)
- Abstract
- Pseudo relevance feedback (PRF) has shown to be effective in ad hoc information retrieval. In traditional PRF methods, top-ranked documents are all assumed to be relevant and therefore treated equally in the feedback process. However, the performance gain brought by each document is different as showed in our preliminary experiments. Thus, it is more reasonable to predict the performance gain brought by each candidate feedback document in the process of PRF. We define the quality level (QL) and then use this information to adjust the weights of feedback terms in these documents. Unlike previous work, we do not make any explicit relevance assumption and we go beyond just selecting "good" documents for PRF. We propose a quality-based PRF framework, in which two quality-based assumptions are introduced. Particularly, two different strategies, relevance-based QL (RelPRF) and improvement-based QL (ImpPRF) are presented to estimate the QL of each feedback document. Based on this, we select a set of heterogeneous document-level features and apply a learning approach to evaluate the QL of each feedback document. Extensive experiments on standard TREC (Text REtrieval Conference) test collections show that our proposed model performs robustly and outperforms strong baselines significantly.
