Search (3 results, page 1 of 1)

  • × author_ss:"Fotouhi, F."
  1. Johnson, A.; Fotouhi, F.: Adaptive clustering of hypermedia documents (1998) 0.00 
    0.001008966 = product of:
  0.014125523 = sum of:
    0.014125523 = weight(_text_:information in 4679) [ClassicSimilarity], result of:
      0.014125523 = score(doc=4679,freq=2.0), product of:
        0.052020688 = queryWeight, product of:
          1.7554779 = idf(docFreq=20772, maxDocs=44218)
          0.029633347 = queryNorm
        0.27153665 = fieldWeight in 4679, product of:
          1.4142135 = tf(freq=2.0), with freq of:
            2.0 = termFreq=2.0
          1.7554779 = idf(docFreq=20772, maxDocs=44218)
          0.109375 = fieldNorm(doc=4679)
  0.071428575 = coord(1/14)
    Source
    Encyclopedia of library and information science. Vol.63, [=Suppl.26]
  2. Johnson, A.; Fotouhi, F.: Adaptive clustering of hypermedia documents (1996) 0.00 
    8.153676E-4 = product of:
  0.011415146 = sum of:
    0.011415146 = weight(_text_:information in 7437) [ClassicSimilarity], result of:
      0.011415146 = score(doc=7437,freq=4.0), product of:
        0.052020688 = queryWeight, product of:
          1.7554779 = idf(docFreq=20772, maxDocs=44218)
          0.029633347 = queryNorm
        0.21943474 = fieldWeight in 7437, product of:
          2.0 = tf(freq=4.0), with freq of:
            4.0 = termFreq=4.0
          1.7554779 = idf(docFreq=20772, maxDocs=44218)
          0.0625 = fieldNorm(doc=7437)
  0.071428575 = coord(1/14)
    Abstract
    Compares the use of 2 adaptive algorithms (genetic algorithms, and neural networks) in clustering hypermedia documents. The clusters allow the user to index into the nodes and find information quickly. The clustering focuses on the user's paths through the hypermedia document and not on the content of the nodes or the structure of the links in the document, thus the clustering reflects the unique relationships each user sees among the nodes. The original hypermedia document remains untouched, and each user has a personalised index into this document
    Source
    Information systems. 21(1996) no.6, S.459-473
  3. Johnson, A.; Fotouhi, F.: Adaptive indexing in very large databases (1995) 0.00 
    5.7655195E-4 = product of:
  0.008071727 = sum of:
    0.008071727 = weight(_text_:information in 1940) [ClassicSimilarity], result of:
      0.008071727 = score(doc=1940,freq=2.0), product of:
        0.052020688 = queryWeight, product of:
          1.7554779 = idf(docFreq=20772, maxDocs=44218)
          0.029633347 = queryNorm
        0.1551638 = fieldWeight in 1940, product of:
          1.4142135 = tf(freq=2.0), with freq of:
            2.0 = termFreq=2.0
          1.7554779 = idf(docFreq=20772, maxDocs=44218)
          0.0625 = fieldNorm(doc=1940)
  0.071428575 = coord(1/14)
    Abstract
    Compares the use of 2 adaptive algorithms (genetic algorithms, and neural networks) in clustering the tables of a very large database. These clusters allow the user to index into this overwhelming number of tables and find the needed information quickly. Clusters the tables based on the user's queries and not on the content of the tables, thus the clustering reflects the unique relationships each user sees among the tables. The original database remains untouched, however each user will now have a personalized index into this database