Search (15 results, page 1 of 1)

Chang, C.-H.; Hsu, C.-C.: Integrating query expansion and conceptual relevance feedback for personalized Web information retrieval (1998) 0.06

0.061869845 = product of:
  0.12373969 = sum of:
    0.12373969 = sum of:
      0.07432922 = weight(_text_:web in 1319) [ClassicSimilarity], result of:
        0.07432922 = score(doc=1319,freq=6.0), product of:
          0.17002425 = queryWeight, product of:
            3.2635105 = idf(docFreq=4597, maxDocs=44218)
            0.052098576 = queryNorm
          0.43716836 = fieldWeight in 1319, product of:
            2.4494898 = tf(freq=6.0), with freq of:
              6.0 = termFreq=6.0
            3.2635105 = idf(docFreq=4597, maxDocs=44218)
            0.0546875 = fieldNorm(doc=1319)
      0.049410466 = weight(_text_:22 in 1319) [ClassicSimilarity], result of:
        0.049410466 = score(doc=1319,freq=2.0), product of:
          0.18244034 = queryWeight, product of:
            3.5018296 = idf(docFreq=3622, maxDocs=44218)
            0.052098576 = 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.5 = coord(1/2)

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
Footnote: Contribution to a special issue devoted to the Proceedings of the 7th International World Wide Web Conference, held 14-18 April 1998, Brisbane, Australia

Finding anything in the billion page Web : are algorithms the key? (1999) 0.02

0.021456998 = product of:
  0.042913996 = sum of:
    0.042913996 = product of:
      0.08582799 = sum of:
        0.08582799 = weight(_text_:web in 6248) [ClassicSimilarity], result of:
          0.08582799 = score(doc=6248,freq=2.0), product of:
            0.17002425 = queryWeight, product of:
              3.2635105 = idf(docFreq=4597, maxDocs=44218)
              0.052098576 = queryNorm
            0.50479853 = fieldWeight in 6248, product of:
              1.4142135 = tf(freq=2.0), with freq of:
                2.0 = termFreq=2.0
              3.2635105 = idf(docFreq=4597, maxDocs=44218)
              0.109375 = fieldNorm(doc=6248)
      0.5 = coord(1/2)
  0.5 = coord(1/2)

Jascó, P.: Mapping algorithms to translate natural language questions into search queries for Web databases (1997) 0.02

0.01839171 = product of:
  0.03678342 = sum of:
    0.03678342 = product of:
      0.07356684 = sum of:
        0.07356684 = weight(_text_:web in 314) [ClassicSimilarity], result of:
          0.07356684 = score(doc=314,freq=2.0), product of:
            0.17002425 = queryWeight, product of:
              3.2635105 = idf(docFreq=4597, maxDocs=44218)
              0.052098576 = queryNorm
            0.43268442 = fieldWeight in 314, product of:
              1.4142135 = tf(freq=2.0), with freq of:
                2.0 = termFreq=2.0
              3.2635105 = idf(docFreq=4597, maxDocs=44218)
              0.09375 = fieldNorm(doc=314)
      0.5 = coord(1/2)
  0.5 = coord(1/2)

Berry, M.W.; Browne, M.: Understanding search engines : mathematical modeling and text retrieval (1999) 0.02

0.01839171 = product of:
  0.03678342 = sum of:
    0.03678342 = product of:
      0.07356684 = sum of:
        0.07356684 = weight(_text_:web in 5777) [ClassicSimilarity], result of:
          0.07356684 = score(doc=5777,freq=8.0), product of:
            0.17002425 = queryWeight, product of:
              3.2635105 = idf(docFreq=4597, maxDocs=44218)
              0.052098576 = queryNorm
            0.43268442 = fieldWeight in 5777, product of:
              2.828427 = tf(freq=8.0), with freq of:
                8.0 = termFreq=8.0
              3.2635105 = idf(docFreq=4597, maxDocs=44218)
              0.046875 = fieldNorm(doc=5777)
      0.5 = coord(1/2)
  0.5 = coord(1/2)

LCSH: Web search engines
RSWK: World Wide Web / Suchmaschine / Mathematisches Modell (BVB)
Subject: World Wide Web / Suchmaschine / Mathematisches Modell (BVB)
Web search engines

Courtois, M.P.; Berry, M.W.: Results ranking in Web search engines (1999) 0.02

0.015326426 = product of:
  0.030652853 = sum of:
    0.030652853 = product of:
      0.061305705 = sum of:
        0.061305705 = weight(_text_:web in 3726) [ClassicSimilarity], result of:
          0.061305705 = score(doc=3726,freq=2.0), product of:
            0.17002425 = queryWeight, product of:
              3.2635105 = idf(docFreq=4597, maxDocs=44218)
              0.052098576 = queryNorm
            0.36057037 = fieldWeight in 3726, product of:
              1.4142135 = tf(freq=2.0), with freq of:
                2.0 = termFreq=2.0
              3.2635105 = idf(docFreq=4597, maxDocs=44218)
              0.078125 = fieldNorm(doc=3726)
      0.5 = coord(1/2)
  0.5 = coord(1/2)

Faloutsos, C.: Signature files (1992) 0.01

0.014117276 = product of:
  0.028234553 = sum of:
    0.028234553 = product of:
      0.056469105 = sum of:
        0.056469105 = weight(_text_:22 in 3499) [ClassicSimilarity], result of:
          0.056469105 = score(doc=3499,freq=2.0), product of:
            0.18244034 = queryWeight, product of:
              3.5018296 = idf(docFreq=3622, maxDocs=44218)
              0.052098576 = queryNorm
            0.30952093 = fieldWeight in 3499, 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=3499)
      0.5 = coord(1/2)
  0.5 = coord(1/2)

Date: 7. 5.1999 15:22:48

Chakrabarti, S.; Dom, B.; Kumar, S.R.; Raghavan, P.; Rajagopalan, S.; Tomkins, A.; Kleinberg, J.M.; Gibson, D.: Neue Pfade durch den Internet-Dschungel : Die zweite Generation von Web-Suchmaschinen (1999) 0.01

0.012261141 = product of:
  0.024522282 = sum of:
    0.024522282 = product of:
      0.049044564 = sum of:
        0.049044564 = weight(_text_:web in 3) [ClassicSimilarity], result of:
          0.049044564 = score(doc=3,freq=2.0), product of:
            0.17002425 = queryWeight, product of:
              3.2635105 = idf(docFreq=4597, maxDocs=44218)
              0.052098576 = queryNorm
            0.2884563 = fieldWeight in 3, product of:
              1.4142135 = tf(freq=2.0), with freq of:
                2.0 = termFreq=2.0
              3.2635105 = idf(docFreq=4597, maxDocs=44218)
              0.0625 = fieldNorm(doc=3)
      0.5 = coord(1/2)
  0.5 = coord(1/2)

Davis, C.H.; McKim, G.W.: Systematic weighting and ranking : cutting the Gordian knot (1999) 0.01
```
0.010728499 = product of:
  0.021456998 = sum of:
    0.021456998 = product of:
      0.042913996 = sum of:
        0.042913996 = weight(_text_:web in 3548) [ClassicSimilarity], result of:
          0.042913996 = score(doc=3548,freq=2.0), product of:
            0.17002425 = queryWeight, product of:
              3.2635105 = idf(docFreq=4597, maxDocs=44218)
              0.052098576 = queryNorm
            0.25239927 = fieldWeight in 3548, product of:
              1.4142135 = tf(freq=2.0), with freq of:
                2.0 = termFreq=2.0
              3.2635105 = idf(docFreq=4597, maxDocs=44218)
              0.0546875 = fieldNorm(doc=3548)
      0.5 = coord(1/2)
  0.5 = coord(1/2)
```
Abstract

A powers-of-two algorithm is described that automatically creates discrete, well-defined, and unique result sets, displaying them in decreasing order of likely relevance. All computations are transparent, and a simple query form allows the searcher to focus on the choice of terms and their sequence - an implicit indicator of their relative importance. The program can be used with traditional databases or with search engines designed for the WWW. It also can be used with an intelligent agent to search the Web with a pushdown store, returning only those items that best reflect the searcher's stated interests

Joss, M.W.; Wszola, S.: ¬The engines that can : text search and retrieval software, their strategies, and vendors (1996) 0.01

0.010587957 = product of:
  0.021175914 = sum of:
    0.021175914 = product of:
      0.042351827 = sum of:
        0.042351827 = weight(_text_:22 in 5123) [ClassicSimilarity], result of:
          0.042351827 = score(doc=5123,freq=2.0), product of:
            0.18244034 = queryWeight, product of:
              3.5018296 = idf(docFreq=3622, maxDocs=44218)
              0.052098576 = queryNorm
            0.23214069 = fieldWeight in 5123, 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=5123)
      0.5 = coord(1/2)
  0.5 = coord(1/2)

Date: 12. 9.1996 13:56:22

Kelledy, F.; Smeaton, A.F.: Signature files and beyond (1996) 0.01

0.010587957 = product of:
  0.021175914 = sum of:
    0.021175914 = product of:
      0.042351827 = sum of:
        0.042351827 = weight(_text_:22 in 6973) [ClassicSimilarity], result of:
          0.042351827 = score(doc=6973,freq=2.0), product of:
            0.18244034 = queryWeight, product of:
              3.5018296 = idf(docFreq=3622, maxDocs=44218)
              0.052098576 = queryNorm
            0.23214069 = fieldWeight in 6973, 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=6973)
      0.5 = coord(1/2)
  0.5 = coord(1/2)

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

Kleinberg, J.M.: Authoritative sources in a hyperlinked environment (1998) 0.01
```
0.009195855 = product of:
  0.01839171 = sum of:
    0.01839171 = product of:
      0.03678342 = sum of:
        0.03678342 = weight(_text_:web in 5) [ClassicSimilarity], result of:
          0.03678342 = score(doc=5,freq=2.0), product of:
            0.17002425 = queryWeight, product of:
              3.2635105 = idf(docFreq=4597, maxDocs=44218)
              0.052098576 = queryNorm
            0.21634221 = fieldWeight in 5, product of:
              1.4142135 = tf(freq=2.0), with freq of:
                2.0 = termFreq=2.0
              3.2635105 = idf(docFreq=4597, maxDocs=44218)
              0.046875 = fieldNorm(doc=5)
      0.5 = coord(1/2)
  0.5 = coord(1/2)
```
Abstract

The network structure of a hyperlinked environment can be a rich source of information about the content of the environment, provided we have effective means for understanding it. We develop a set of algorithmic tools for extracting information from the link structures of such environments, and report on experiments that demonstrate their effectiveness in a variety of contexts on the World Wide Web. The central issue we address within our framework is the distillation of broad search topics, through the discovery of "authoritative" information sources on such topics. We propose and test an algorithmic formulation of the notion of authority, based on the relationship between a set of relevant authoritative pages and the set of "hub pages" that join them together in the link structure. Our formulation has connections to the eigenvectors of certain matrices associated with the link graph; these connections in turn motivate additional heuristics for link-based analysis.

Burgin, R.: ¬The retrieval effectiveness of 5 clustering algorithms as a function of indexing exhaustivity (1995) 0.01

0.008823298 = product of:
  0.017646596 = sum of:
    0.017646596 = product of:
      0.03529319 = sum of:
        0.03529319 = weight(_text_:22 in 3365) [ClassicSimilarity], result of:
          0.03529319 = score(doc=3365,freq=2.0), product of:
            0.18244034 = queryWeight, product of:
              3.5018296 = idf(docFreq=3622, maxDocs=44218)
              0.052098576 = queryNorm
            0.19345059 = fieldWeight in 3365, 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=3365)
      0.5 = coord(1/2)
  0.5 = coord(1/2)

Date: 22. 2.1996 11:20:06

Efthimiadis, E.N.: User choices : a new yardstick for the evaluation of ranking algorithms for interactive query expansion (1995) 0.01

0.008823298 = product of:
  0.017646596 = sum of:
    0.017646596 = product of:
      0.03529319 = sum of:
        0.03529319 = weight(_text_:22 in 5697) [ClassicSimilarity], result of:
          0.03529319 = score(doc=5697,freq=2.0), product of:
            0.18244034 = queryWeight, product of:
              3.5018296 = idf(docFreq=3622, maxDocs=44218)
              0.052098576 = 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.5 = coord(1/2)
  0.5 = coord(1/2)

Date: 22. 2.1996 13:14:10

Kantor, P.; Kim, M.H.; Ibraev, U.; Atasoy, K.: Estimating the number of relevant documents in enormous collections (1999) 0.01
```
0.007663213 = product of:
  0.015326426 = sum of:
    0.015326426 = product of:
      0.030652853 = sum of:
        0.030652853 = weight(_text_:web in 6690) [ClassicSimilarity], result of:
          0.030652853 = score(doc=6690,freq=2.0), product of:
            0.17002425 = queryWeight, product of:
              3.2635105 = idf(docFreq=4597, maxDocs=44218)
              0.052098576 = queryNorm
            0.18028519 = fieldWeight in 6690, product of:
              1.4142135 = tf(freq=2.0), with freq of:
                2.0 = termFreq=2.0
              3.2635105 = idf(docFreq=4597, maxDocs=44218)
              0.0390625 = fieldNorm(doc=6690)
      0.5 = coord(1/2)
  0.5 = coord(1/2)
```
Abstract

In assessing information retrieval systems, it is important to know not only the precision of the retrieved set, but also to compare the number of retrieved relevant items to the total number of relevant items. For large collections, such as the TREC test collections, or the World Wide Web, it is not possible to enumerate the entire set of relevant documents. If the retrieved documents are evaluated, a variant of the statistical "capture-recapture" method can be used to estimate the total number of relevant documents, providing the several retrieval systems used are sufficiently independent. We show that the underlying signal detection model supporting such an analysis can be extended in two ways. First, assuming that there are two distinct performance characteristics (corresponding to the chance of retrieving a relevant, and retrieving a given non-relevant document), we show that if there are three or more independent systems available it is possible to estimate the number of relevant documents without actually having to decide whether each individual document is relevant. We report applications of this 3-system method to the TREC data, leading to the conclusion that the independence assumptions are not satisfied. We then extend the model to a multi-system, multi-problem model, and show that it is possible to include statistical dependencies of all orders in the model, and determine the number of relevant documents for each of the problems in the set. Application to the TREC setting will be presented
Cross-language information retrieval (1998) 0.00
```
0.0038316066 = product of:
  0.007663213 = sum of:
    0.007663213 = product of:
      0.015326426 = sum of:
        0.015326426 = weight(_text_:web in 6299) [ClassicSimilarity], result of:
          0.015326426 = score(doc=6299,freq=2.0), product of:
            0.17002425 = queryWeight, product of:
              3.2635105 = idf(docFreq=4597, maxDocs=44218)
              0.052098576 = queryNorm
            0.09014259 = fieldWeight in 6299, product of:
              1.4142135 = tf(freq=2.0), with freq of:
                2.0 = termFreq=2.0
              3.2635105 = idf(docFreq=4597, maxDocs=44218)
              0.01953125 = fieldNorm(doc=6299)
      0.5 = coord(1/2)
  0.5 = coord(1/2)
```
Footnote

Rez. in: Machine translation review: 1999, no.10, S.26-27 (D. Lewis): "Cross Language Information Retrieval (CLIR) addresses the growing need to access large volumes of data across language boundaries. The typical requirement is for the user to input a free form query, usually a brief description of a topic, into a search or retrieval engine which returns a list, in ranked order, of documents or web pages that are relevant to the topic. The search engine matches the terms in the query to indexed terms, usually keywords previously derived from the target documents. Unlike monolingual information retrieval, CLIR requires query terms in one language to be matched to indexed terms in another. Matching can be done by bilingual dictionary lookup, full machine translation, or by applying statistical methods. A query's success is measured in terms of recall (how many potentially relevant target documents are found) and precision (what proportion of documents found are relevant). Issues in CLIR are how to translate query terms into index terms, how to eliminate alternative translations (e.g. to decide that French 'traitement' in a query means 'treatment' and not 'salary'), and how to rank or weight translation alternatives that are retained (e.g. how to order the French terms 'aventure', 'business', 'affaire', and 'liaison' as relevant translations of English 'affair'). Grefenstette provides a lucid and useful overview of the field and the problems. The volume brings together a number of experiments and projects in CLIR. Mark Davies (New Mexico State University) describes Recuerdo, a Spanish retrieval engine which reduces translation ambiguities by scanning indexes for parallel texts; it also uses either a bilingual dictionary or direct equivalents from a parallel corpus in order to compare results for queries on parallel texts. Lisa Ballesteros and Bruce Croft (University of Massachusetts) use a 'local feedback' technique which automatically enhances a query by adding extra terms to it both before and after translation; such terms can be derived from documents known to be relevant to the query.

Search (15 results, page 1 of 1)

Authors

Languages

Types

Themes

Subjects

Classifications