-
Lalmas, M.: XML retrieval (2009)
0.00
0.0031212184 = product of:
0.012484874 = sum of:
0.012484874 = product of:
0.03745462 = sum of:
0.03745462 = weight(_text_:k in 4998) [ClassicSimilarity], result of:
0.03745462 = score(doc=4998,freq=4.0), product of:
0.13429943 = queryWeight, product of:
3.569778 = idf(docFreq=3384, maxDocs=44218)
0.037621226 = queryNorm
0.2788889 = fieldWeight in 4998, product of:
2.0 = tf(freq=4.0), with freq of:
4.0 = termFreq=4.0
3.569778 = idf(docFreq=3384, maxDocs=44218)
0.0390625 = fieldNorm(doc=4998)
0.33333334 = coord(1/3)
0.25 = coord(1/4)
- Classification
- BCA (FH K)
- GHBS
- BCA (FH K)
-
Sparck Jones, K.: ¬A statistical interpretation of term specificity and its application in retrieval (2004)
0.00
0.0030898487 = product of:
0.012359395 = sum of:
0.012359395 = product of:
0.037078183 = sum of:
0.037078183 = weight(_text_:k in 4420) [ClassicSimilarity], result of:
0.037078183 = score(doc=4420,freq=2.0), product of:
0.13429943 = queryWeight, product of:
3.569778 = idf(docFreq=3384, maxDocs=44218)
0.037621226 = queryNorm
0.27608594 = fieldWeight in 4420, product of:
1.4142135 = tf(freq=2.0), with freq of:
2.0 = termFreq=2.0
3.569778 = idf(docFreq=3384, maxDocs=44218)
0.0546875 = fieldNorm(doc=4420)
0.33333334 = coord(1/3)
0.25 = coord(1/4)
-
Weller, K.; Stock, W.G.: Transitive meronymy : automatic concept-based query expansion using weighted transitive part-whole relations (2008)
0.00
0.0030898487 = product of:
0.012359395 = sum of:
0.012359395 = product of:
0.037078183 = sum of:
0.037078183 = weight(_text_:k in 1835) [ClassicSimilarity], result of:
0.037078183 = score(doc=1835,freq=2.0), product of:
0.13429943 = queryWeight, product of:
3.569778 = idf(docFreq=3384, maxDocs=44218)
0.037621226 = queryNorm
0.27608594 = fieldWeight in 1835, product of:
1.4142135 = tf(freq=2.0), with freq of:
2.0 = termFreq=2.0
3.569778 = idf(docFreq=3384, maxDocs=44218)
0.0546875 = fieldNorm(doc=1835)
0.33333334 = coord(1/3)
0.25 = coord(1/4)
-
Maron, M.E.; Kuhns, I.L.: On relevance, probabilistic indexing and information retrieval (1960)
0.00
0.0022070347 = product of:
0.008828139 = sum of:
0.008828139 = product of:
0.026484415 = sum of:
0.026484415 = weight(_text_:k in 1928) [ClassicSimilarity], result of:
0.026484415 = score(doc=1928,freq=2.0), product of:
0.13429943 = queryWeight, product of:
3.569778 = idf(docFreq=3384, maxDocs=44218)
0.037621226 = queryNorm
0.19720423 = fieldWeight in 1928, product of:
1.4142135 = tf(freq=2.0), with freq of:
2.0 = termFreq=2.0
3.569778 = idf(docFreq=3384, maxDocs=44218)
0.0390625 = fieldNorm(doc=1928)
0.33333334 = coord(1/3)
0.25 = coord(1/4)
- Footnote
- Wiederabgedruckt in: Readings in information retrieval. Ed.: K. Sparck Jones u. P. Willett. San Francisco: Morgan Kaufmann 1997. S.39-46.
-
Kantor, P.; Kim, M.H.; Ibraev, U.; Atasoy, K.: Estimating the number of relevant documents in enormous collections (1999)
0.00
0.0022070347 = product of:
0.008828139 = sum of:
0.008828139 = product of:
0.026484415 = sum of:
0.026484415 = weight(_text_:k in 6690) [ClassicSimilarity], result of:
0.026484415 = score(doc=6690,freq=2.0), product of:
0.13429943 = queryWeight, product of:
3.569778 = idf(docFreq=3384, maxDocs=44218)
0.037621226 = queryNorm
0.19720423 = fieldWeight in 6690, product of:
1.4142135 = tf(freq=2.0), with freq of:
2.0 = termFreq=2.0
3.569778 = idf(docFreq=3384, maxDocs=44218)
0.0390625 = fieldNorm(doc=6690)
0.33333334 = coord(1/3)
0.25 = coord(1/4)
-
Sormunen, E.; Kekäläinen, J.; Koivisto, J.; Järvelin, K.: Document text characteristics affect the ranking of the most relevant documents by expanded structured queries (2001)
0.00
0.0022070347 = product of:
0.008828139 = sum of:
0.008828139 = product of:
0.026484415 = sum of:
0.026484415 = weight(_text_:k in 4487) [ClassicSimilarity], result of:
0.026484415 = score(doc=4487,freq=2.0), product of:
0.13429943 = queryWeight, product of:
3.569778 = idf(docFreq=3384, maxDocs=44218)
0.037621226 = queryNorm
0.19720423 = fieldWeight in 4487, product of:
1.4142135 = tf(freq=2.0), with freq of:
2.0 = termFreq=2.0
3.569778 = idf(docFreq=3384, maxDocs=44218)
0.0390625 = fieldNorm(doc=4487)
0.33333334 = coord(1/3)
0.25 = coord(1/4)
-
Robertson, S.E.; Sparck Jones, K.: Simple, proven approaches to text retrieval (1997)
0.00
0.0022070347 = product of:
0.008828139 = sum of:
0.008828139 = product of:
0.026484415 = sum of:
0.026484415 = weight(_text_:k in 4532) [ClassicSimilarity], result of:
0.026484415 = score(doc=4532,freq=2.0), product of:
0.13429943 = queryWeight, product of:
3.569778 = idf(docFreq=3384, maxDocs=44218)
0.037621226 = queryNorm
0.19720423 = fieldWeight in 4532, product of:
1.4142135 = tf(freq=2.0), with freq of:
2.0 = termFreq=2.0
3.569778 = idf(docFreq=3384, maxDocs=44218)
0.0390625 = fieldNorm(doc=4532)
0.33333334 = coord(1/3)
0.25 = coord(1/4)
-
Chen, Z.; Fu, B.: On the complexity of Rocchio's similarity-based relevance feedback algorithm (2007)
0.00
0.0022070347 = product of:
0.008828139 = sum of:
0.008828139 = product of:
0.026484415 = sum of:
0.026484415 = weight(_text_:k in 578) [ClassicSimilarity], result of:
0.026484415 = score(doc=578,freq=2.0), product of:
0.13429943 = queryWeight, product of:
3.569778 = idf(docFreq=3384, maxDocs=44218)
0.037621226 = queryNorm
0.19720423 = fieldWeight in 578, product of:
1.4142135 = tf(freq=2.0), with freq of:
2.0 = termFreq=2.0
3.569778 = idf(docFreq=3384, maxDocs=44218)
0.0390625 = fieldNorm(doc=578)
0.33333334 = coord(1/3)
0.25 = coord(1/4)
- Abstract
- Rocchio's similarity-based relevance feedback algorithm, one of the most important query reformation methods in information retrieval, is essentially an adaptive learning algorithm from examples in searching for documents represented by a linear classifier. Despite its popularity in various applications, there is little rigorous analysis of its learning complexity in literature. In this article, the authors prove for the first time that the learning complexity of Rocchio's algorithm is O(d + d**2(log d + log n)) over the discretized vector space {0, ... , n - 1 }**d when the inner product similarity measure is used. The upper bound on the learning complexity for searching for documents represented by a monotone linear classifier (q, 0) over {0, ... , n - 1 }d can be improved to, at most, 1 + 2k (n - 1) (log d + log(n - 1)), where k is the number of nonzero components in q. Several lower bounds on the learning complexity are also obtained for Rocchio's algorithm. For example, the authors prove that Rocchio's algorithm has a lower bound Omega((d über 2)log n) on its learning complexity over the Boolean vector space {0,1}**d.
-
Tsai, C.-F.; Hu, Y.-H.; Chen, Z.-Y.: Factors affecting rocchio-based pseudorelevance feedback in image retrieval (2015)
0.00
0.0022070347 = product of:
0.008828139 = sum of:
0.008828139 = product of:
0.026484415 = sum of:
0.026484415 = weight(_text_:k in 1607) [ClassicSimilarity], result of:
0.026484415 = score(doc=1607,freq=2.0), product of:
0.13429943 = queryWeight, product of:
3.569778 = idf(docFreq=3384, maxDocs=44218)
0.037621226 = queryNorm
0.19720423 = fieldWeight in 1607, product of:
1.4142135 = tf(freq=2.0), with freq of:
2.0 = termFreq=2.0
3.569778 = idf(docFreq=3384, maxDocs=44218)
0.0390625 = fieldNorm(doc=1607)
0.33333334 = coord(1/3)
0.25 = coord(1/4)
- Abstract
- Pseudorelevance feedback (PRF) was proposed to solve the limitation of relevance feedback (RF), which is based on the user-in-the-loop process. In PRF, the top-k retrieved images are regarded as PRF. Although the PRF set contains noise, PRF has proven effective for automatically improving the overall retrieval result. To implement PRF, the Rocchio algorithm has been considered as a reasonable and well-established baseline. However, the performance of Rocchio-based PRF is subject to various representation choices (or factors). In this article, we examine these factors that affect the performance of Rocchio-based PRF, including image-feature representation, the number of top-ranked images, the weighting parameters of Rocchio, and similarity measure. We offer practical insights on how to optimize the performance of Rocchio-based PRF by choosing appropriate representation choices. Our extensive experiments on NUS-WIDE-LITE and Caltech 101 + Corel 5000 data sets show that the optimal feature representation is color moment + wavelet texture in terms of retrieval efficiency and effectiveness. Other representation choices are that using top-20 ranked images as pseudopositive and pseudonegative feedback sets with the equal weight (i.e., 0.5) by the correlation and cosine distance functions can produce the optimal retrieval result.
-
Bhansali, D.; Desai, H.; Deulkar, K.: ¬A study of different ranking approaches for semantic search (2015)
0.00
0.0022070347 = product of:
0.008828139 = sum of:
0.008828139 = product of:
0.026484415 = sum of:
0.026484415 = weight(_text_:k in 2696) [ClassicSimilarity], result of:
0.026484415 = score(doc=2696,freq=2.0), product of:
0.13429943 = queryWeight, product of:
3.569778 = idf(docFreq=3384, maxDocs=44218)
0.037621226 = queryNorm
0.19720423 = fieldWeight in 2696, product of:
1.4142135 = tf(freq=2.0), with freq of:
2.0 = termFreq=2.0
3.569778 = idf(docFreq=3384, maxDocs=44218)
0.0390625 = fieldNorm(doc=2696)
0.33333334 = coord(1/3)
0.25 = coord(1/4)
-
Hubert, G.; Pitarch, Y.; Pinel-Sauvagnat, K.; Tournier, R.; Laporte, L.: TournaRank : when retrieval becomes document competition (2018)
0.00
0.0022070347 = product of:
0.008828139 = sum of:
0.008828139 = product of:
0.026484415 = sum of:
0.026484415 = weight(_text_:k in 5087) [ClassicSimilarity], result of:
0.026484415 = score(doc=5087,freq=2.0), product of:
0.13429943 = queryWeight, product of:
3.569778 = idf(docFreq=3384, maxDocs=44218)
0.037621226 = queryNorm
0.19720423 = fieldWeight in 5087, product of:
1.4142135 = tf(freq=2.0), with freq of:
2.0 = termFreq=2.0
3.569778 = idf(docFreq=3384, maxDocs=44218)
0.0390625 = fieldNorm(doc=5087)
0.33333334 = coord(1/3)
0.25 = coord(1/4)
-
Cross-language information retrieval (1998)
0.00
0.0011035174 = product of:
0.0044140695 = sum of:
0.0044140695 = product of:
0.0132422075 = sum of:
0.0132422075 = weight(_text_:k in 6299) [ClassicSimilarity], result of:
0.0132422075 = score(doc=6299,freq=2.0), product of:
0.13429943 = queryWeight, product of:
3.569778 = idf(docFreq=3384, maxDocs=44218)
0.037621226 = queryNorm
0.098602116 = fieldWeight in 6299, product of:
1.4142135 = tf(freq=2.0), with freq of:
2.0 = termFreq=2.0
3.569778 = idf(docFreq=3384, maxDocs=44218)
0.01953125 = fieldNorm(doc=6299)
0.33333334 = coord(1/3)
0.25 = coord(1/4)
- Content
- Enthält die Beiträge: GREFENSTETTE, G.: The Problem of Cross-Language Information Retrieval; DAVIS, M.W.: On the Effective Use of Large Parallel Corpora in Cross-Language Text Retrieval; BALLESTEROS, L. u. W.B. CROFT: Statistical Methods for Cross-Language Information Retrieval; Distributed Cross-Lingual Information Retrieval; Automatic Cross-Language Information Retrieval Using Latent Semantic Indexing; EVANS, D.A. u.a.: Mapping Vocabularies Using Latent Semantics; PICCHI, E. u. C. PETERS: Cross-Language Information Retrieval: A System for Comparable Corpus Querying; YAMABANA, K. u.a.: A Language Conversion Front-End for Cross-Language Information Retrieval; GACHOT, D.A. u.a.: The Systran NLP Browser: An Application of Machine Translation Technology in Cross-Language Information Retrieval; HULL, D.: A Weighted Boolean Model for Cross-Language Text Retrieval; SHERIDAN, P. u.a. Building a Large Multilingual Test Collection from Comparable News Documents; OARD; D.W. u. B.J. DORR: Evaluating Cross-Language Text Filtering Effectiveness
