Search (89 results, page 1 of 5)

  • × theme_ss:"Semantisches Umfeld in Indexierung u. Retrieval"
  1. Goslin, K.; Hofmann, M.: ¬A Wikipedia powered state-based approach to automatic search query enhancement (2018) 0.03 
    0.028890263 = product of:
  0.10111592 = sum of:
    0.030535674 = weight(_text_:management in 5083) [ClassicSimilarity], result of:
      0.030535674 = score(doc=5083,freq=2.0), product of:
        0.13666032 = queryWeight, product of:
          3.3706124 = idf(docFreq=4130, maxDocs=44218)
          0.04054466 = queryNorm
        0.22344214 = fieldWeight in 5083, product of:
          1.4142135 = tf(freq=2.0), with freq of:
            2.0 = termFreq=2.0
          3.3706124 = idf(docFreq=4130, maxDocs=44218)
          0.046875 = fieldNorm(doc=5083)
    0.070580244 = product of:
      0.14116049 = sum of:
        0.14116049 = weight(_text_:states in 5083) [ClassicSimilarity], result of:
          0.14116049 = score(doc=5083,freq=6.0), product of:
            0.22326207 = queryWeight, product of:
              5.506572 = idf(docFreq=487, maxDocs=44218)
              0.04054466 = queryNorm
            0.63226366 = fieldWeight in 5083, product of:
              2.4494898 = tf(freq=6.0), with freq of:
                6.0 = termFreq=6.0
              5.506572 = idf(docFreq=487, maxDocs=44218)
              0.046875 = fieldNorm(doc=5083)
      0.5 = coord(1/2)
  0.2857143 = coord(2/7)
    Abstract
    This paper describes the development and testing of a novel Automatic Search Query Enhancement (ASQE) algorithm, the Wikipedia N Sub-state Algorithm (WNSSA), which utilises Wikipedia as the sole data source for prior knowledge. This algorithm is built upon the concept of iterative states and sub-states, harnessing the power of Wikipedia's data set and link information to identify and utilise reoccurring terms to aid term selection and weighting during enhancement. This algorithm is designed to prevent query drift by making callbacks to the user's original search intent by persisting the original query between internal states with additional selected enhancement terms. The developed algorithm has shown to improve both short and long queries by providing a better understanding of the query and available data. The proposed algorithm was compared against five existing ASQE algorithms that utilise Wikipedia as the sole data source, showing an average Mean Average Precision (MAP) improvement of 0.273 over the tested existing ASQE algorithms.
    Source
    Information processing and management. 54(2018) no.4, S.726-739
  2. Sacco, G.M.: Dynamic taxonomies and guided searches (2006) 0.02 
    0.017947176 = product of:
  0.062815115 = sum of:
    0.035624955 = weight(_text_:management in 5295) [ClassicSimilarity], result of:
      0.035624955 = score(doc=5295,freq=2.0), product of:
        0.13666032 = queryWeight, product of:
          3.3706124 = idf(docFreq=4130, maxDocs=44218)
          0.04054466 = queryNorm
        0.2606825 = fieldWeight in 5295, product of:
          1.4142135 = tf(freq=2.0), with freq of:
            2.0 = termFreq=2.0
          3.3706124 = idf(docFreq=4130, maxDocs=44218)
          0.0546875 = fieldNorm(doc=5295)
    0.027190158 = product of:
      0.054380316 = sum of:
        0.054380316 = weight(_text_:22 in 5295) [ClassicSimilarity], result of:
          0.054380316 = score(doc=5295,freq=4.0), product of:
            0.14198048 = queryWeight, product of:
              3.5018296 = idf(docFreq=3622, maxDocs=44218)
              0.04054466 = queryNorm
            0.38301262 = fieldWeight in 5295, product of:
              2.0 = tf(freq=4.0), with freq of:
                4.0 = termFreq=4.0
              3.5018296 = idf(docFreq=3622, maxDocs=44218)
              0.0546875 = fieldNorm(doc=5295)
      0.5 = coord(1/2)
  0.2857143 = coord(2/7)
    Abstract
    A new search paradigm, in which the primary user activity is the guided exploration of a complex information space rather than the retrieval of items based on precise specifications, is proposed. The author claims that this paradigm is the norm in most practical applications, and that solutions based on traditional search methods are not effective in this context. He then presents a solution based on dynamic taxonomies, a knowledge management model that effectively guides users to reach their goal while giving them total freedom in exploring the information base. Applications, benefits, and current research are discussed.
    Date
    22. 7.2006 17:56:22
  3. Efthimiadis, E.N.: End-users' understanding of thesaural knowledge structures in interactive query expansion (1994) 0.02 
    0.01791063 = product of:
  0.0626872 = sum of:
    0.040714234 = weight(_text_:management in 5693) [ClassicSimilarity], result of:
      0.040714234 = score(doc=5693,freq=2.0), product of:
        0.13666032 = queryWeight, product of:
          3.3706124 = idf(docFreq=4130, maxDocs=44218)
          0.04054466 = queryNorm
        0.29792285 = fieldWeight in 5693, product of:
          1.4142135 = tf(freq=2.0), with freq of:
            2.0 = termFreq=2.0
          3.3706124 = idf(docFreq=4130, maxDocs=44218)
          0.0625 = fieldNorm(doc=5693)
    0.021972965 = product of:
      0.04394593 = sum of:
        0.04394593 = weight(_text_:22 in 5693) [ClassicSimilarity], result of:
          0.04394593 = score(doc=5693,freq=2.0), product of:
            0.14198048 = queryWeight, product of:
              3.5018296 = idf(docFreq=3622, maxDocs=44218)
              0.04054466 = queryNorm
            0.30952093 = fieldWeight in 5693, product of:
              1.4142135 = tf(freq=2.0), with freq of:
                2.0 = termFreq=2.0
              3.5018296 = idf(docFreq=3622, maxDocs=44218)
              0.0625 = fieldNorm(doc=5693)
      0.5 = coord(1/2)
  0.2857143 = coord(2/7)
    Date
    30. 3.2001 13:35:22
    Source
    Knowledge organization and quality management: Proc. of the 3rd International ISKO Conference, 20-24 June 1994, Copenhagen, Denmark. Ed.: H. Albrechtsen et al
  4. Bilal, D.; Kirby, J.: Differences and similarities in information seeking : children and adults as Web users (2002) 0.02 
    0.016793182 = product of:
  0.058776136 = sum of:
    0.020357117 = weight(_text_:management in 2591) [ClassicSimilarity], result of:
      0.020357117 = score(doc=2591,freq=2.0), product of:
        0.13666032 = queryWeight, product of:
          3.3706124 = idf(docFreq=4130, maxDocs=44218)
          0.04054466 = queryNorm
        0.14896142 = fieldWeight in 2591, product of:
          1.4142135 = tf(freq=2.0), with freq of:
            2.0 = termFreq=2.0
          3.3706124 = idf(docFreq=4130, maxDocs=44218)
          0.03125 = fieldNorm(doc=2591)
    0.03841902 = product of:
      0.07683804 = sum of:
        0.07683804 = weight(_text_:states in 2591) [ClassicSimilarity], result of:
          0.07683804 = score(doc=2591,freq=4.0), product of:
            0.22326207 = queryWeight, product of:
              5.506572 = idf(docFreq=487, maxDocs=44218)
              0.04054466 = queryNorm
            0.34416074 = fieldWeight in 2591, product of:
              2.0 = tf(freq=4.0), with freq of:
                4.0 = termFreq=4.0
              5.506572 = idf(docFreq=487, maxDocs=44218)
              0.03125 = fieldNorm(doc=2591)
      0.5 = coord(1/2)
  0.2857143 = coord(2/7)
    Abstract
    This study examined the success and information seeking behaviors of seventh-grade science students and graduate students in information science in using Yahooligans! Web search engine/directory. It investigated these users' cognitive, affective, and physical behaviors as they sought the answer for a fact-finding task. It analyzed and compared the overall patterns of children's and graduate students' Web activities, including searching moves, browsing moves, backtracking moves, looping moves, screen scrolling, target location and deviation moves, and the time they took to complete the task. The authors applied Bilal's Web Traversal Measure to quantify these users' effectiveness, efficiency, and quality of moves they made. Results were based on 14 children's Web sessions and nine graduate students' sessions. Both groups' Web activities were captured online using Lotus ScreenCam, a software package that records and replays online activities in Web browsers. Children's affective states were captured via exit interviews. Graduate students' affective states were extracted from the journal writings they kept during the traversal process. The study findings reveal that 89% of the graduate students found the correct answer to the search task as opposed to 50% of the children. Based on the Measure, graduate students' weighted effectiveness, efficiency, and quality of the Web moves they made were much higher than those of the children. Regardless of success and weighted scores, however, similarities and differences in information seeking were found between the two groups. Yahooligans! poor structure of keyword searching was a major factor that contributed to the "breakdowns" children and graduate students experienced. Unlike children, graduate students were able to recover from "breakdowns" quickly and effectively. Three main factors influenced these users' performance: ability to recover from "breakdowns", navigational style, and focus on task. Children and graduate students made recommendations for improving Yahooligans! interface design. Implications for Web user training and system design improvements are made.
    Source
    Information processing and management. 38(2002) no.5, S.649-670
  5. Ingwersen, P.; Järvelin, K.: ¬The turn : integration of information seeking and retrieval in context (2005) 0.01 
    0.014921699 = product of:
  0.052225944 = sum of:
    0.035246976 = weight(_text_:united in 1323) [ClassicSimilarity], result of:
      0.035246976 = score(doc=1323,freq=2.0), product of:
        0.2274601 = queryWeight, product of:
          5.6101127 = idf(docFreq=439, maxDocs=44218)
          0.04054466 = queryNorm
        0.15495893 = fieldWeight in 1323, product of:
          1.4142135 = tf(freq=2.0), with freq of:
            2.0 = termFreq=2.0
          5.6101127 = idf(docFreq=439, maxDocs=44218)
          0.01953125 = fieldNorm(doc=1323)
    0.016978968 = product of:
      0.033957936 = sum of:
        0.033957936 = weight(_text_:states in 1323) [ClassicSimilarity], result of:
          0.033957936 = score(doc=1323,freq=2.0), product of:
            0.22326207 = queryWeight, product of:
              5.506572 = idf(docFreq=487, maxDocs=44218)
              0.04054466 = queryNorm
            0.152099 = fieldWeight in 1323, product of:
              1.4142135 = tf(freq=2.0), with freq of:
                2.0 = termFreq=2.0
              5.506572 = idf(docFreq=487, maxDocs=44218)
              0.01953125 = fieldNorm(doc=1323)
      0.5 = coord(1/2)
  0.2857143 = coord(2/7)
    Footnote
    - Kapitel fünf enthält einen entsprechenden Überblick über die kognitive und benutzerorientierte IR-Tradition. Es zeigt, welche anderen (als nur die labororientierten) IR-Studien durchgeführt werden können, wobei sich die Betrachtung von frühen Modellen (z.B. Taylor) über Belkins ASK-Konzept bis zu Ingwersens Modell der Polyrepräsentation, und von Bates Berrypicking-Ansatz bis zu Vakkaris "taskbased" IR-Modell erstreckt. Auch Web-IR, OKAPI und Diskussionen zum Relevanzbegriff werden hier thematisiert. - Im folgenden Kapitel schlagen die Autoren ein integriertes IS&R Forschungsmodell vor, bei dem die vielfältigen Beziehungen zwischen Informationssuchenden, Systementwicklern, Oberflächen und anderen beteiligten Aspekten berücksichtigt werden. Ihr Ansatz vereint die traditionelle Laborforschung mit verschiedenen benutzerorientierten Traditionen aus IS&R, insbesondere mit den empirischen Ansätzen zu IS und zum interaktiven IR, in einem holistischen kognitiven Modell. - Kapitel sieben untersucht die Implikationen dieses Modells für IS&R, wobei besonders ins Auge fällt, wie komplex die Anfragen von Informationssuchenden im Vergleich mit der relativen Einfachheit der Algorithmen zum Auffinden relevanter Dokumente sind. Die Abbildung der vielfältig variierenden kognitiven Zustände der Anfragesteller im Rahmen der der Systementwicklung ist sicherlich keine triviale Aufgabe. Wie dabei das Problem der Einbeziehung des zentralen Aspektes der Bedeutung gelöst werden kann, sei dahingestellt. - Im achten Kapitel wird der Versuch unternommen, die zuvor diskutierten Punkte in ein IS&R-Forschungsprogramm (Prozesse - Verhalten - Systemfunktionalität - Performanz) umzusetzen, wobei auch einige kritische Anmerkungen zur bisherigen Forschungspraxis getroffen werden. - Das abschliessende neunte Kapitel fasst das Buch kurz zusammen und kann somit auch als Einstieg in dieThematik gelesen werden. Darauffolgen noch ein sehr nützliches Glossar zu allen wichtigen Begriffen, die in dem Buch Verwendung finden, eine Bibliographie und ein Sachregister. Ingwersen und Järvelin haben hier ein sehr anspruchsvolles und dennoch lesbares Buch vorgelegt. Die gebotenen Übersichtskapitel und Diskussionen sind zwar keine Einführung in die Informationswissenschaft, decken aber einen grossen Teil der heute in dieser Disziplin aktuellen und durch laufende Forschungsaktivitäten und Publikationen berührten Teilbereiche ab. Man könnte es auch - vielleicht ein wenig überspitzt - so formulieren: Was hier thematisiert wird, ist eigentlich die moderne Informationswissenschaft. Der Versuch, die beiden Forschungstraditionen zu vereinen, wird diesem Werk sicherlich einen Platz in der Geschichte der Disziplin sichern. Nicht ganz glücklich erscheint der Titel des Buches. "The Turn" soll eine Wende bedeuten, nämlich jene hin zu einer integrierten Sicht von IS und IR. Das geht vermutlich aus dem Untertitel besser hervor, doch dieser erschien den Autoren wohl zu trocken. Schade, denn "The Turn" gibt es z.B. in unserem Verbundkatalog bereits, allerdings mit dem Zusatz "from the Cold War to a new era; the United States and the Soviet Union 1983-1990". Der Verlag, der abgesehen davon ein gediegenes (wenn auch nicht gerade wohlfeiles) Produkt vorgelegt hat, hätte derlei unscharfe Duplizierend besser verhindert. Ungeachtet dessen empfehle ich dieses wichtige Buch ohne Vorbehalt zur Anschaffung; es sollte in keiner grösseren Bibliothek fehlen."
  6. Wongthontham, P.; Abu-Salih, B.: Ontology-based approach for semantic data extraction from social big data : state-of-the-art and research directions (2018) 0.01 
    0.012915401 = product of:
  0.0904078 = sum of:
    0.0904078 = weight(_text_:industry in 4097) [ClassicSimilarity], result of:
      0.0904078 = score(doc=4097,freq=2.0), product of:
        0.2351482 = queryWeight, product of:
          5.799733 = idf(docFreq=363, maxDocs=44218)
          0.04054466 = queryNorm
        0.3844716 = fieldWeight in 4097, product of:
          1.4142135 = tf(freq=2.0), with freq of:
            2.0 = termFreq=2.0
          5.799733 = idf(docFreq=363, maxDocs=44218)
          0.046875 = fieldNorm(doc=4097)
  0.14285715 = coord(1/7)
    Abstract
    A challenge of managing and extracting useful knowledge from social media data sources has attracted much attention from academic and industry. To address this challenge, semantic analysis of textual data is focused in this paper. We propose an ontology-based approach to extract semantics of textual data and define the domain of data. In other words, we semantically analyse the social data at two levels i.e. the entity level and the domain level. We have chosen Twitter as a social channel challenge for a purpose of concept proof. Domain knowledge is captured in ontologies which are then used to enrich the semantics of tweets provided with specific semantic conceptual representation of entities that appear in the tweets. Case studies are used to demonstrate this approach. We experiment and evaluate our proposed approach with a public dataset collected from Twitter and from the politics domain. The ontology-based approach leverages entity extraction and concept mappings in terms of quantity and accuracy of concept identification.
  7. Efthimiadis, E.N.: User choices : a new yardstick for the evaluation of ranking algorithms for interactive query expansion (1995) 0.01 
    0.011194143 = product of:
  0.0391795 = sum of:
    0.025446396 = weight(_text_:management in 5697) [ClassicSimilarity], result of:
      0.025446396 = score(doc=5697,freq=2.0), product of:
        0.13666032 = queryWeight, product of:
          3.3706124 = idf(docFreq=4130, maxDocs=44218)
          0.04054466 = queryNorm
        0.18620178 = fieldWeight in 5697, product of:
          1.4142135 = tf(freq=2.0), with freq of:
            2.0 = termFreq=2.0
          3.3706124 = idf(docFreq=4130, maxDocs=44218)
          0.0390625 = fieldNorm(doc=5697)
    0.013733104 = product of:
      0.027466208 = sum of:
        0.027466208 = weight(_text_:22 in 5697) [ClassicSimilarity], result of:
          0.027466208 = score(doc=5697,freq=2.0), product of:
            0.14198048 = queryWeight, product of:
              3.5018296 = idf(docFreq=3622, maxDocs=44218)
              0.04054466 = queryNorm
            0.19345059 = fieldWeight in 5697, product of:
              1.4142135 = tf(freq=2.0), with freq of:
                2.0 = termFreq=2.0
              3.5018296 = idf(docFreq=3622, maxDocs=44218)
              0.0390625 = fieldNorm(doc=5697)
      0.5 = coord(1/2)
  0.2857143 = coord(2/7)
    Date
    22. 2.1996 13:14:10
    Source
    Information processing and management. 31(1995) no.4, S.605-620
  8. Tudhope, D.; Binding, C.; Blocks, D.; Cunliffe, D.: Compound descriptors in context : a matching function for classifications and thesauri (2002) 0.01 
    0.010762835 = product of:
  0.07533984 = sum of:
    0.07533984 = weight(_text_:industry in 3179) [ClassicSimilarity], result of:
      0.07533984 = score(doc=3179,freq=2.0), product of:
        0.2351482 = queryWeight, product of:
          5.799733 = idf(docFreq=363, maxDocs=44218)
          0.04054466 = queryNorm
        0.320393 = fieldWeight in 3179, product of:
          1.4142135 = tf(freq=2.0), with freq of:
            2.0 = termFreq=2.0
          5.799733 = idf(docFreq=363, maxDocs=44218)
          0.0390625 = fieldNorm(doc=3179)
  0.14285715 = coord(1/7)
    Abstract
    There are many advantages for Digital Libraries in indexing with classifications or thesauri, but some current disincentive in the lack of flexible retrieval tools that deal with compound descriptors. This paper discusses a matching function for compound descriptors, or multi-concept subject headings, that does not rely an exact matching but incorporates term expansion via thesaurus semantic relationships to produce ranked results that take account of missing and partially matching terms. The matching function is based an a measure of semantic closeness between terms, which has the potential to help with recall problems. The work reported is part of the ongoing FACET project in collaboration with the National Museum of Science and Industry and its collections database. The architecture of the prototype system and its Interface are outlined. The matching problem for compound descriptors is reviewed and the FACET implementation described. Results are discussed from scenarios using the faceted Getty Art and Architecture Thesaurus. We argue that automatic traversal of thesaurus relationships can augment the user's browsing possibilities. The techniques can be applied both to unstructured multi-concept subject headings and potentially to more syntactically structured strings. The notion of a focus term is used by the matching function to model AAT modified descriptors (noun phrases). The relevance of the approach to precoordinated indexing and matching faceted strings is discussed.
  9. Brunetti, J.M.; Roberto García, R.: User-centered design and evaluation of overview components for semantic data exploration (2014) 0.01 
    0.008955315 = product of:
  0.0313436 = sum of:
    0.020357117 = weight(_text_:management in 1626) [ClassicSimilarity], result of:
      0.020357117 = score(doc=1626,freq=2.0), product of:
        0.13666032 = queryWeight, product of:
          3.3706124 = idf(docFreq=4130, maxDocs=44218)
          0.04054466 = queryNorm
        0.14896142 = fieldWeight in 1626, product of:
          1.4142135 = tf(freq=2.0), with freq of:
            2.0 = termFreq=2.0
          3.3706124 = idf(docFreq=4130, maxDocs=44218)
          0.03125 = fieldNorm(doc=1626)
    0.010986483 = product of:
      0.021972965 = sum of:
        0.021972965 = weight(_text_:22 in 1626) [ClassicSimilarity], result of:
          0.021972965 = score(doc=1626,freq=2.0), product of:
            0.14198048 = queryWeight, product of:
              3.5018296 = idf(docFreq=3622, maxDocs=44218)
              0.04054466 = queryNorm
            0.15476047 = fieldWeight in 1626, product of:
              1.4142135 = tf(freq=2.0), with freq of:
                2.0 = termFreq=2.0
              3.5018296 = idf(docFreq=3622, maxDocs=44218)
              0.03125 = fieldNorm(doc=1626)
      0.5 = coord(1/2)
  0.2857143 = coord(2/7)
    Date
    20. 1.2015 18:30:22
    Source
    Aslib journal of information management. 66(2014) no.5, S.519-536
  10. Hancock-Beaulieu, M.: Interactive query expansion in an OPAC : interface and retrieval issues (1995) 0.01 
    0.008724479 = product of:
  0.061071347 = sum of:
    0.061071347 = weight(_text_:management in 5089) [ClassicSimilarity], result of:
      0.061071347 = score(doc=5089,freq=2.0), product of:
        0.13666032 = queryWeight, product of:
          3.3706124 = idf(docFreq=4130, maxDocs=44218)
          0.04054466 = queryNorm
        0.44688427 = fieldWeight in 5089, product of:
          1.4142135 = tf(freq=2.0), with freq of:
            2.0 = termFreq=2.0
          3.3706124 = idf(docFreq=4130, maxDocs=44218)
          0.09375 = fieldNorm(doc=5089)
  0.14285715 = coord(1/7)
    Source
    Journal of document and text management. 3(1995) no.2, S.172-185
  11. Talja, S.; Keso, H.; Pietilainen, T.: ¬The production of context in information seeking research : a metatheoretical view (1999) 0.01 
    0.008724479 = product of:
  0.061071347 = sum of:
    0.061071347 = weight(_text_:management in 6249) [ClassicSimilarity], result of:
      0.061071347 = score(doc=6249,freq=2.0), product of:
        0.13666032 = queryWeight, product of:
          3.3706124 = idf(docFreq=4130, maxDocs=44218)
          0.04054466 = queryNorm
        0.44688427 = fieldWeight in 6249, product of:
          1.4142135 = tf(freq=2.0), with freq of:
            2.0 = termFreq=2.0
          3.3706124 = idf(docFreq=4130, maxDocs=44218)
          0.09375 = fieldNorm(doc=6249)
  0.14285715 = coord(1/7)
    Source
    Information processing and management. 35(1999) no.6, S.751-763
  12. Oakes, M.P.; Taylor, M.J.: Automated assistance in the formulation of search statements for bibliographic databases (1998) 0.01 
    0.008724479 = product of:
  0.061071347 = sum of:
    0.061071347 = weight(_text_:management in 6419) [ClassicSimilarity], result of:
      0.061071347 = score(doc=6419,freq=2.0), product of:
        0.13666032 = queryWeight, product of:
          3.3706124 = idf(docFreq=4130, maxDocs=44218)
          0.04054466 = queryNorm
        0.44688427 = fieldWeight in 6419, product of:
          1.4142135 = tf(freq=2.0), with freq of:
            2.0 = termFreq=2.0
          3.3706124 = idf(docFreq=4130, maxDocs=44218)
          0.09375 = fieldNorm(doc=6419)
  0.14285715 = coord(1/7)
    Source
    Information processing and management. 34(1998) no.6, S.645-668
  13. Mandala, R.; Tokunaga, T.; Tanaka, H.: Query expansion using heterogeneous thesauri (2000) 0.01 
    0.008724479 = product of:
  0.061071347 = sum of:
    0.061071347 = weight(_text_:management in 1277) [ClassicSimilarity], result of:
      0.061071347 = score(doc=1277,freq=2.0), product of:
        0.13666032 = queryWeight, product of:
          3.3706124 = idf(docFreq=4130, maxDocs=44218)
          0.04054466 = queryNorm
        0.44688427 = fieldWeight in 1277, product of:
          1.4142135 = tf(freq=2.0), with freq of:
            2.0 = termFreq=2.0
          3.3706124 = idf(docFreq=4130, maxDocs=44218)
          0.09375 = fieldNorm(doc=1277)
  0.14285715 = coord(1/7)
    Source
    Information processing and management. 36(2000) no.3, S.361-378
  14. Tudhope, D.; Binding, C.; Blocks, D.; Cunliffe, D.: FACET: thesaurus retrieval with semantic term expansion (2002) 0.01 
    0.008610267 = product of:
  0.06027187 = sum of:
    0.06027187 = weight(_text_:industry in 175) [ClassicSimilarity], result of:
      0.06027187 = score(doc=175,freq=2.0), product of:
        0.2351482 = queryWeight, product of:
          5.799733 = idf(docFreq=363, maxDocs=44218)
          0.04054466 = queryNorm
        0.2563144 = fieldWeight in 175, product of:
          1.4142135 = tf(freq=2.0), with freq of:
            2.0 = termFreq=2.0
          5.799733 = idf(docFreq=363, maxDocs=44218)
          0.03125 = fieldNorm(doc=175)
  0.14285715 = coord(1/7)
    Abstract
    There are many advantages for Digital Libraries in indexing with classifications or thesauri, but some current disincentive in the lack of flexible retrieval tools that deal with compound descriptors. This demonstration of a research prototype illustrates a matching function for compound descriptors, or multi-concept subject headings, that does not rely on exact matching but incorporates term expansion via thesaurus semantic relationships to produce ranked results that take account of missing and partially matching terms. The matching function is based on a measure of semantic closeness between terms.The work is part of the EPSRC funded FACET project in collaboration with the UK National Museum of Science and Industry (NMSI) which includes the National Railway Museum. An export of NMSI's Collections Database is used as the dataset for the research. The J. Paul Getty Trust's Art and Architecture Thesaurus (AAT) is the main thesaurus in the project. The AAT is a widely used thesaurus (over 120,000 terms). Descriptors are organised in 7 facets representing separate conceptual classes of terms.The FACET application is a multi tiered architecture accessing a SQL Server database, with an OLE DB connection. The thesauri are stored as relational tables in the Server's database. However, a key component of the system is a parallel representation of the underlying semantic network as an in-memory structure of thesaurus concepts (corresponding to preferred terms). The structure models the hierarchical and associative interrelationships of thesaurus concepts via weighted poly-hierarchical links. Its primary purpose is real-time semantic expansion of query terms, achieved by a spreading activation semantic closeness algorithm. Queries with associated results are stored persistently using XML format data. A Visual Basic interface combines a thesaurus browser and an initial term search facility that takes into account equivalence relationships. Terms are dragged to a direct manipulation Query Builder which maintains the facet structure.
  15. Shah, C.: Collaborative information seeking : the art and science of making the whole greater than the sum of all (2012) 0.01 
    0.008610267 = product of:
  0.06027187 = sum of:
    0.06027187 = weight(_text_:industry in 360) [ClassicSimilarity], result of:
      0.06027187 = score(doc=360,freq=2.0), product of:
        0.2351482 = queryWeight, product of:
          5.799733 = idf(docFreq=363, maxDocs=44218)
          0.04054466 = queryNorm
        0.2563144 = fieldWeight in 360, product of:
          1.4142135 = tf(freq=2.0), with freq of:
            2.0 = termFreq=2.0
          5.799733 = idf(docFreq=363, maxDocs=44218)
          0.03125 = fieldNorm(doc=360)
  0.14285715 = coord(1/7)
    Abstract
    Today's complex, information-intensive problems often require people to work together. Mostly these tasks go far beyond simply searching together; they include information lookup, sharing, synthesis, and decision-making. In addition, they all have an end-goal that is mutually beneficial to all parties involved. Such "collaborative information seeking" (CIS) projects typically last several sessions and the participants all share an intention to contribute and benefit. Not surprisingly, these processes are highly interactive. Shah focuses on two individually well-understood notions: collaboration and information seeking, with the goal of bringing them together to show how it is a natural tendency for humans to work together on complex tasks. The first part of his book introduces the general notions of collaboration and information seeking, as well as related concepts, terminology, and frameworks; and thus provides the reader with a comprehensive treatment of the concepts underlying CIS. The second part of the book details CIS as a standalone domain. A series of frameworks, theories, and models are introduced to provide a conceptual basis for CIS. The final part describes several systems and applications of CIS, along with their broader implications on other fields such as computer-supported cooperative work (CSCW) and human-computer interaction (HCI). With this first comprehensive overview of an exciting new research field, Shah delivers to graduate students and researchers in academia and industry an encompassing description of the technologies involved, state-of-the-art results, and open challenges as well as research opportunities.
  16. Surfing versus Drilling for knowledge in science : When should you use your computer? When should you use your brain? (2018) 0.01 
    0.008610267 = product of:
  0.06027187 = sum of:
    0.06027187 = weight(_text_:industry in 4564) [ClassicSimilarity], result of:
      0.06027187 = score(doc=4564,freq=2.0), product of:
        0.2351482 = queryWeight, product of:
          5.799733 = idf(docFreq=363, maxDocs=44218)
          0.04054466 = queryNorm
        0.2563144 = fieldWeight in 4564, product of:
          1.4142135 = tf(freq=2.0), with freq of:
            2.0 = termFreq=2.0
          5.799733 = idf(docFreq=363, maxDocs=44218)
          0.03125 = fieldNorm(doc=4564)
  0.14285715 = coord(1/7)
    Content
    Editorial: Surfing versus Drilling for Knowledge in Science: When should you use your computer? When should you use your brain? Blaise Pascal: Les deux infinis - The two infinities / Philippe Hünenberger and Oliver Renn - "Surfing" vs. "drilling" in the modern scientific world / Antonio Loprieno - Of millimeter paper and machine learning / Philippe Hünenberger - From one to many, from breadth to depth - industrializing research / Janne Soetbeer - "Deep drilling" requires "surfing" / Gerd Folkers and Laura Folkers - Surfing vs. drilling in science: A delicate balance / Alzbeta Kubincová - Digital trends in academia - for the sake of critical thinking or comfort? / Leif-Thore Deck - I diagnose, therefore I am a Doctor? Will drilling computer software replace human doctors in the future? / Yi Zheng - Surfing versus drilling in fundamental research / Wilfred van Gunsteren - Using brain vs. brute force in computational studies of biological systems / Arieh Warshel - Laboratory literature boards in the digital age / Jeffrey Bode - Research strategies in computational chemistry / Sereina Riniker - Surfing on the hype waves or drilling deep for knowledge? A perspective from industry / Nadine Schneider and Nikolaus Stiefl - The use and purpose of articles and scientists / Philip Mark Lund - Can you look at papers like artwork? / Oliver Renn - Dynamite fishing in the data swamp / Frank Perabo 34 Streetlights, augmented intelligence, and information discovery / Jeffrey Saffer and Vicki Burnett - "Yes Dave. Happy to do that for you." Why AI, machine learning, and blockchain will lead to deeper "drilling" / Michiel Kolman and Sjors de Heuvel - Trends in scientific document search ( Stefan Geißler - Power tools for text mining / Jane Reed 42 Publishing and patenting: Navigating the differences to ensure search success / Paul Peters
  17. Thenmalar, S.; Geetha, T.V.: Enhanced ontology-based indexing and searching (2014) 0.01 
    0.0078359 = product of:
  0.02742565 = sum of:
    0.017812477 = weight(_text_:management in 1633) [ClassicSimilarity], result of:
      0.017812477 = score(doc=1633,freq=2.0), product of:
        0.13666032 = queryWeight, product of:
          3.3706124 = idf(docFreq=4130, maxDocs=44218)
          0.04054466 = queryNorm
        0.13034125 = fieldWeight in 1633, product of:
          1.4142135 = tf(freq=2.0), with freq of:
            2.0 = termFreq=2.0
          3.3706124 = idf(docFreq=4130, maxDocs=44218)
          0.02734375 = fieldNorm(doc=1633)
    0.009613172 = product of:
      0.019226344 = sum of:
        0.019226344 = weight(_text_:22 in 1633) [ClassicSimilarity], result of:
          0.019226344 = score(doc=1633,freq=2.0), product of:
            0.14198048 = queryWeight, product of:
              3.5018296 = idf(docFreq=3622, maxDocs=44218)
              0.04054466 = queryNorm
            0.1354154 = fieldWeight in 1633, product of:
              1.4142135 = tf(freq=2.0), with freq of:
                2.0 = termFreq=2.0
              3.5018296 = idf(docFreq=3622, maxDocs=44218)
              0.02734375 = fieldNorm(doc=1633)
      0.5 = coord(1/2)
  0.2857143 = coord(2/7)
    Date
    20. 1.2015 18:30:22
    Source
    Aslib journal of information management. 66(2014) no.6, S.678-696
  18. Efthimiadis, E.N.: Approaches to search formulation and query expansion in information systems : DRS, DBMS, ES (1992) 0.01 
    0.0072703995 = product of:
  0.050892793 = sum of:
    0.050892793 = weight(_text_:management in 3871) [ClassicSimilarity], result of:
      0.050892793 = score(doc=3871,freq=2.0), product of:
        0.13666032 = queryWeight, product of:
          3.3706124 = idf(docFreq=4130, maxDocs=44218)
          0.04054466 = queryNorm
        0.37240356 = fieldWeight in 3871, product of:
          1.4142135 = tf(freq=2.0), with freq of:
            2.0 = termFreq=2.0
          3.3706124 = idf(docFreq=4130, maxDocs=44218)
          0.078125 = fieldNorm(doc=3871)
  0.14285715 = coord(1/7)
    Abstract
    Discusses the ways in which systems and/or users formulate and reformulate searches in documents retrieval systems (DRS), database management systems (DBMS) and expert systems (ES). Concludes that query formulation and reformulation has been neglected in these fields
  19. Rahmstorf, G.: Integriertes Management inhaltlicher Datenarten (2001) 0.01 
    0.0061691385 = product of:
  0.043183967 = sum of:
    0.043183967 = weight(_text_:management in 5856) [ClassicSimilarity], result of:
      0.043183967 = score(doc=5856,freq=4.0), product of:
        0.13666032 = queryWeight, product of:
          3.3706124 = idf(docFreq=4130, maxDocs=44218)
          0.04054466 = queryNorm
        0.31599492 = fieldWeight in 5856, product of:
          2.0 = tf(freq=4.0), with freq of:
            4.0 = termFreq=4.0
          3.3706124 = idf(docFreq=4130, maxDocs=44218)
          0.046875 = fieldNorm(doc=5856)
  0.14285715 = coord(1/7)
    Source
    Information Research & Content Management: Orientierung, Ordnung und Organisation im Wissensmarkt; 23. DGI-Online-Tagung der DGI und 53. Jahrestagung der Deutschen Gesellschaft für Informationswissenschaft und Informationspraxis e.V. DGI, Frankfurt am Main, 8.-10.5.2001. Proceedings. Hrsg.: R. Schmidt
  20. Bettencourt, N.; Silva, N.; Barroso, J.: Semantically enhancing recommender systems (2016) 0.01 
    0.0061691385 = product of:
  0.043183967 = sum of:
    0.043183967 = weight(_text_:management in 3374) [ClassicSimilarity], result of:
      0.043183967 = score(doc=3374,freq=4.0), product of:
        0.13666032 = queryWeight, product of:
          3.3706124 = idf(docFreq=4130, maxDocs=44218)
          0.04054466 = queryNorm
        0.31599492 = fieldWeight in 3374, product of:
          2.0 = tf(freq=4.0), with freq of:
            4.0 = termFreq=4.0
          3.3706124 = idf(docFreq=4130, maxDocs=44218)
          0.046875 = fieldNorm(doc=3374)
  0.14285715 = coord(1/7)
    Abstract
    As the amount of content and the number of users in social relationships is continually growing in the Internet, resource sharing and access policy management is difficult, time-consuming and error-prone. Cross-domain recommendation of private or protected resources managed and secured by each domain's specific access rules is impracticable due to private security policies and poor sharing mechanisms. This work focus on exploiting resource's content, user's preferences, users' social networks and semantic information to cross-relate different resources through their meta information using recommendation techniques that combine collaborative-filtering techniques with semantics annotations, by generating associations between resources. The semantic similarities established between resources are used on a hybrid recommendation engine that interprets user and resources' semantic information. The recommendation engine allows the promotion and discovery of unknown-unknown resources to users that could not even know about the existence of those resources thus providing means to solve the cross-domain recommendation of private or protected resources.
    Source
    Knowledge discovery, knowledge engineering and knowledge management: 7th International Joint Conference, IC3K 2015, Lisbon, Portugal, November 12-14, 2015, Revised Selected Papers. Eds.: A. Fred et al

Authors

Years

Languages

  • e 83
  • d 6
  • More… Less…

Types

  • a 81
  • el 6
  • m 4
  • r 1
  • More… Less…

Themes