Search (8 results, page 1 of 1)

0.029550051 = product of:
  0.08865015 = sum of:
    0.08865015 = sum of:
      0.048260607 = weight(_text_:indexing in 6973) [ClassicSimilarity], result of:
        0.048260607 = score(doc=6973,freq=2.0), product of:
          0.19018644 = queryWeight, product of:
            3.8278677 = idf(docFreq=2614, maxDocs=44218)
            0.049684696 = queryNorm
          0.2537542 = fieldWeight in 6973, product of:
            1.4142135 = tf(freq=2.0), with freq of:
              2.0 = termFreq=2.0
            3.8278677 = idf(docFreq=2614, maxDocs=44218)
            0.046875 = fieldNorm(doc=6973)
      0.04038954 = weight(_text_:22 in 6973) [ClassicSimilarity], result of:
        0.04038954 = score(doc=6973,freq=2.0), product of:
          0.17398734 = queryWeight, product of:
            3.5018296 = idf(docFreq=3622, maxDocs=44218)
            0.049684696 = 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.33333334 = coord(1/3)

Abstract

Proposes that signature files be used as a viable alternative to other indexing strategies such as inverted files for searching through large volumes of text. Demonstrates through simulation, that search times can be further reduced by enhancing the basic signature file concept using deterministic partitioning algorithms which eliminate the need for an exhaustive search of the entire signature file. Reports research to evaluate the performance of some deterministic partitioning algorithms in a non simulated environment using 276 MB of raw newspaper text (taken from the Wall Street Journal) and real user queries. Presents a selection of results to illustrate trends and highlight important aspects of the performance of these methods under realistic rather than simulated operating conditions. As a result of the research reported here certain aspects of this approach to signature files are shown to be found wanting and require improvement. Suggests lines of future research on the partitioning of signature files

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

0.016253578 = product of:
  0.04876073 = sum of:
    0.04876073 = product of:
      0.09752146 = sum of:
        0.09752146 = weight(_text_:indexing in 3700) [ClassicSimilarity], result of:
          0.09752146 = score(doc=3700,freq=6.0), product of:
            0.19018644 = queryWeight, product of:
              3.8278677 = idf(docFreq=2614, maxDocs=44218)
              0.049684696 = queryNorm
            0.5127677 = fieldWeight in 3700, product of:
              2.4494898 = tf(freq=6.0), with freq of:
                6.0 = termFreq=6.0
              3.8278677 = idf(docFreq=2614, maxDocs=44218)
              0.0546875 = fieldNorm(doc=3700)
      0.5 = coord(1/2)
  0.33333334 = coord(1/3)

Abstract

Current approaches to text retrieval based on indexing by words or index terms and on retrieving by specifying a Boolean combination of keywords are well known, as are their limitations. Statistical approaches to retrieval, as exemplified in commercial products like STATUS/IQ and Personal Librarian, are slightly better but still have their own weaknesses. Approaches to the indexing and retrieval of text based on techniques of automatic natural language processing (NLP) may soon start to realise their potential in terms of improving the quality and effectiveness of information retrieval. Examines some of the current attempts at using various NLP techniques in both the indexing and retrieval operations

0.016086869 = product of:
  0.048260607 = sum of:
    0.048260607 = product of:
      0.09652121 = sum of:
        0.09652121 = weight(_text_:indexing in 7080) [ClassicSimilarity], result of:
          0.09652121 = score(doc=7080,freq=2.0), product of:
            0.19018644 = queryWeight, product of:
              3.8278677 = idf(docFreq=2614, maxDocs=44218)
              0.049684696 = queryNorm
            0.5075084 = fieldWeight in 7080, product of:
              1.4142135 = tf(freq=2.0), with freq of:
                2.0 = termFreq=2.0
              3.8278677 = idf(docFreq=2614, maxDocs=44218)
              0.09375 = fieldNorm(doc=7080)
      0.5 = coord(1/2)
  0.33333334 = coord(1/3)

Abstract

Account of recent developments in automatic and semi-automatic text indexing as well as in the generation of thesauri, text retrieval, abstracting and summarization

0.015707046 = product of:
  0.047121134 = sum of:
    0.047121134 = product of:
      0.09424227 = sum of:
        0.09424227 = weight(_text_:22 in 2134) [ClassicSimilarity], result of:
          0.09424227 = score(doc=2134,freq=2.0), product of:
            0.17398734 = queryWeight, product of:
              3.5018296 = idf(docFreq=3622, maxDocs=44218)
              0.049684696 = queryNorm
            0.5416616 = fieldWeight in 2134, product of:
              1.4142135 = tf(freq=2.0), with freq of:
                2.0 = termFreq=2.0
              3.5018296 = idf(docFreq=3622, maxDocs=44218)
              0.109375 = fieldNorm(doc=2134)
      0.5 = coord(1/2)
  0.33333334 = coord(1/3)

Date

30. 3.2001 13:32:22

0.009479279 = product of:
  0.028437834 = sum of:
    0.028437834 = product of:
      0.05687567 = sum of:
        0.05687567 = weight(_text_:indexing in 4274) [ClassicSimilarity], result of:
          0.05687567 = score(doc=4274,freq=4.0), product of:
            0.19018644 = queryWeight, product of:
              3.8278677 = idf(docFreq=2614, maxDocs=44218)
              0.049684696 = queryNorm
            0.29905218 = fieldWeight in 4274, product of:
              2.0 = tf(freq=4.0), with freq of:
                4.0 = termFreq=4.0
              3.8278677 = idf(docFreq=2614, maxDocs=44218)
              0.0390625 = fieldNorm(doc=4274)
      0.5 = coord(1/2)
  0.33333334 = coord(1/3)

Abstract

Video is a communications medium that normally brings together moving pictures with a synchronized audio track into a discrete piece or pieces of information. A "piece" of video is variously referred to as a frame, a shot, a scene, a Clip, a program, or an episode; these pieces are distinguished by their length and by their composition. We shall return to the definition of each of these in the section an automatically structuring and indexing digital video. In modern society, Video is commonplace and is usually equated with television, movies, or home Video produced by a Video camera or camcorder. We also accept Video recorded from closed circuit TVs for security and surveillance as part of our daily lives. In short, Video is ubiquitous. Digital Video is, as the name suggests, the creation or capture of Video information in digital format. Most Video produced today, commercial, surveillance, or domestic, is produced in digital form, although the medium of Video predates the development of digital computing by several decades. The essential nature of Video has not changed with the advent of digital computing. It is still moving pictures and synchronized audio. However, the production methods and the end product have gone through significant evolution, in the last decade especially.

0.009384007 = product of:
  0.02815202 = sum of:
    0.02815202 = product of:
      0.05630404 = sum of:
        0.05630404 = weight(_text_:indexing in 5804) [ClassicSimilarity], result of:
          0.05630404 = score(doc=5804,freq=2.0), product of:
            0.19018644 = queryWeight, product of:
              3.8278677 = idf(docFreq=2614, maxDocs=44218)
              0.049684696 = queryNorm
            0.29604656 = fieldWeight in 5804, product of:
              1.4142135 = tf(freq=2.0), with freq of:
                2.0 = termFreq=2.0
              3.8278677 = idf(docFreq=2614, maxDocs=44218)
              0.0546875 = fieldNorm(doc=5804)
      0.5 = coord(1/2)
  0.33333334 = coord(1/3)

Abstract

A variety of methods for speeding up the response time of information retrieval processes have been put forward, one of which is the idea of thresholding. Thresholding relies on the data in information retrieval storage structures being organised to allow cut-off points to be used during processing. These cut-off points or thresholds are designed and ised to reduce the amount of information processed and to maintain the quality or minimise the degradation of response to a user's query. TREC is an annual series of benchmarking exercises to compare indexing and retrieval techniques. Reports experiments with a portion of the TREC data where features are introduced into the retrieval process to improve response time. These features improve response time while maintaining the same level of retrieval effectiveness

0.007853523 = product of:
  0.023560567 = sum of:
    0.023560567 = product of:
      0.047121134 = sum of:
        0.047121134 = weight(_text_:22 in 6965) [ClassicSimilarity], result of:
          0.047121134 = score(doc=6965,freq=2.0), product of:
            0.17398734 = queryWeight, product of:
              3.5018296 = idf(docFreq=3622, maxDocs=44218)
              0.049684696 = queryNorm
            0.2708308 = fieldWeight in 6965, 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=6965)
      0.5 = coord(1/2)
  0.33333334 = coord(1/3)

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

0.0067315903 = product of:
  0.02019477 = sum of:
    0.02019477 = product of:
      0.04038954 = sum of:
        0.04038954 = weight(_text_:22 in 2575) [ClassicSimilarity], result of:
          0.04038954 = score(doc=2575,freq=2.0), product of:
            0.17398734 = queryWeight, product of:
              3.5018296 = idf(docFreq=3622, maxDocs=44218)
              0.049684696 = queryNorm
            0.23214069 = fieldWeight in 2575, 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=2575)
      0.5 = coord(1/2)
  0.33333334 = coord(1/3)

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