-
Efthimiadis, E.N.: User choices : a new yardstick for the evaluation of ranking algorithms for interactive query expansion (1995)
0.05
0.047970545 = product of:
0.14391163 = sum of:
0.13544871 = weight(_text_:ranking in 5697) [ClassicSimilarity], result of:
0.13544871 = score(doc=5697,freq=10.0), product of:
0.20271951 = queryWeight, product of:
5.4090285 = idf(docFreq=537, maxDocs=44218)
0.03747799 = queryNorm
0.66815823 = fieldWeight in 5697, product of:
3.1622777 = tf(freq=10.0), with freq of:
10.0 = termFreq=10.0
5.4090285 = idf(docFreq=537, maxDocs=44218)
0.0390625 = fieldNorm(doc=5697)
0.008462917 = product of:
0.025388751 = sum of:
0.025388751 = weight(_text_:22 in 5697) [ClassicSimilarity], result of:
0.025388751 = score(doc=5697,freq=2.0), product of:
0.13124153 = queryWeight, product of:
3.5018296 = idf(docFreq=3622, maxDocs=44218)
0.03747799 = queryNorm
0.19345059 = fieldWeight in 5697, product of:
1.4142135 = tf(freq=2.0), with freq of:
2.0 = termFreq=2.0
3.5018296 = idf(docFreq=3622, maxDocs=44218)
0.0390625 = fieldNorm(doc=5697)
0.33333334 = coord(1/3)
0.33333334 = coord(2/6)
- Abstract
- The performance of 8 ranking algorithms was evaluated with respect to their effectiveness in ranking terms for query expansion. The evaluation was conducted within an investigation of interactive query expansion and relevance feedback in a real operational environment. Focuses on the identification of algorithms that most effectively take cognizance of user preferences. user choices (i.e. the terms selected by the searchers for the query expansion search) provided the yardstick for the evaluation of the 8 ranking algorithms. This methodology introduces a user oriented approach in evaluating ranking algorithms for query expansion in contrast to the standard, system oriented approaches. Similarities in the performance of the 8 algorithms and the ways these algorithms rank terms were the main focus of this evaluation. The findings demonstrate that the r-lohi, wpq, enim, and porter algorithms have similar performance in bringing good terms to the top of a ranked list of terms for query expansion. However, further evaluation of the algorithms in different (e.g. full text) environments is needed before these results can be generalized beyond the context of the present study
- Date
- 22. 2.1996 13:14:10
-
Chang, C.-H.; Hsu, C.-C.: Integrating query expansion and conceptual relevance feedback for personalized Web information retrieval (1998)
0.03
0.032217465 = product of:
0.09665239 = sum of:
0.084804304 = weight(_text_:ranking in 1319) [ClassicSimilarity], result of:
0.084804304 = score(doc=1319,freq=2.0), product of:
0.20271951 = queryWeight, product of:
5.4090285 = idf(docFreq=537, maxDocs=44218)
0.03747799 = queryNorm
0.4183332 = fieldWeight in 1319, product of:
1.4142135 = tf(freq=2.0), with freq of:
2.0 = termFreq=2.0
5.4090285 = idf(docFreq=537, maxDocs=44218)
0.0546875 = fieldNorm(doc=1319)
0.011848084 = product of:
0.03554425 = sum of:
0.03554425 = weight(_text_:22 in 1319) [ClassicSimilarity], result of:
0.03554425 = score(doc=1319,freq=2.0), product of:
0.13124153 = queryWeight, product of:
3.5018296 = idf(docFreq=3622, maxDocs=44218)
0.03747799 = queryNorm
0.2708308 = fieldWeight in 1319, product of:
1.4142135 = tf(freq=2.0), with freq of:
2.0 = termFreq=2.0
3.5018296 = idf(docFreq=3622, maxDocs=44218)
0.0546875 = fieldNorm(doc=1319)
0.33333334 = coord(1/3)
0.33333334 = coord(2/6)
- Abstract
- Keyword based querying has been an immediate and efficient way to specify and retrieve related information that the user inquired. However, conventional document ranking based on an automatic assessment of document relevance to the query may not be the best approach when little information is given. Proposes an idea to integrate 2 existing techniques, query expansion and relevance feedback to achieve a concept-based information search for the Web
- Date
- 1. 8.1996 22:08:06
-
Robertson, S.E.: OKAPI at TREC-3 (1995)
0.01
0.014134051 = product of:
0.084804304 = sum of:
0.084804304 = weight(_text_:ranking in 5694) [ClassicSimilarity], result of:
0.084804304 = score(doc=5694,freq=2.0), product of:
0.20271951 = queryWeight, product of:
5.4090285 = idf(docFreq=537, maxDocs=44218)
0.03747799 = queryNorm
0.4183332 = fieldWeight in 5694, product of:
1.4142135 = tf(freq=2.0), with freq of:
2.0 = termFreq=2.0
5.4090285 = idf(docFreq=537, maxDocs=44218)
0.0546875 = fieldNorm(doc=5694)
0.16666667 = coord(1/6)
- Abstract
- Reports text information retrieval experiments performed as part of the 3 rd round of Text Retrieval Conferences (TREC) using the Okapi online catalogue system at City University, UK. The emphasis in TREC-3 was: further refinement of term weighting functions; an investigation of run time passage determination and searching; expansion of ad hoc queries by terms extracted from the top documents retrieved by a trial search; new methods for choosing query expansion terms after relevance feedback, now split into methods of ranking terms prior to selection and subsequent selection procedures; and the development of a user interface procedure within the new TREC interactive search framework
-
Poynder, R.: Web research engines? (1996)
0.01
0.0121149 = product of:
0.0726894 = sum of:
0.0726894 = weight(_text_:ranking in 5698) [ClassicSimilarity], result of:
0.0726894 = score(doc=5698,freq=2.0), product of:
0.20271951 = queryWeight, product of:
5.4090285 = idf(docFreq=537, maxDocs=44218)
0.03747799 = queryNorm
0.35857132 = fieldWeight in 5698, product of:
1.4142135 = tf(freq=2.0), with freq of:
2.0 = termFreq=2.0
5.4090285 = idf(docFreq=537, maxDocs=44218)
0.046875 = fieldNorm(doc=5698)
0.16666667 = coord(1/6)
- Abstract
- Describes the shortcomings of search engines for the WWW comparing their current capabilities to those of the first generation CD-ROM products. Some allow phrase searching and most are improving their Boolean searching. Few allow truncation, wild cards or nested logic. They are stateless, losing previous search criteria. Unlike the indexing and classification systems for today's CD-ROMs, those for Web pages are random, unstructured and of variable quality. Considers that at best Web search engines can only offer free text searching. Discusses whether automatic data classification systems such as Infoseek Ultra can overcome the haphazard nature of the Web with neural network technology, and whether Boolean search techniques may be redundant when replaced by technology such as the Euroferret search engine. However, artificial intelligence is rarely successful on huge, varied databases. Relevance ranking and automatic query expansion still use the same simple inverted indexes. Most Web search engines do nothing more than word counting. Further complications arise with foreign languages
-
Schwartz, C.: Web search engines (1998)
0.01
0.0121149 = product of:
0.0726894 = sum of:
0.0726894 = weight(_text_:ranking in 5700) [ClassicSimilarity], result of:
0.0726894 = score(doc=5700,freq=2.0), product of:
0.20271951 = queryWeight, product of:
5.4090285 = idf(docFreq=537, maxDocs=44218)
0.03747799 = queryNorm
0.35857132 = fieldWeight in 5700, product of:
1.4142135 = tf(freq=2.0), with freq of:
2.0 = termFreq=2.0
5.4090285 = idf(docFreq=537, maxDocs=44218)
0.046875 = fieldNorm(doc=5700)
0.16666667 = coord(1/6)
- Abstract
- This reviews looks briefly at the history of WWW search engine development, considers the current state of affairs, and reflects on the future. Networked discovery tools have evolved along with Internet resource availability. WWW search engines display some complexity in their variety, content, resource acquisition strategies, and in the array of tools the deploy to assist users. A small but growing body of evaluation literature, much of it not systematic in nature, indicates that performance effectiveness is difficult to assess in this setting. Significant improvements in general-content search engine retrieval and ranking performance may not be possible, and are probalby not worth the effort, although search engine providers have introduced some rudimentary attempts at personalization, summarization, and query expansion. The shift to distributed search across multitype database systems could extend general networked discovery and retrieval to include smaller resource collections with rich metadata and navigation tools
-
Jarvelin, K.: ¬A deductive data model for thesaurus navigation and query expansion (1996)
0.00
0.0022772634 = product of:
0.013663581 = sum of:
0.013663581 = product of:
0.04099074 = sum of:
0.04099074 = weight(_text_:29 in 5625) [ClassicSimilarity], result of:
0.04099074 = score(doc=5625,freq=2.0), product of:
0.13183585 = queryWeight, product of:
3.5176873 = idf(docFreq=3565, maxDocs=44218)
0.03747799 = queryNorm
0.31092256 = fieldWeight in 5625, product of:
1.4142135 = tf(freq=2.0), with freq of:
2.0 = termFreq=2.0
3.5176873 = idf(docFreq=3565, maxDocs=44218)
0.0625 = fieldNorm(doc=5625)
0.33333334 = coord(1/3)
0.16666667 = coord(1/6)
- Date
- 2. 3.1997 17:29:07
-
Efthimiadis, E.N.: End-users' understanding of thesaural knowledge structures in interactive query expansion (1994)
0.00
0.0022567778 = product of:
0.013540667 = sum of:
0.013540667 = product of:
0.040622 = sum of:
0.040622 = weight(_text_:22 in 5693) [ClassicSimilarity], result of:
0.040622 = score(doc=5693,freq=2.0), product of:
0.13124153 = queryWeight, product of:
3.5018296 = idf(docFreq=3622, maxDocs=44218)
0.03747799 = queryNorm
0.30952093 = fieldWeight in 5693, product of:
1.4142135 = tf(freq=2.0), with freq of:
2.0 = termFreq=2.0
3.5018296 = idf(docFreq=3622, maxDocs=44218)
0.0625 = fieldNorm(doc=5693)
0.33333334 = coord(1/3)
0.16666667 = coord(1/6)
- Date
- 30. 3.2001 13:35:22
-
Fieldhouse, M.; Hancock-Beaulieu, M.: ¬The design of a graphical user interface for a highly interactive information retrieval system (1996)
0.00
0.0019746807 = product of:
0.011848084 = sum of:
0.011848084 = product of:
0.03554425 = sum of:
0.03554425 = weight(_text_:22 in 6958) [ClassicSimilarity], result of:
0.03554425 = score(doc=6958,freq=2.0), product of:
0.13124153 = queryWeight, product of:
3.5018296 = idf(docFreq=3622, maxDocs=44218)
0.03747799 = queryNorm
0.2708308 = fieldWeight in 6958, product of:
1.4142135 = tf(freq=2.0), with freq of:
2.0 = termFreq=2.0
3.5018296 = idf(docFreq=3622, maxDocs=44218)
0.0546875 = fieldNorm(doc=6958)
0.33333334 = coord(1/3)
0.16666667 = coord(1/6)
- Source
- Information retrieval: new systems and current research. Proceedings of the 16th Research Colloquium of the British Computer Society Information Retrieval Specialist Group, Drymen, Scotland, 22-23 Mar 94. Ed.: R. Leon
-
Lund, K.; Burgess, C.; Atchley, R.A.: Semantic and associative priming in high-dimensional semantic space (1995)
0.00
0.0019746807 = product of:
0.011848084 = sum of:
0.011848084 = product of:
0.03554425 = sum of:
0.03554425 = weight(_text_:22 in 2151) [ClassicSimilarity], result of:
0.03554425 = score(doc=2151,freq=2.0), product of:
0.13124153 = queryWeight, product of:
3.5018296 = idf(docFreq=3622, maxDocs=44218)
0.03747799 = queryNorm
0.2708308 = fieldWeight in 2151, product of:
1.4142135 = tf(freq=2.0), with freq of:
2.0 = termFreq=2.0
3.5018296 = idf(docFreq=3622, maxDocs=44218)
0.0546875 = fieldNorm(doc=2151)
0.33333334 = coord(1/3)
0.16666667 = coord(1/6)
- Source
- Proceedings of the Seventeenth Annual Conference of the Cognitive Science Society: July 22 - 25, 1995, University of Pittsburgh / ed. by Johanna D. Moore and Jill Fain Lehmann
-
Kwok, K.L.: ¬A network approach to probabilistic information retrieval (1995)
0.00
0.0017079476 = product of:
0.010247685 = sum of:
0.010247685 = product of:
0.030743055 = sum of:
0.030743055 = weight(_text_:29 in 5696) [ClassicSimilarity], result of:
0.030743055 = score(doc=5696,freq=2.0), product of:
0.13183585 = queryWeight, product of:
3.5176873 = idf(docFreq=3565, maxDocs=44218)
0.03747799 = queryNorm
0.23319192 = fieldWeight in 5696, product of:
1.4142135 = tf(freq=2.0), with freq of:
2.0 = termFreq=2.0
3.5176873 = idf(docFreq=3565, maxDocs=44218)
0.046875 = fieldNorm(doc=5696)
0.33333334 = coord(1/3)
0.16666667 = coord(1/6)
- Date
- 29. 1.1996 18:42:14
-
Järvelin, K.; Kristensen, J.; Niemi, T.; Sormunen, E.; Keskustalo, H.: ¬A deductive data model for query expansion (1996)
0.00
0.0016925833 = product of:
0.0101555 = sum of:
0.0101555 = product of:
0.030466499 = sum of:
0.030466499 = weight(_text_:22 in 2230) [ClassicSimilarity], result of:
0.030466499 = score(doc=2230,freq=2.0), product of:
0.13124153 = queryWeight, product of:
3.5018296 = idf(docFreq=3622, maxDocs=44218)
0.03747799 = queryNorm
0.23214069 = fieldWeight in 2230, product of:
1.4142135 = tf(freq=2.0), with freq of:
2.0 = termFreq=2.0
3.5018296 = idf(docFreq=3622, maxDocs=44218)
0.046875 = fieldNorm(doc=2230)
0.33333334 = coord(1/3)
0.16666667 = coord(1/6)
- Source
- Proceedings of the 19th Annual International ACM SIGIR Conference on Research and Development in Information Retrieval (ACM SIGIR '96), Zürich, Switzerland, August 18-22, 1996. Eds.: H.P. Frei et al
-
Brezillon, P.; Saker, I.: Modeling context in information seeking (1999)
0.00
0.0011386317 = product of:
0.0068317903 = sum of:
0.0068317903 = product of:
0.02049537 = sum of:
0.02049537 = weight(_text_:29 in 276) [ClassicSimilarity], result of:
0.02049537 = score(doc=276,freq=2.0), product of:
0.13183585 = queryWeight, product of:
3.5176873 = idf(docFreq=3565, maxDocs=44218)
0.03747799 = queryNorm
0.15546128 = fieldWeight in 276, product of:
1.4142135 = tf(freq=2.0), with freq of:
2.0 = termFreq=2.0
3.5176873 = idf(docFreq=3565, maxDocs=44218)
0.03125 = fieldNorm(doc=276)
0.33333334 = coord(1/3)
0.16666667 = coord(1/6)
- Date
- 21. 3.2002 19:29:27
