Search (1 results, page 1 of 1)

Did you mean:
lcsh's%3a%22Husserl%2c edmund %2f 1859 %2f 1938 %3b phenomenology %3b mental representation %3b intentionality %28Philosophy%29%22 1
lcsh's%3a%22Husserl%2c edmund %2f 1859 %2f 1908 %3b phenomenology %3b mental representation %3b intentionality %28Philosophy%29%22 1
lcsh's%3a%22Husserl%2c edmund %2f 1859 %2f 1938 %3b phenomenology %3b mentale representation %3b intentionality %28Philosophy%29%22 1
lcsh's%3a%22Husserl%2c edmund %2f 1859 %2f 1938 %3b phenomenoloy %3b mental representation %3b intentionality %28Philosophy%29%22 1
lcsh's%3a%22Husserl%2c edmunds %2f 1859 %2f 1938 %3b phenomenology %3b mental representation %3b intentionality %28Philosophy%29%22 1

Dumitrescu, A.; Santini, S.: Full coverage of a reader's interests in context-based information filtering (2021) 0.00
```
0.0025225044 = product of:
  0.03531506 = sum of:
    0.03531506 = weight(_text_:representation in 327) [ClassicSimilarity], result of:
      0.03531506 = score(doc=327,freq=2.0), product of:
        0.11578492 = queryWeight, product of:
          4.600994 = idf(docFreq=1206, maxDocs=44218)
          0.025165197 = queryNorm
        0.3050057 = fieldWeight in 327, product of:
          1.4142135 = tf(freq=2.0), with freq of:
            2.0 = termFreq=2.0
          4.600994 = idf(docFreq=1206, maxDocs=44218)
          0.046875 = fieldNorm(doc=327)
  0.071428575 = coord(1/14)
```
Abstract

We present a collection of algorithms to filter a stream of documents in such a way that the filtered documents will cover as well as possible the interest of a person, keeping in mind that, at any given time, the offered documents should not only be relevant, but should also be diversified, in the sense of covering all the interests of the person. We use a modification of the WEBSOM algorithm to create a user model based on a self-organizing network trained using a collection of documents representative of the person's interests. We introduce the concepts of freshness and coverage. A document is fresh if it belongs to a semantic area of interest to a person for which no documents were seen in the recent past; a group of documents has coverage to the extent to which it is a good representation of all the interests of a person. Our tests show that these algorithms can effectively increase the coverage of the documents that are shown to the user without overly affecting precision.