Search (1 results, page 1 of 1)

0.009856974 = product of:
  0.019713948 = sum of:
    0.019713948 = product of:
      0.039427895 = sum of:
        0.039427895 = weight(_text_:1997 in 5044) [ClassicSimilarity], result of:
          0.039427895 = score(doc=5044,freq=2.0), product of:
            0.1637463 = queryWeight, product of:
              3.6322508 = idf(docFreq=3179, maxDocs=44218)
              0.04508122 = queryNorm
            0.2407865 = fieldWeight in 5044, product of:
              1.4142135 = tf(freq=2.0), with freq of:
                2.0 = termFreq=2.0
              3.6322508 = idf(docFreq=3179, maxDocs=44218)
              0.046875 = fieldNorm(doc=5044)
      0.5 = coord(1/2)
  0.5 = coord(1/2)

Abstract

The Decision Tree Forest (DTF) is an architecture for information retrieval that uses a separate decision tree for each document in a collection. Experiments were conducted in which DTFs working with the incremental tree induction (ITI) algorithm of Utgoff, Berkman, and Clouse (1997) were trained and evaluated in the medical and word processing domains using the Cystic Fibrosis and SIFT collections. Performance was compared with that of a conventional inverted index system (IIS) using a BM25-derived probabilistic matching function. Initial results using DTF were poor compared to those obtained with IIS. We then simulated scenarios in which large quantities of training data were available, by using only those parts of the document collection that were well covered by the data sets. Consequently, the retrieval effectiveness of DTF improved substantially. In one particular experiment, precision and recall for DTF were 0.65 and 0.67 respectively, values that compared favorably with values of 0.49 and 0.56 for IIS.