Search (9 results, page 1 of 1)

Ellis, D.; Ford, N.; Furner, J.: In search of the unknown user : indexing, hypertext and the World Wide Web (1998) 0.07

0.06619023 = product of:
  0.099285334 = sum of:
    0.042293023 = product of:
      0.12687907 = sum of:
        0.12687907 = weight(_text_:objects in 4714) [ClassicSimilarity], result of:
          0.12687907 = score(doc=4714,freq=2.0), product of:
            0.3086582 = queryWeight, product of:
              5.315071 = idf(docFreq=590, maxDocs=44218)
              0.05807226 = queryNorm
            0.41106653 = fieldWeight in 4714, product of:
              1.4142135 = tf(freq=2.0), with freq of:
                2.0 = termFreq=2.0
              5.315071 = idf(docFreq=590, maxDocs=44218)
              0.0546875 = fieldNorm(doc=4714)
      0.33333334 = coord(1/3)
    0.056992315 = product of:
      0.11398463 = sum of:
        0.11398463 = weight(_text_:indexing in 4714) [ClassicSimilarity], result of:
          0.11398463 = score(doc=4714,freq=6.0), product of:
            0.22229293 = queryWeight, product of:
              3.8278677 = idf(docFreq=2614, maxDocs=44218)
              0.05807226 = queryNorm
            0.5127677 = fieldWeight in 4714, 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=4714)
      0.5 = coord(1/2)
  0.6666667 = coord(2/3)

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

Ellis, D.; Furner-Hines, J.; Willett, P.: Measuring the degree of similarity between objects in text retrieval systems (1993) 0.02
```
0.02092962 = product of:
  0.06278886 = sum of:
    0.06278886 = product of:
      0.18836658 = sum of:
        0.18836658 = weight(_text_:objects in 6716) [ClassicSimilarity], result of:
          0.18836658 = score(doc=6716,freq=6.0), product of:
            0.3086582 = queryWeight, product of:
              5.315071 = idf(docFreq=590, maxDocs=44218)
              0.05807226 = queryNorm
            0.6102756 = fieldWeight in 6716, product of:
              2.4494898 = tf(freq=6.0), with freq of:
                6.0 = termFreq=6.0
              5.315071 = idf(docFreq=590, maxDocs=44218)
              0.046875 = fieldNorm(doc=6716)
      0.33333334 = coord(1/3)
  0.33333334 = coord(1/3)
```
Abstract

Describes the use of a variety of similarity coefficients in the measurement of the degree of similarity between objects that contain textual information, such as documents, paragraphs, index terms or queries. The work is intended as a preliminary to future investigation of the calculations involved in measuring the degree of similarity between structured objects that may be represented by graph theoretic forms. Descusses the role of similarity coefficients in text retrieval in terms of: document and query similarity; document and document similarity; cocitation analysis; term and term similarity; and the similarity between sets of judgements, such as relevance judgements. Describes several methods for expressing the formulae used to define similarity coefficients and compares their attributes. Concludes with details the characteristics of similarity coefficients; equivalence and monotonicity; consideration of negative matches; geometric analyses; and the meaning of correlation coefficients
Ellis, D.; Furner-Hines, J.; Willett, P.: On the creation of hypertext links in full-text documents : measurement of inter-linker consistency (1994) 0.02
```
0.017441351 = product of:
  0.05232405 = sum of:
    0.05232405 = product of:
      0.15697214 = sum of:
        0.15697214 = weight(_text_:objects in 7493) [ClassicSimilarity], result of:
          0.15697214 = score(doc=7493,freq=6.0), product of:
            0.3086582 = queryWeight, product of:
              5.315071 = idf(docFreq=590, maxDocs=44218)
              0.05807226 = queryNorm
            0.508563 = fieldWeight in 7493, product of:
              2.4494898 = tf(freq=6.0), with freq of:
                6.0 = termFreq=6.0
              5.315071 = idf(docFreq=590, maxDocs=44218)
              0.0390625 = fieldNorm(doc=7493)
      0.33333334 = coord(1/3)
  0.33333334 = coord(1/3)
```
Abstract

In important stage in the process of retrieval of objects from a hypertext database is the creation of a set of inter-nodal links that are intended to represent the relationships existing between objects; this operation is often undertaken manually, just as index terms are often manually assigned to documents in a conventional retrieval system. Studies of conventional systems have suggested that a degree of consistency in the terms assigned to documents by indexers is positively associated with retrieval effectiveness. It is thus of interest to investigate the consistency of assignment of links in separate hypertext versions of the same full-text document, since a measure of agreement may be related to the subsequent utility of the resulting hypertext databases. The calculation of values indicating the degree of similarity between objects is a technique that has been widely used in the fields of textual and chemical information retrieval; in this paper we describe the application of arithmetic coefficients and topological indices to the measurement of the degree of similarity between the sets of inter-nodal links in hypertext databases. We publish the results of a study in which several different of links are inserted, by different people, between the paragraphs of each of a number of full-text documents. Our results show little similary between the sets of links identified by different people; this finding is comparable with those of studies of inter-indexer consistency, where it has been found that there is generally only a low level of agreement between the sets of idenx terms assigned to a document by different indexers
Ellis, D.; Furner, J.; Willett, P.: On the creation of hypertext links in full-text documents : measurement of retrieval effectiveness (1996) 0.01
```
0.014240801 = product of:
  0.042722404 = sum of:
    0.042722404 = product of:
      0.12816721 = sum of:
        0.12816721 = weight(_text_:objects in 4214) [ClassicSimilarity], result of:
          0.12816721 = score(doc=4214,freq=4.0), product of:
            0.3086582 = queryWeight, product of:
              5.315071 = idf(docFreq=590, maxDocs=44218)
              0.05807226 = queryNorm
            0.41523993 = fieldWeight in 4214, product of:
              2.0 = tf(freq=4.0), with freq of:
                4.0 = termFreq=4.0
              5.315071 = idf(docFreq=590, maxDocs=44218)
              0.0390625 = fieldNorm(doc=4214)
      0.33333334 = coord(1/3)
  0.33333334 = coord(1/3)
```
Abstract

An important stage in the process or retrieval of objects from a hypertext database is the creation of a set of internodal links that are intended to represent the relationships existing between objects; this operation is often undertaken manually, just as index terms are often manually assigned to documents in a conventional retrieval system. In an earlier article (1994), the results were published of a study in which several different sets of links were inserted, each by a different person, between the paragraphs of each of a number of full-text documents. These results showed little similarity between the link-sets, a finding that was comparable with those of studies of inter-indexer consistency, which suggest that there is generally only a low level of agreement between the sets of index terms assigned to a document by different indexers. In this article, a description is provided of an investigation into the nature of the relationship existing between (i) the levels of inter-linker consistency obtaining among the group of hypertext databases used in our earlier experiments, and (ii) the levels of effectiveness of a number of searches carried out in those databases. An account is given of the implementation of the searches and of the methods used in the calculation of numerical values expressing their effectiveness. Analysis of the results of a comparison between recorded levels of consistency and those of effectiveness does not allow us to draw conclusions about the consistency - effectiveness relationship that are equivalent to those drawn in comparable studies of inter-indexer consistency
Ellis, D.; Vasconcelos, A.: Ranganathan and the Net : using facet analysis to search and organise the World Wide Web (1999) 0.01
```
0.013295437 = product of:
  0.03988631 = sum of:
    0.03988631 = product of:
      0.07977262 = sum of:
        0.07977262 = weight(_text_:indexing in 726) [ClassicSimilarity], result of:
          0.07977262 = score(doc=726,freq=4.0), product of:
            0.22229293 = queryWeight, product of:
              3.8278677 = idf(docFreq=2614, maxDocs=44218)
              0.05807226 = queryNorm
            0.3588626 = fieldWeight in 726, product of:
              2.0 = tf(freq=4.0), with freq of:
                4.0 = termFreq=4.0
              3.8278677 = idf(docFreq=2614, maxDocs=44218)
              0.046875 = fieldNorm(doc=726)
      0.5 = coord(1/2)
  0.33333334 = coord(1/3)
```
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.
Ellis, D.; Furner-Hines, J.; Willett, P.: ¬The creation of hypertext links in full-text documents (1994) 0.01
```
0.012083722 = product of:
  0.036251165 = sum of:
    0.036251165 = product of:
      0.10875349 = sum of:
        0.10875349 = weight(_text_:objects in 1084) [ClassicSimilarity], result of:
          0.10875349 = score(doc=1084,freq=2.0), product of:
            0.3086582 = queryWeight, product of:
              5.315071 = idf(docFreq=590, maxDocs=44218)
              0.05807226 = queryNorm
            0.35234275 = fieldWeight in 1084, product of:
              1.4142135 = tf(freq=2.0), with freq of:
                2.0 = termFreq=2.0
              5.315071 = idf(docFreq=590, maxDocs=44218)
              0.046875 = fieldNorm(doc=1084)
      0.33333334 = coord(1/3)
  0.33333334 = coord(1/3)
```
Abstract

An important stage in the process of retrieval of objects from a hypertext database is the creation of a set of internodal links that are intended to represent the relationships existing between objetcs; an operation that is usually undertaken manually such as the allocation of subject index terms to documents. Reports results of a study in which several different sets of hypertext links were inserted, each by a different person, between the paragraphs of each of a number of full text documents. The similarity between the members of each pair of link sets was then evaluated. Results indicated that little similarity existed among the link sets, a finding comparable with those of studies of inter indexer consistency, which suggests that there is generally only a low level of agreemenet between the sets of index terms assigned to a document by indexers. Concludes with that part of the study designed to test the validity of making these kinds of assumptions in the context of hypertext link sets

Ellis, D.: Progress and problems in information retrieval (1996) 0.01

0.010490654 = product of:
  0.03147196 = sum of:
    0.03147196 = product of:
      0.06294392 = sum of:
        0.06294392 = weight(_text_:22 in 789) [ClassicSimilarity], result of:
          0.06294392 = score(doc=789,freq=2.0), product of:
            0.20335917 = queryWeight, product of:
              3.5018296 = idf(docFreq=3622, maxDocs=44218)
              0.05807226 = 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.33333334 = coord(1/3)

Date: 26. 7.2002 20:22:46

Ellis, D.; Furner-Hines, J.; Willett, P.: Measuring the consistency of assignment of hypertext links in full-text documents (1994) 0.01
```
0.009401294 = product of:
  0.028203882 = sum of:
    0.028203882 = product of:
      0.056407765 = sum of:
        0.056407765 = weight(_text_:indexing in 1052) [ClassicSimilarity], result of:
          0.056407765 = score(doc=1052,freq=2.0), product of:
            0.22229293 = queryWeight, product of:
              3.8278677 = idf(docFreq=2614, maxDocs=44218)
              0.05807226 = queryNorm
            0.2537542 = fieldWeight in 1052, 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=1052)
      0.5 = coord(1/2)
  0.33333334 = coord(1/3)
```
Abstract

Studies of document retrieval systems have suggested that the degree of consistency in the terms assigned to documents by indexers is positively associated with retrieval effectiveness. The study investigated the consistency of assignment of links in separate hypertext versions of the same full text database assuming that a measure of agreement may be related to the subsequent utility of the resulting hypertext document. Describes the calculations involved in measuring the degree of similarity between pairs of structured objetcs of a certain type (Those that may be represented in graph theoretic form). Initial results show little similarity between the sets of links identified by different people and this finding is comparable with those of studies of inter indexer consistency, where it has been found that there is generally only alow level of agreement between the sets of indexing terms assigned to a document of different indexers

Ellis, D.; Vasconcelos, A.: ¬The relevance of facet analysis for World Wide Web subject organization and searching (2000) 0.01

0.009401294 = product of:
  0.028203882 = sum of:
    0.028203882 = product of:
      0.056407765 = sum of:
        0.056407765 = weight(_text_:indexing in 2477) [ClassicSimilarity], result of:
          0.056407765 = score(doc=2477,freq=2.0), product of:
            0.22229293 = queryWeight, product of:
              3.8278677 = idf(docFreq=2614, maxDocs=44218)
              0.05807226 = queryNorm
            0.2537542 = fieldWeight in 2477, 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=2477)
      0.5 = coord(1/2)
  0.33333334 = coord(1/3)

Abstract: Different forms of indexing and search facilities available on the Web are described. Use of facet analysis to structure hypertext concept structures is outlined in relation to work on (1) development of hypertext knowledge bases for designers of learning materials and (2) construction of knowledge based hypertext interfaces. The problem of lack of closeness between page designers and potential users is examined. Facet analysis is suggested as a way of alleviating some difficulties associated with this problem of designing for the unknown user.

Search (9 results, page 1 of 1)

Authors

Years

Types

Themes