Search (3 results, page 1 of 1)

0.015178238 = product of:
  0.030356476 = sum of:
    0.030356476 = product of:
      0.060712952 = sum of:
        0.060712952 = weight(_text_:classification in 726) [ClassicSimilarity], result of:
          0.060712952 = score(doc=726,freq=6.0), product of:
            0.16603322 = queryWeight, product of:
              3.1847067 = idf(docFreq=4974, maxDocs=44218)
              0.05213454 = queryNorm
            0.3656675 = fieldWeight in 726, product of:
              2.4494898 = tf(freq=6.0), with freq of:
                6.0 = termFreq=6.0
              3.1847067 = idf(docFreq=4974, maxDocs=44218)
              0.046875 = fieldNorm(doc=726)
      0.5 = coord(1/2)
  0.5 = coord(1/2)

Abstract

This paper documents the continuing relevance of facet analysis as a technique for searching and organising WWW based materials. The 2 approaches underlying WWW searching and indexing - word and concept based indexing - are outlined. It is argued that facet analysis as an a posteriori approach to classification using words from the subject field as the concept terms in the classification derived represents an excellent approach to searching and organising the results of WWW searches using either search engines or search directories. Finally it is argued that the underlying philosophy of facet analysis is better suited to the disparate nature of WWW resources and searchers than the assumptions of contemporaray IR research.
This article gives a cheerfully brief and undetailed account of how to make a faceted classification system, then describes information retrieval and searching on the web. It concludes by saying that facets would be excellent in helping users search and browse the web, but offers no real clues as to how this can be done.

0.014127021 = product of:
  0.028254041 = sum of:
    0.028254041 = product of:
      0.056508083 = sum of:
        0.056508083 = weight(_text_:22 in 789) [ClassicSimilarity], result of:
          0.056508083 = score(doc=789,freq=2.0), product of:
            0.18256627 = queryWeight, product of:
              3.5018296 = idf(docFreq=3622, maxDocs=44218)
              0.05213454 = queryNorm
            0.30952093 = fieldWeight in 789, 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=789)
      0.5 = coord(1/2)
  0.5 = coord(1/2)

Date

26. 7.2002 20:22:46

0.010223686 = product of:
  0.020447372 = sum of:
    0.020447372 = product of:
      0.040894743 = sum of:
        0.040894743 = weight(_text_:classification in 4714) [ClassicSimilarity], result of:
          0.040894743 = score(doc=4714,freq=2.0), product of:
            0.16603322 = queryWeight, product of:
              3.1847067 = idf(docFreq=4974, maxDocs=44218)
              0.05213454 = queryNorm
            0.24630459 = fieldWeight in 4714, product of:
              1.4142135 = tf(freq=2.0), with freq of:
                2.0 = termFreq=2.0
              3.1847067 = idf(docFreq=4974, maxDocs=44218)
              0.0546875 = fieldNorm(doc=4714)
      0.5 = coord(1/2)
  0.5 = coord(1/2)

Abstract

For the purposes of this article, the indexing of information is interpreted as the pre-processing of information in order to enable its retrieval. The definition thus spans a dimension extending from classification-based approaches (pre-co-ordinate) to keyword searching (post-co-ordinate). In the first section we clarify our use of terminology, by briefly describing a framework for modelling IR systems in terms of sets of objects, relationships and functions. In the following 3 sections, we discuss the application of indexing functions to document collections of 3 specific types: (1) 'conventional' text databases; (2) hypertext databases; and (3) the World Wide Web, globally distributed across the Internet