Search (33 results, page 1 of 2)

  • × theme_ss:"Semantisches Umfeld in Indexierung u. Retrieval"
  1. Bradford, R.B.: Relationship discovery in large text collections using Latent Semantic Indexing (2006) 0.05 
    0.047155138 = product of:
  0.11788784 = sum of:
    0.090309605 = weight(_text_:link in 1163) [ClassicSimilarity], result of:
      0.090309605 = score(doc=1163,freq=4.0), product of:
        0.2711644 = queryWeight, product of:
          5.3287 = idf(docFreq=582, maxDocs=44218)
          0.05088753 = queryNorm
        0.33304375 = fieldWeight in 1163, product of:
          2.0 = tf(freq=4.0), with freq of:
            4.0 = termFreq=4.0
          5.3287 = idf(docFreq=582, maxDocs=44218)
          0.03125 = fieldNorm(doc=1163)
    0.027578231 = weight(_text_:22 in 1163) [ClassicSimilarity], result of:
      0.027578231 = score(doc=1163,freq=2.0), product of:
        0.17819946 = queryWeight, product of:
          3.5018296 = idf(docFreq=3622, maxDocs=44218)
          0.05088753 = queryNorm
        0.15476047 = fieldWeight in 1163, 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=1163)
  0.4 = coord(2/5)
    Source
    Proceedings of the Fourth Workshop on Link Analysis, Counterterrorism, and Security, SIAM Data Mining Conference, Bethesda, MD, 20-22 April, 2006. [http://www.siam.org/meetings/sdm06/workproceed/Link%20Analysis/15.pdf]
  2. Menczer, F.: Lexical and semantic clustering by Web links (2004) 0.04 
    0.042837612 = product of:
  0.21418805 = sum of:
    0.21418805 = weight(_text_:link in 3090) [ClassicSimilarity], result of:
      0.21418805 = score(doc=3090,freq=10.0), product of:
        0.2711644 = queryWeight, product of:
          5.3287 = idf(docFreq=582, maxDocs=44218)
          0.05088753 = queryNorm
        0.78988266 = fieldWeight in 3090, product of:
          3.1622777 = tf(freq=10.0), with freq of:
            10.0 = termFreq=10.0
          5.3287 = idf(docFreq=582, maxDocs=44218)
          0.046875 = fieldNorm(doc=3090)
  0.2 = coord(1/5)
    Abstract
    Recent Web-searching and -mining tools are combining text and link analysis to improve ranking and crawling algorithms. The central assumption behind such approaches is that there is a correiation between the graph structure of the Web and the text and meaning of pages. Here I formalize and empirically evaluate two general conjectures drawing connections from link information to lexical and semantic Web content. The link-content conjecture states that a page is similar to the pages that link to it, and the link-cluster conjecture that pages about the same topic are clustered together. These conjectures are offen simply assumed to hold, and Web search tools are built an such assumptions. The present quantitative confirmation sheds light an the connection between the success of the latest Web-mining techniques and the small world topology of the Web, with encouraging implications for the design of better crawling algorithms.
  3. Gillitzer, B.: Yewno (2017) 0.04 
    0.036574703 = product of:
  0.09143676 = sum of:
    0.06385853 = weight(_text_:link in 3447) [ClassicSimilarity], result of:
      0.06385853 = score(doc=3447,freq=2.0), product of:
        0.2711644 = queryWeight, product of:
          5.3287 = idf(docFreq=582, maxDocs=44218)
          0.05088753 = queryNorm
        0.23549749 = fieldWeight in 3447, product of:
          1.4142135 = tf(freq=2.0), with freq of:
            2.0 = termFreq=2.0
          5.3287 = idf(docFreq=582, maxDocs=44218)
          0.03125 = fieldNorm(doc=3447)
    0.027578231 = weight(_text_:22 in 3447) [ClassicSimilarity], result of:
      0.027578231 = score(doc=3447,freq=2.0), product of:
        0.17819946 = queryWeight, product of:
          3.5018296 = idf(docFreq=3622, maxDocs=44218)
          0.05088753 = queryNorm
        0.15476047 = fieldWeight in 3447, 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=3447)
  0.4 = coord(2/5)
    Abstract
    "Die Bayerische Staatsbibliothek testet den semantischen "Discovery Service" Yewno als zusätzliche thematische Suchmaschine für digitale Volltexte. Der Service ist unter folgendem Link erreichbar: https://www.bsb-muenchen.de/recherche-und-service/suchen-und-finden/yewno/. Das Identifizieren von Themen, um die es in einem Text geht, basiert bei Yewno alleine auf Methoden der künstlichen Intelligenz und des maschinellen Lernens. Dabei werden sie nicht - wie bei klassischen Katalogsystemen - einem Text als Ganzem zugeordnet, sondern der jeweiligen Textstelle. Die Eingabe eines Suchwortes bzw. Themas, bei Yewno "Konzept" genannt, führt umgehend zu einer grafischen Darstellung eines semantischen Netzwerks relevanter Konzepte und ihrer inhaltlichen Zusammenhänge. So ist ein Navigieren über thematische Beziehungen bis hin zu den Fundstellen im Text möglich, die dann in sogenannten Snippets angezeigt werden. In der Test-Anwendung der Bayerischen Staatsbibliothek durchsucht Yewno aktuell 40 Millionen englischsprachige Dokumente aus Publikationen namhafter Wissenschaftsverlage wie Cambridge University Press, Oxford University Press, Wiley, Sage und Springer, sowie Dokumente, die im Open Access verfügbar sind. Nach der dreimonatigen Testphase werden zunächst die Rückmeldungen der Nutzer ausgewertet. Ob und wann dann der Schritt von der klassischen Suchmaschine zum semantischen "Discovery Service" kommt und welche Bedeutung Anwendungen wie Yewno in diesem Zusammenhang einnehmen werden, ist heute noch nicht abzusehen. Die Software Yewno wurde vom gleichnamigen Startup in Zusammenarbeit mit der Stanford University entwickelt, mit der auch die Bayerische Staatsbibliothek eng kooperiert. [Inetbib-Posting vom 22.02.2017].
    Date
    22. 2.2017 10:16:49
  4. Boyack, K.W.; Wylie,B.N.; Davidson, G.S.: Information Visualization, Human-Computer Interaction, and Cognitive Psychology : Domain Visualizations (2002) 0.02 
    0.019500753 = product of:
  0.09750377 = sum of:
    0.09750377 = weight(_text_:22 in 1352) [ClassicSimilarity], result of:
      0.09750377 = score(doc=1352,freq=4.0), product of:
        0.17819946 = queryWeight, product of:
          3.5018296 = idf(docFreq=3622, maxDocs=44218)
          0.05088753 = queryNorm
        0.54716086 = fieldWeight in 1352, product of:
          2.0 = tf(freq=4.0), with freq of:
            4.0 = termFreq=4.0
          3.5018296 = idf(docFreq=3622, maxDocs=44218)
          0.078125 = fieldNorm(doc=1352)
  0.2 = coord(1/5)
    Date
    22. 2.2003 17:25:39
    22. 2.2003 18:17:40
  5. Smeaton, A.F.; Rijsbergen, C.J. van: ¬The retrieval effects of query expansion on a feedback document retrieval system (1983) 0.02 
    0.019304762 = product of:
  0.09652381 = sum of:
    0.09652381 = weight(_text_:22 in 2134) [ClassicSimilarity], result of:
      0.09652381 = score(doc=2134,freq=2.0), product of:
        0.17819946 = queryWeight, product of:
          3.5018296 = idf(docFreq=3622, maxDocs=44218)
          0.05088753 = queryNorm
        0.5416616 = fieldWeight in 2134, product of:
          1.4142135 = tf(freq=2.0), with freq of:
            2.0 = termFreq=2.0
          3.5018296 = idf(docFreq=3622, maxDocs=44218)
          0.109375 = fieldNorm(doc=2134)
  0.2 = coord(1/5)
    Date
    30. 3.2001 13:32:22
  6. Nie, J.-Y.: Query expansion and query translation as logical inference (2003) 0.02 
    0.01915756 = product of:
  0.0957878 = sum of:
    0.0957878 = weight(_text_:link in 1425) [ClassicSimilarity], result of:
      0.0957878 = score(doc=1425,freq=2.0), product of:
        0.2711644 = queryWeight, product of:
          5.3287 = idf(docFreq=582, maxDocs=44218)
          0.05088753 = queryNorm
        0.35324624 = fieldWeight in 1425, product of:
          1.4142135 = tf(freq=2.0), with freq of:
            2.0 = termFreq=2.0
          5.3287 = idf(docFreq=582, maxDocs=44218)
          0.046875 = fieldNorm(doc=1425)
  0.2 = coord(1/5)
    Abstract
    A number of studies have examined the problems of query expansion in monolingual Information Retrieval (IR), and query translation for crosslanguage IR. However, no link has been made between them. This article first shows that query translation is a special case of query expansion. There is also another set of studies an inferential IR. Again, there is no relationship established with query translation or query expansion. The second claim of this article is that logical inference is a general form that covers query expansion and query translation. This analysis provides a unified view of different subareas of IR. We further develop the inferential IR approach in two particular contexts: using fuzzy logic and probability theory. The evaluation formulas obtained are shown to strongly correspond to those used in other IR models. This indicates that inference is indeed the core of advanced IR.
  7. Goslin, K.; Hofmann, M.: ¬A Wikipedia powered state-based approach to automatic search query enhancement (2018) 0.02 
    0.01915756 = product of:
  0.0957878 = sum of:
    0.0957878 = weight(_text_:link in 5083) [ClassicSimilarity], result of:
      0.0957878 = score(doc=5083,freq=2.0), product of:
        0.2711644 = queryWeight, product of:
          5.3287 = idf(docFreq=582, maxDocs=44218)
          0.05088753 = queryNorm
        0.35324624 = fieldWeight in 5083, product of:
          1.4142135 = tf(freq=2.0), with freq of:
            2.0 = termFreq=2.0
          5.3287 = idf(docFreq=582, maxDocs=44218)
          0.046875 = fieldNorm(doc=5083)
  0.2 = coord(1/5)
    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.
  8. Tudhope, D.; Alani, H.; Jones, C.: Augmenting thesaurus relationships : possibilities for retrieval (2001) 0.02 
    0.015964633 = product of:
  0.079823166 = sum of:
    0.079823166 = weight(_text_:link in 1520) [ClassicSimilarity], result of:
      0.079823166 = score(doc=1520,freq=2.0), product of:
        0.2711644 = queryWeight, product of:
          5.3287 = idf(docFreq=582, maxDocs=44218)
          0.05088753 = queryNorm
        0.29437187 = fieldWeight in 1520, product of:
          1.4142135 = tf(freq=2.0), with freq of:
            2.0 = termFreq=2.0
          5.3287 = idf(docFreq=582, maxDocs=44218)
          0.0390625 = fieldNorm(doc=1520)
  0.2 = coord(1/5)
    Abstract
    This paper discusses issues concerning the augmentation of thesaurus relationships, in light of new application possibilities for retrieval. We first discuss a case study that explored the retrieval potential of an augmented set of thesaurus relationships by specialising standard relationships into richer subtypes, in particular hierarchical geographical containment and the associative relationship. We then locate this work in a broader context by reviewing various attempts to build taxonomies of thesaurus relationships, and conclude by discussing the feasibility of hierarchically augmenting the core set of thesaurus relationships, particularly the associative relationship. We discuss the possibility of enriching the specification and semantics of Related Term (RT relationships), while maintaining compatibility with traditional thesauri via a limited hierarchical extension of the associative (and hierarchical) relationships. This would be facilitated by distinguishing the type of term from the (sub)type of relationship and explicitly specifying semantic categories for terms following a faceted approach. We first illustrate how hierarchical spatial relationships can be used to provide more flexible retrieval for queries incorporating place names in applications employing online gazetteers and geographical thesauri. We then employ a set of experimental scenarios to investigate key issues affecting use of the associative (RT) thesaurus relationships in semantic distance measures. Previous work has noted the potential of RTs in thesaurus search aids but also the problem of uncontrolled expansion of query term sets. Results presented in this paper suggest the potential for taking account of the hierarchical context of an RT link and specialisations of the RT relationship
  9. Rekabsaz, N. et al.: Toward optimized multimodal concept indexing (2016) 0.01 
    0.013789116 = product of:
  0.06894558 = sum of:
    0.06894558 = weight(_text_:22 in 2751) [ClassicSimilarity], result of:
      0.06894558 = score(doc=2751,freq=2.0), product of:
        0.17819946 = queryWeight, product of:
          3.5018296 = idf(docFreq=3622, maxDocs=44218)
          0.05088753 = queryNorm
        0.38690117 = fieldWeight in 2751, product of:
          1.4142135 = tf(freq=2.0), with freq of:
            2.0 = termFreq=2.0
          3.5018296 = idf(docFreq=3622, maxDocs=44218)
          0.078125 = fieldNorm(doc=2751)
  0.2 = coord(1/5)
    Date
    1. 2.2016 18:25:22
  10. Kozikowski, P. et al.: Support of part-whole relations in query answering (2016) 0.01 
    0.013789116 = product of:
  0.06894558 = sum of:
    0.06894558 = weight(_text_:22 in 2754) [ClassicSimilarity], result of:
      0.06894558 = score(doc=2754,freq=2.0), product of:
        0.17819946 = queryWeight, product of:
          3.5018296 = idf(docFreq=3622, maxDocs=44218)
          0.05088753 = queryNorm
        0.38690117 = fieldWeight in 2754, product of:
          1.4142135 = tf(freq=2.0), with freq of:
            2.0 = termFreq=2.0
          3.5018296 = idf(docFreq=3622, maxDocs=44218)
          0.078125 = fieldNorm(doc=2754)
  0.2 = coord(1/5)
    Date
    1. 2.2016 18:25:22
  11. Marx, E. et al.: Exploring term networks for semantic search over RDF knowledge graphs (2016) 0.01 
    0.013789116 = product of:
  0.06894558 = sum of:
    0.06894558 = weight(_text_:22 in 3279) [ClassicSimilarity], result of:
      0.06894558 = score(doc=3279,freq=2.0), product of:
        0.17819946 = queryWeight, product of:
          3.5018296 = idf(docFreq=3622, maxDocs=44218)
          0.05088753 = queryNorm
        0.38690117 = fieldWeight in 3279, product of:
          1.4142135 = tf(freq=2.0), with freq of:
            2.0 = termFreq=2.0
          3.5018296 = idf(docFreq=3622, maxDocs=44218)
          0.078125 = fieldNorm(doc=3279)
  0.2 = coord(1/5)
    Source
    Metadata and semantics research: 10th International Conference, MTSR 2016, Göttingen, Germany, November 22-25, 2016, Proceedings. Eds.: E. Garoufallou
  12. Kopácsi, S. et al.: Development of a classification server to support metadata harmonization in a long term preservation system (2016) 0.01 
    0.013789116 = product of:
  0.06894558 = sum of:
    0.06894558 = weight(_text_:22 in 3280) [ClassicSimilarity], result of:
      0.06894558 = score(doc=3280,freq=2.0), product of:
        0.17819946 = queryWeight, product of:
          3.5018296 = idf(docFreq=3622, maxDocs=44218)
          0.05088753 = queryNorm
        0.38690117 = fieldWeight in 3280, product of:
          1.4142135 = tf(freq=2.0), with freq of:
            2.0 = termFreq=2.0
          3.5018296 = idf(docFreq=3622, maxDocs=44218)
          0.078125 = fieldNorm(doc=3280)
  0.2 = coord(1/5)
    Source
    Metadata and semantics research: 10th International Conference, MTSR 2016, Göttingen, Germany, November 22-25, 2016, Proceedings. Eds.: E. Garoufallou
  13. Sacco, G.M.: Dynamic taxonomies and guided searches (2006) 0.01 
    0.013650528 = product of:
  0.06825264 = sum of:
    0.06825264 = weight(_text_:22 in 5295) [ClassicSimilarity], result of:
      0.06825264 = score(doc=5295,freq=4.0), product of:
        0.17819946 = queryWeight, product of:
          3.5018296 = idf(docFreq=3622, maxDocs=44218)
          0.05088753 = 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.2 = coord(1/5)
    Date
    22. 7.2006 17:56:22
  14. Semantic search over the Web (2012) 0.01 
    0.012771706 = product of:
  0.06385853 = sum of:
    0.06385853 = weight(_text_:link in 411) [ClassicSimilarity], result of:
      0.06385853 = score(doc=411,freq=2.0), product of:
        0.2711644 = queryWeight, product of:
          5.3287 = idf(docFreq=582, maxDocs=44218)
          0.05088753 = queryNorm
        0.23549749 = fieldWeight in 411, product of:
          1.4142135 = tf(freq=2.0), with freq of:
            2.0 = termFreq=2.0
          5.3287 = idf(docFreq=582, maxDocs=44218)
          0.03125 = fieldNorm(doc=411)
  0.2 = coord(1/5)
    Content
    Inhalt: Introduction.- Part I Introduction to Web of Data.- Topology of the Web of Data.- Storing and Indexing Massive RDF Data Sets.- Designing Exploratory Search Applications upon Web Data Sources.- Part II Search over the Web.- Path-oriented Keyword Search query over RDF.- Interactive Query Construction for Keyword Search on the SemanticWeb.- Understanding the Semantics of Keyword Queries on Relational DataWithout Accessing the Instance.- Keyword-Based Search over Semantic Data.- Semantic Link Discovery over Relational Data.- Embracing Uncertainty in Entity Linking.- The Return of the Entity-Relationship Model: Ontological Query Answering.- Linked Data Services and Semantics-enabled Mashup.- Part III Linked Data Search engines.- A Recommender System for Linked Data.- Flint: from Web Pages to Probabilistic Semantic Data.- Searching and Browsing Linked Data with SWSE.
  15. Brambilla, M.; Ceri, S.: Designing exploratory search applications upon Web data sources (2012) 0.01 
    0.012771706 = product of:
  0.06385853 = sum of:
    0.06385853 = weight(_text_:link in 428) [ClassicSimilarity], result of:
      0.06385853 = score(doc=428,freq=2.0), product of:
        0.2711644 = queryWeight, product of:
          5.3287 = idf(docFreq=582, maxDocs=44218)
          0.05088753 = queryNorm
        0.23549749 = fieldWeight in 428, product of:
          1.4142135 = tf(freq=2.0), with freq of:
            2.0 = termFreq=2.0
          5.3287 = idf(docFreq=582, maxDocs=44218)
          0.03125 = fieldNorm(doc=428)
  0.2 = coord(1/5)
    Abstract
    Search is the preferred method to access information in today's computing systems. The Web, accessed through search engines, is universally recognized as the source for answering users' information needs. However, offering a link to a Web page does not cover all information needs. Even simple problems, such as "Which theater offers an at least three-stars action movie in London close to a good Italian restaurant," can only be solved by searching the Web multiple times, e.g., by extracting a list of the recent action movies filtered by ranking, then looking for movie theaters, then looking for Italian restaurants close to them. While search engines hint to useful information, the user's brain is the fundamental platform for information integration. An important trend is the availability of new, specialized data sources-the so-called "long tail" of the Web of data. Such carefully collected and curated data sources can be much more valuable than information currently available in Web pages; however, many sources remain hidden or insulated, in the lack of software solutions for bringing them to surface and making them usable in the search context. A new class of tailor-made systems, designed to satisfy the needs of users with specific aims, will support the publishing and integration of data sources for vertical domains; the user will be able to select sources based on individual or collective trust, and systems will be able to route queries to such sources and to provide easyto-use interfaces for combining them within search strategies, at the same time, rewarding the data source owners for each contribution to effective search. Efforts such as Google's Fusion Tables show that the technology for bringing hidden data sources to surface is feasible.
  16. Efthimiadis, E.N.: End-users' understanding of thesaural knowledge structures in interactive query expansion (1994) 0.01 
    0.011031292 = product of:
  0.055156462 = sum of:
    0.055156462 = weight(_text_:22 in 5693) [ClassicSimilarity], result of:
      0.055156462 = score(doc=5693,freq=2.0), product of:
        0.17819946 = queryWeight, product of:
          3.5018296 = idf(docFreq=3622, maxDocs=44218)
          0.05088753 = 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.2 = coord(1/5)
    Date
    30. 3.2001 13:35:22
  17. Fieldhouse, M.; Hancock-Beaulieu, M.: ¬The design of a graphical user interface for a highly interactive information retrieval system (1996) 0.01 
    0.009652381 = product of:
  0.048261903 = sum of:
    0.048261903 = weight(_text_:22 in 6958) [ClassicSimilarity], result of:
      0.048261903 = score(doc=6958,freq=2.0), product of:
        0.17819946 = queryWeight, product of:
          3.5018296 = idf(docFreq=3622, maxDocs=44218)
          0.05088753 = queryNorm
        0.2708308 = fieldWeight in 6958, product of:
          1.4142135 = tf(freq=2.0), with freq of:
            2.0 = termFreq=2.0
          3.5018296 = idf(docFreq=3622, maxDocs=44218)
          0.0546875 = fieldNorm(doc=6958)
  0.2 = coord(1/5)
    Source
    Information retrieval: new systems and current research. Proceedings of the 16th Research Colloquium of the British Computer Society Information Retrieval Specialist Group, Drymen, Scotland, 22-23 Mar 94. Ed.: R. Leon
  18. Chang, C.-H.; Hsu, C.-C.: Integrating query expansion and conceptual relevance feedback for personalized Web information retrieval (1998) 0.01 
    0.009652381 = product of:
  0.048261903 = sum of:
    0.048261903 = weight(_text_:22 in 1319) [ClassicSimilarity], result of:
      0.048261903 = score(doc=1319,freq=2.0), product of:
        0.17819946 = queryWeight, product of:
          3.5018296 = idf(docFreq=3622, maxDocs=44218)
          0.05088753 = queryNorm
        0.2708308 = fieldWeight in 1319, product of:
          1.4142135 = tf(freq=2.0), with freq of:
            2.0 = termFreq=2.0
          3.5018296 = idf(docFreq=3622, maxDocs=44218)
          0.0546875 = fieldNorm(doc=1319)
  0.2 = coord(1/5)
    Date
    1. 8.1996 22:08:06
  19. Faaborg, A.; Lagoze, C.: Semantic browsing (2003) 0.01 
    0.009652381 = product of:
  0.048261903 = sum of:
    0.048261903 = weight(_text_:22 in 1026) [ClassicSimilarity], result of:
      0.048261903 = score(doc=1026,freq=2.0), product of:
        0.17819946 = queryWeight, product of:
          3.5018296 = idf(docFreq=3622, maxDocs=44218)
          0.05088753 = queryNorm
        0.2708308 = fieldWeight in 1026, product of:
          1.4142135 = tf(freq=2.0), with freq of:
            2.0 = termFreq=2.0
          3.5018296 = idf(docFreq=3622, maxDocs=44218)
          0.0546875 = fieldNorm(doc=1026)
  0.2 = coord(1/5)
    Source
    Research and advanced technology for digital libraries : 7th European Conference, proceedings / ECDL 2003, Trondheim, Norway, August 17-22, 2003
  20. Knorz, G.; Rein, B.: Semantische Suche in einer Hochschulontologie (2005) 0.01 
    0.009652381 = product of:
  0.048261903 = sum of:
    0.048261903 = weight(_text_:22 in 1852) [ClassicSimilarity], result of:
      0.048261903 = score(doc=1852,freq=2.0), product of:
        0.17819946 = queryWeight, product of:
          3.5018296 = idf(docFreq=3622, maxDocs=44218)
          0.05088753 = queryNorm
        0.2708308 = fieldWeight in 1852, product of:
          1.4142135 = tf(freq=2.0), with freq of:
            2.0 = termFreq=2.0
          3.5018296 = idf(docFreq=3622, maxDocs=44218)
          0.0546875 = fieldNorm(doc=1852)
  0.2 = coord(1/5)
    Date
    11. 2.2011 18:22:58

Authors

Years

Languages

  • e 29
  • d 4

Types

Themes