Search (2 results, page 1 of 1)

  • × author_ss:"Can, F."
  • × year_i:[1990 TO 2000}
  1. Can, F.: Incremental clustering for dynamic information processing (1993) 0.01 
    0.005751905 = product of:
  0.014379762 = sum of:
    0.005448922 = weight(_text_:a in 6627) [ClassicSimilarity], result of:
      0.005448922 = score(doc=6627,freq=2.0), product of:
        0.053464882 = queryWeight, product of:
          1.153047 = idf(docFreq=37942, maxDocs=44218)
          0.046368346 = queryNorm
        0.10191591 = fieldWeight in 6627, product of:
          1.4142135 = tf(freq=2.0), with freq of:
            2.0 = termFreq=2.0
          1.153047 = idf(docFreq=37942, maxDocs=44218)
          0.0625 = fieldNorm(doc=6627)
    0.0089308405 = product of:
      0.017861681 = sum of:
        0.017861681 = weight(_text_:information in 6627) [ClassicSimilarity], result of:
          0.017861681 = score(doc=6627,freq=4.0), product of:
            0.08139861 = queryWeight, product of:
              1.7554779 = idf(docFreq=20772, maxDocs=44218)
              0.046368346 = queryNorm
            0.21943474 = fieldWeight in 6627, 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=6627)
      0.5 = coord(1/2)
  0.4 = coord(2/5)
    Source
    ACM transactions on information systems. 11(1993) no.2, S.143-164
    Type
    a
  2. Can, F.: On the efficiency of best-match cluster searches (1994) 0.00 
    0.0049073496 = product of:
  0.012268374 = sum of:
    0.0067426977 = weight(_text_:a in 7294) [ClassicSimilarity], result of:
      0.0067426977 = score(doc=7294,freq=4.0), product of:
        0.053464882 = queryWeight, product of:
          1.153047 = idf(docFreq=37942, maxDocs=44218)
          0.046368346 = queryNorm
        0.12611452 = fieldWeight in 7294, product of:
          2.0 = tf(freq=4.0), with freq of:
            4.0 = termFreq=4.0
          1.153047 = idf(docFreq=37942, maxDocs=44218)
          0.0546875 = fieldNorm(doc=7294)
    0.005525676 = product of:
      0.011051352 = sum of:
        0.011051352 = weight(_text_:information in 7294) [ClassicSimilarity], result of:
          0.011051352 = score(doc=7294,freq=2.0), product of:
            0.08139861 = queryWeight, product of:
              1.7554779 = idf(docFreq=20772, maxDocs=44218)
              0.046368346 = queryNorm
            0.13576832 = fieldWeight in 7294, product of:
              1.4142135 = tf(freq=2.0), with freq of:
                2.0 = termFreq=2.0
              1.7554779 = idf(docFreq=20772, maxDocs=44218)
              0.0546875 = fieldNorm(doc=7294)
      0.5 = coord(1/2)
  0.4 = coord(2/5)
    Abstract
    The efficiency of various cluster-based retrieval (CBR) strategies is analyzed. The possibility of combining CBR and inverted index search (IIS) is investigated. A method for combining the two approaches is proposed and shown to be cost effective in terms of paging and CPU time. In the new method, the selection of documents from the best-matching clusters is done using the inverted index for all documents. Although this is counterintuitive to the concept of best-match CBR, the observations prove that it is much more efficient than conventional approaches. In the experiments, the effects of the number of selected clusters, page size, centroid length, and matching functions are considered. The experiments show that the storage overhead of the new method would be moderately higher than that of IIS
    Source
    Information processing and management. 30(1994) no.3, S.343-361
    Type
    a

Themes