Search (4 results, page 1 of 1)

  • × author_ss:"Smeaton, A.F."
  • × theme_ss:"Hypertext"
  1. Smeaton, A.F.: Retrieving information from hypertext : issues and problems (1991) 0.01 
    0.007138887 = product of:
  0.028555548 = sum of:
    0.028555548 = weight(_text_:information in 4278) [ClassicSimilarity], result of:
      0.028555548 = score(doc=4278,freq=18.0), product of:
        0.06134496 = queryWeight, product of:
          1.7554779 = idf(docFreq=20772, maxDocs=44218)
          0.034944877 = queryNorm
        0.46549135 = fieldWeight in 4278, product of:
          4.2426405 = tf(freq=18.0), with freq of:
            18.0 = termFreq=18.0
          1.7554779 = idf(docFreq=20772, maxDocs=44218)
          0.0625 = fieldNorm(doc=4278)
  0.25 = coord(1/4)
    Abstract
    Hypertext uses a browsing rather than a searching strategy. Hypertext systems have found applications in a number of areas. They give users choice of information but this can prove a drawback. Examnines the effectiveness of hypertext as a way of retrieving information and reviews conventional information retrieval techniques. Considers previous attempts at combining information retrieval and hypertext and outlines a prototype systems developed to generate guided tours for users to direct them through hypertext to information they have requested. Discusses how adding this kind of itelligent guidance to a hypertext system would affect its usability as an information system
    Source
    European journal of information systems. 1(1991) no.4, S.239-247
    Theme
    Information
  2. Smeaton, A.F.: Information retrieval and hypertext : competing technologies or complementary access methods (1992) 0.01 
    0.0067306077 = product of:
  0.02692243 = sum of:
    0.02692243 = weight(_text_:information in 7503) [ClassicSimilarity], result of:
      0.02692243 = score(doc=7503,freq=4.0), product of:
        0.06134496 = queryWeight, product of:
          1.7554779 = idf(docFreq=20772, maxDocs=44218)
          0.034944877 = queryNorm
        0.43886948 = fieldWeight in 7503, product of:
          2.0 = tf(freq=4.0), with freq of:
            4.0 = termFreq=4.0
          1.7554779 = idf(docFreq=20772, maxDocs=44218)
          0.125 = fieldNorm(doc=7503)
  0.25 = coord(1/4)
    Source
    Journal of information science. 2(1992), S.221-233
  3. Agosti, M.; Smeaton, A.F.: Information retrieval and hypertext (1996) 0.01 
    0.0066512655 = product of:
  0.026605062 = sum of:
    0.026605062 = weight(_text_:information in 497) [ClassicSimilarity], result of:
      0.026605062 = score(doc=497,freq=10.0), product of:
        0.06134496 = queryWeight, product of:
          1.7554779 = idf(docFreq=20772, maxDocs=44218)
          0.034944877 = queryNorm
        0.43369597 = fieldWeight in 497, product of:
          3.1622777 = tf(freq=10.0), with freq of:
            10.0 = termFreq=10.0
          1.7554779 = idf(docFreq=20772, maxDocs=44218)
          0.078125 = fieldNorm(doc=497)
  0.25 = coord(1/4)
    COMPASS
    Information retrieval
    LCSH
    Information retrieval
    Subject
    Information retrieval
    Information retrieval
  4. Smeaton, A.F.; Morrissey, P.J.: Experiments on the automatic construction of hypertext from texts (1995) 0.00 
    0.0017847219 = product of:
  0.0071388874 = sum of:
    0.0071388874 = weight(_text_:information in 7253) [ClassicSimilarity], result of:
      0.0071388874 = score(doc=7253,freq=2.0), product of:
        0.06134496 = queryWeight, product of:
          1.7554779 = idf(docFreq=20772, maxDocs=44218)
          0.034944877 = queryNorm
        0.116372846 = fieldWeight in 7253, product of:
          1.4142135 = tf(freq=2.0), with freq of:
            2.0 = termFreq=2.0
          1.7554779 = idf(docFreq=20772, maxDocs=44218)
          0.046875 = fieldNorm(doc=7253)
  0.25 = coord(1/4)
    Abstract
    Describes an approach to semi-automatically generate a hypertext from linear texts, based on initially creatign nodes and composite nodes composed of 'mini-hypertexts'. Node-node similarity values are computed using standard information retrieval techniques and these similarity measures are then used to selectively create node-node links based on the strength of similarity between them. The process is a novel one because the link creation process also uses values from a dynamically computed metric which measures the topological compactness of the overall hypertext being generated. Describes experiments on generating a hypertext from a collection of 846 software product descriptions comprising 8,5 MBytes of text which yield some guidelines on how the process should be automated. This text to hypertext conversion method is put into the context of an overall hypertext authoring tool currently under development

Authors

Types

Subjects