Search (2 results, page 1 of 1)

  • × theme_ss:"Suchtaktik"
  • × year_i:[2020 TO 2030}
  1. Dumitrescu, A.; Santini, S.: Full coverage of a reader's interests in context-based information filtering (2021) 0.01 
    0.0063645868 = product of:
  0.01909376 = sum of:
    0.01909376 = product of:
      0.057281278 = sum of:
        0.057281278 = weight(_text_:network in 327) [ClassicSimilarity], result of:
          0.057281278 = score(doc=327,freq=2.0), product of:
            0.19402927 = queryWeight, product of:
              4.4533744 = idf(docFreq=1398, maxDocs=44218)
              0.043569047 = queryNorm
            0.29521978 = fieldWeight in 327, product of:
              1.4142135 = tf(freq=2.0), with freq of:
                2.0 = termFreq=2.0
              4.4533744 = idf(docFreq=1398, maxDocs=44218)
              0.046875 = fieldNorm(doc=327)
      0.33333334 = coord(1/3)
  0.33333334 = coord(1/3)
    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.
  2. Wang, P.; Ma, Y.; Xie, H.; Wang, H.; Lu, J.; Xu, J.: "There is a gorilla holding a key on the book cover" : young children's known picture book search strategies (2022) 0.00 
    0.003309216 = product of:
  0.009927647 = sum of:
    0.009927647 = product of:
      0.029782942 = sum of:
        0.029782942 = weight(_text_:29 in 443) [ClassicSimilarity], result of:
          0.029782942 = score(doc=443,freq=2.0), product of:
            0.15326229 = queryWeight, product of:
              3.5176873 = idf(docFreq=3565, maxDocs=44218)
              0.043569047 = queryNorm
            0.19432661 = fieldWeight in 443, product of:
              1.4142135 = tf(freq=2.0), with freq of:
                2.0 = termFreq=2.0
              3.5176873 = idf(docFreq=3565, maxDocs=44218)
              0.0390625 = fieldNorm(doc=443)
      0.33333334 = coord(1/3)
  0.33333334 = coord(1/3)
    Abstract
    There is no information search system can assist young children's known picture book search needs since the information is not organized according to their cognitive abilities and needs. Therefore, this study explored young children's known picture book search strategies and extracted picture book search elements by simulating a search scenario and playing a picture book search game. The study found 29 elements children used to search for known picture books. Then, these elements are classified into three dimensions: The first dimension is the concept category of an element. The second dimension is an element's status in the story. The third dimension indicates where an element appears in a picture book. Additionally, it revealed a young children's general search strategy: Children first use auditory elements that they hear from the adults during reading. After receiving error returns, they add visual elements that they see by themselves in picture books. The findings can not only help to understand young children's known-item search and reformulation strategies during searching but also provide theoretical support for the development of a picture book information organization schema in the search system.

Authors