-
Bauckhage, C.: Marginalizing over the PageRank damping factor (2014)
0.01
0.009613066 = product of:
0.06729146 = sum of:
0.03364573 = weight(_text_:classification in 928) [ClassicSimilarity], result of:
0.03364573 = score(doc=928,freq=2.0), product of:
0.09562149 = queryWeight, product of:
3.1847067 = idf(docFreq=4974, maxDocs=44218)
0.03002521 = queryNorm
0.35186368 = fieldWeight in 928, product of:
1.4142135 = tf(freq=2.0), with freq of:
2.0 = termFreq=2.0
3.1847067 = idf(docFreq=4974, maxDocs=44218)
0.078125 = fieldNorm(doc=928)
0.03364573 = weight(_text_:classification in 928) [ClassicSimilarity], result of:
0.03364573 = score(doc=928,freq=2.0), product of:
0.09562149 = queryWeight, product of:
3.1847067 = idf(docFreq=4974, maxDocs=44218)
0.03002521 = queryNorm
0.35186368 = fieldWeight in 928, product of:
1.4142135 = tf(freq=2.0), with freq of:
2.0 = termFreq=2.0
3.1847067 = idf(docFreq=4974, maxDocs=44218)
0.078125 = fieldNorm(doc=928)
0.14285715 = coord(2/14)
- Abstract
- In this note, we show how to marginalize over the damping parameter of the PageRank equation so as to obtain a parameter-free version known as TotalRank. Our discussion is meant as a reference and intended to provide a guided tour towards an interesting result that has applications in information retrieval and classification.
-
Robertson, S.E.; Sparck Jones, K.: Simple, proven approaches to text retrieval (1997)
0.00
0.003560864 = product of:
0.04985209 = sum of:
0.04985209 = product of:
0.09970418 = sum of:
0.09970418 = weight(_text_:texts in 4532) [ClassicSimilarity], result of:
0.09970418 = score(doc=4532,freq=8.0), product of:
0.16460659 = queryWeight, product of:
5.4822793 = idf(docFreq=499, maxDocs=44218)
0.03002521 = queryNorm
0.605712 = fieldWeight in 4532, product of:
2.828427 = tf(freq=8.0), with freq of:
8.0 = termFreq=8.0
5.4822793 = idf(docFreq=499, maxDocs=44218)
0.0390625 = fieldNorm(doc=4532)
0.5 = coord(1/2)
0.071428575 = coord(1/14)
- Abstract
- This technical note describes straightforward techniques for document indexing and retrieval that have been solidly established through extensive testing and are easy to apply. They are useful for many different types of text material, are viable for very large files, and have the advantage that they do not require special skills or training for searching, but are easy for end users. The document and text retrieval methods described here have a sound theoretical basis, are well established by extensive testing, and the ideas involved are now implemented in some commercial retrieval systems. Testing in the last few years has, in particular, shown that the methods presented here work very well with full texts, not only title and abstracts, and with large files of texts containing three quarters of a million documents. These tests, the TREC Tests (see Harman 1993 - 1997; IP&M 1995), have been rigorous comparative evaluations involving many different approaches to information retrieval. These techniques depend an the use of simple terms for indexing both request and document texts; an term weighting exploiting statistical information about term occurrences; an scoring for request-document matching, using these weights, to obtain a ranked search output; and an relevance feedback to modify request weights or term sets in iterative searching. The normal implementation is via an inverted file organisation using a term list with linked document identifiers, plus counting data, and pointers to the actual texts. The user's request can be a word list, phrases, sentences or extended text.
-
Lewandowski, D.: How can library materials be ranked in the OPAC? (2009)
0.00
0.0017956087 = product of:
0.02513852 = sum of:
0.02513852 = weight(_text_:bibliographic in 2810) [ClassicSimilarity], result of:
0.02513852 = score(doc=2810,freq=2.0), product of:
0.11688946 = queryWeight, product of:
3.893044 = idf(docFreq=2449, maxDocs=44218)
0.03002521 = queryNorm
0.21506234 = fieldWeight in 2810, product of:
1.4142135 = tf(freq=2.0), with freq of:
2.0 = termFreq=2.0
3.893044 = idf(docFreq=2449, maxDocs=44218)
0.0390625 = fieldNorm(doc=2810)
0.071428575 = coord(1/14)
- Abstract
- Some Online Public Access Catalogues offer a ranking component. However, ranking there is merely text-based and is doomed to fail due to limited text in bibliographic data. The main assumption for the talk is that we are in a situation where the appropriate ranking factors for OPACs should be defined, while the implementation is no major problem. We must define what we want, and not so much focus on the technical work. Some deep thinking is necessary on the "perfect results set" and how we can achieve it through ranking. The talk presents a set of potential ranking factors and clustering possibilities for further discussion. A look at commercial Web search engines could provide us with ideas how ranking can be improved with additional factors. Search engines are way beyond pure text-based ranking and apply ranking factors in the groups like popularity, freshness, personalisation, etc. The talk describes the main factors used in search engines and how derivatives of these could be used for libraries' purposes. The goal of ranking is to provide the user with the best-suitable results on top of the results list. How can this goal be achieved with the library catalogue and also concerning the library's different collections and databases? The assumption is that ranking of such materials is a complex problem and is yet nowhere near solved. Libraries should focus on ranking to improve user experience.
