Search (5 results, page 1 of 1)

0.059246525 = product of:
  0.11849305 = sum of:
    0.11849305 = sum of:
      0.076811686 = weight(_text_:report in 5047) [ClassicSimilarity], result of:
        0.076811686 = score(doc=5047,freq=2.0), product of:
          0.24374367 = queryWeight, product of:
            4.7537646 = idf(docFreq=1035, maxDocs=44218)
            0.05127382 = queryNorm
          0.31513304 = fieldWeight in 5047, product of:
            1.4142135 = tf(freq=2.0), with freq of:
              2.0 = termFreq=2.0
            4.7537646 = idf(docFreq=1035, maxDocs=44218)
            0.046875 = fieldNorm(doc=5047)
      0.041681368 = weight(_text_:22 in 5047) [ClassicSimilarity], result of:
        0.041681368 = score(doc=5047,freq=2.0), product of:
          0.17955218 = queryWeight, product of:
            3.5018296 = idf(docFreq=3622, maxDocs=44218)
            0.05127382 = queryNorm
          0.23214069 = fieldWeight in 5047, 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=5047)
  0.5 = coord(1/2)

Abstract

The authors report on an experimental study on the differences between spoken and written queries. A set of written and spontaneous spoken queries are generated by users from written topics. These two sets of queries are compared in qualitative terms and in terms of their retrieval effectiveness. Written and spoken queries are compared in terms of length, duration, and part of speech. In addition, assuming perfect transcription of the spoken queries, written and spoken queries are compared in terms of their aptitude to describe relevant documents. The retrieval effectiveness of spoken and written queries is compared using three different information retrieval models. The results show that using speech to formulate one's information need provides a way to express it more naturally and encourages the formulation of longer queries. Despite that, longer spoken queries do not seem to significantly improve retrieval effectiveness compared with written queries.

Date

5. 6.2006 11:22:23

0.016002435 = product of:
  0.03200487 = sum of:
    0.03200487 = product of:
      0.06400974 = sum of:
        0.06400974 = weight(_text_:report in 984) [ClassicSimilarity], result of:
          0.06400974 = score(doc=984,freq=2.0), product of:
            0.24374367 = queryWeight, product of:
              4.7537646 = idf(docFreq=1035, maxDocs=44218)
              0.05127382 = queryNorm
            0.26261088 = fieldWeight in 984, product of:
              1.4142135 = tf(freq=2.0), with freq of:
                2.0 = termFreq=2.0
              4.7537646 = idf(docFreq=1035, maxDocs=44218)
              0.0390625 = fieldNorm(doc=984)
      0.5 = coord(1/2)
  0.5 = coord(1/2)

Abstract

How to merge and organise query results retrieved from different resources is one of the key issues in distributed information retrieval. Some previous research and experiments suggest that cluster-based document browsing is more effective than a single merged list. Cluster-based retrieval results presentation is based on the cluster hypothesis, which states that documents that cluster together have a similar relevance to a given query. However, while this hypothesis has been demonstrated to hold in classical information retrieval environments, it has never been fully tested in heterogeneous distributed information retrieval environments. Heterogeneous document representations, the presence of document duplicates, and disparate qualities of retrieval results, are major features of an heterogeneous distributed information retrieval environment that might disrupt the effectiveness of the cluster hypothesis. In this paper we report on an experimental investigation into the validity and effectiveness of the cluster hypothesis in highly heterogeneous distributed information retrieval environments. The results show that although clustering is affected by different retrieval results representations and quality, the cluster hypothesis still holds and that generating hierarchical clusters in highly heterogeneous distributed information retrieval environments is still a very effective way of presenting retrieval results to users.

0.016002435 = product of:
  0.03200487 = sum of:
    0.03200487 = product of:
      0.06400974 = sum of:
        0.06400974 = weight(_text_:report in 1336) [ClassicSimilarity], result of:
          0.06400974 = score(doc=1336,freq=2.0), product of:
            0.24374367 = queryWeight, product of:
              4.7537646 = idf(docFreq=1035, maxDocs=44218)
              0.05127382 = queryNorm
            0.26261088 = fieldWeight in 1336, product of:
              1.4142135 = tf(freq=2.0), with freq of:
                2.0 = termFreq=2.0
              4.7537646 = idf(docFreq=1035, maxDocs=44218)
              0.0390625 = fieldNorm(doc=1336)
      0.5 = coord(1/2)
  0.5 = coord(1/2)

Abstract

We propose an approach to content-based Distributed Information Retrieval based on the periodic and incremental centralization of full-content indices of widely dispersed and autonomously managed document sources. Inspired by the success of the Open Archive Initiative's (OAI) Protocol for metadata harvesting, the approach occupies middle ground between content crawling and distributed retrieval. As in crawling, some data move toward the retrieval process, but it is statistics about the content rather than content itself; this grants more efficient use of network resources and wider scope of application. As in distributed retrieval, some processing is distributed along with the data, but it is indexing rather than retrieval; this reduces the costs of content provision while promoting the simplicity, effectiveness, and responsiveness of retrieval. Overall, we argue that the approach retains the good properties of centralized retrieval without renouncing to cost-effective, large-scale resource pooling. We discuss the requirements associated with the approach and identify two strategies to deploy it on top of the OAI infrastructure. In particular, we define a minimal extension of the OAI protocol which supports the coordinated harvesting of full-content indices and descriptive metadata for content resources. Finally, we report on the implementation of a proof-of-concept prototype service for multimodel content-based retrieval of distributed file collections.

0.010420342 = product of:
  0.020840684 = sum of:
    0.020840684 = product of:
      0.041681368 = sum of:
        0.041681368 = weight(_text_:22 in 6967) [ClassicSimilarity], result of:
          0.041681368 = score(doc=6967,freq=2.0), product of:
            0.17955218 = queryWeight, product of:
              3.5018296 = idf(docFreq=3622, maxDocs=44218)
              0.05127382 = queryNorm
            0.23214069 = fieldWeight in 6967, 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=6967)
      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

0.010420342 = product of:
  0.020840684 = sum of:
    0.020840684 = product of:
      0.041681368 = sum of:
        0.041681368 = weight(_text_:22 in 1451) [ClassicSimilarity], result of:
          0.041681368 = score(doc=1451,freq=2.0), product of:
            0.17955218 = queryWeight, product of:
              3.5018296 = idf(docFreq=3622, maxDocs=44218)
              0.05127382 = queryNorm
            0.23214069 = fieldWeight in 1451, 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=1451)
      0.5 = coord(1/2)
  0.5 = coord(1/2)

Date

22. 3.2003 19:27:36