Search (413 results, page 1 of 21)

0.29022786 = product of:
  0.43534178 = sum of:
    0.061069533 = product of:
      0.1832086 = sum of:
        0.1832086 = weight(_text_:3a in 400) [ClassicSimilarity], result of:
          0.1832086 = score(doc=400,freq=2.0), product of:
            0.3259835 = queryWeight, product of:
              8.478011 = idf(docFreq=24, maxDocs=44218)
              0.03845047 = queryNorm
            0.56201804 = fieldWeight in 400, product of:
              1.4142135 = tf(freq=2.0), with freq of:
                2.0 = termFreq=2.0
              8.478011 = idf(docFreq=24, maxDocs=44218)
              0.046875 = fieldNorm(doc=400)
      0.33333334 = coord(1/3)
    0.1832086 = weight(_text_:2f in 400) [ClassicSimilarity], result of:
      0.1832086 = score(doc=400,freq=2.0), product of:
        0.3259835 = queryWeight, product of:
          8.478011 = idf(docFreq=24, maxDocs=44218)
          0.03845047 = queryNorm
        0.56201804 = fieldWeight in 400, product of:
          1.4142135 = tf(freq=2.0), with freq of:
            2.0 = termFreq=2.0
          8.478011 = idf(docFreq=24, maxDocs=44218)
          0.046875 = fieldNorm(doc=400)
    0.007855045 = weight(_text_:information in 400) [ClassicSimilarity], result of:
      0.007855045 = score(doc=400,freq=2.0), product of:
        0.067498945 = queryWeight, product of:
          1.7554779 = idf(docFreq=20772, maxDocs=44218)
          0.03845047 = queryNorm
        0.116372846 = fieldWeight in 400, product of:
          1.4142135 = tf(freq=2.0), with freq of:
            2.0 = termFreq=2.0
          1.7554779 = idf(docFreq=20772, maxDocs=44218)
          0.046875 = fieldNorm(doc=400)
    0.1832086 = weight(_text_:2f in 400) [ClassicSimilarity], result of:
      0.1832086 = score(doc=400,freq=2.0), product of:
        0.3259835 = queryWeight, product of:
          8.478011 = idf(docFreq=24, maxDocs=44218)
          0.03845047 = queryNorm
        0.56201804 = fieldWeight in 400, product of:
          1.4142135 = tf(freq=2.0), with freq of:
            2.0 = termFreq=2.0
          8.478011 = idf(docFreq=24, maxDocs=44218)
          0.046875 = fieldNorm(doc=400)
  0.6666667 = coord(4/6)

Abstract

On a scientific concept hierarchy, a parent concept may have a few attributes, each of which has multiple values being a group of child concepts. We call these attributes facets: classification has a few facets such as application (e.g., face recognition), model (e.g., svm, knn), and metric (e.g., precision). In this work, we aim at building faceted concept hierarchies from scientific literature. Hierarchy construction methods heavily rely on hypernym detection, however, the faceted relations are parent-to-child links but the hypernym relation is a multi-hop, i.e., ancestor-to-descendent link with a specific facet "type-of". We use information extraction techniques to find synonyms, sibling concepts, and ancestor-descendent relations from a data science corpus. And we propose a hierarchy growth algorithm to infer the parent-child links from the three types of relationships. It resolves conflicts by maintaining the acyclic structure of a hierarchy.

Content

Vgl.: https%3A%2F%2Faclanthology.org%2FD19-5317.pdf&usg=AOvVaw0ZZFyq5wWTtNTvNkrvjlGA.

0.2673241 = product of:
  0.4009861 = sum of:
    0.040713027 = product of:
      0.122139074 = sum of:
        0.122139074 = weight(_text_:3a in 5820) [ClassicSimilarity], result of:
          0.122139074 = score(doc=5820,freq=2.0), product of:
            0.3259835 = queryWeight, product of:
              8.478011 = idf(docFreq=24, maxDocs=44218)
              0.03845047 = queryNorm
            0.3746787 = fieldWeight in 5820, product of:
              1.4142135 = tf(freq=2.0), with freq of:
                2.0 = termFreq=2.0
              8.478011 = idf(docFreq=24, maxDocs=44218)
              0.03125 = fieldNorm(doc=5820)
      0.33333334 = coord(1/3)
    0.17273073 = weight(_text_:2f in 5820) [ClassicSimilarity], result of:
      0.17273073 = score(doc=5820,freq=4.0), product of:
        0.3259835 = queryWeight, product of:
          8.478011 = idf(docFreq=24, maxDocs=44218)
          0.03845047 = queryNorm
        0.5298757 = fieldWeight in 5820, product of:
          2.0 = tf(freq=4.0), with freq of:
            4.0 = termFreq=4.0
          8.478011 = idf(docFreq=24, maxDocs=44218)
          0.03125 = fieldNorm(doc=5820)
    0.014811614 = weight(_text_:information in 5820) [ClassicSimilarity], result of:
      0.014811614 = score(doc=5820,freq=16.0), product of:
        0.067498945 = queryWeight, product of:
          1.7554779 = idf(docFreq=20772, maxDocs=44218)
          0.03845047 = queryNorm
        0.21943474 = fieldWeight in 5820, product of:
          4.0 = tf(freq=16.0), with freq of:
            16.0 = termFreq=16.0
          1.7554779 = idf(docFreq=20772, maxDocs=44218)
          0.03125 = fieldNorm(doc=5820)
    0.17273073 = weight(_text_:2f in 5820) [ClassicSimilarity], result of:
      0.17273073 = score(doc=5820,freq=4.0), product of:
        0.3259835 = queryWeight, product of:
          8.478011 = idf(docFreq=24, maxDocs=44218)
          0.03845047 = queryNorm
        0.5298757 = fieldWeight in 5820, product of:
          2.0 = tf(freq=4.0), with freq of:
            4.0 = termFreq=4.0
          8.478011 = idf(docFreq=24, maxDocs=44218)
          0.03125 = fieldNorm(doc=5820)
  0.6666667 = coord(4/6)

Abstract

The successes of information retrieval (IR) in recent decades were built upon bag-of-words representations. Effective as it is, bag-of-words is only a shallow text understanding; there is a limited amount of information for document ranking in the word space. This dissertation goes beyond words and builds knowledge based text representations, which embed the external and carefully curated information from knowledge bases, and provide richer and structured evidence for more advanced information retrieval systems. This thesis research first builds query representations with entities associated with the query. Entities' descriptions are used by query expansion techniques that enrich the query with explanation terms. Then we present a general framework that represents a query with entities that appear in the query, are retrieved by the query, or frequently show up in the top retrieved documents. A latent space model is developed to jointly learn the connections from query to entities and the ranking of documents, modeling the external evidence from knowledge bases and internal ranking features cooperatively. To further improve the quality of relevant entities, a defining factor of our query representations, we introduce learning to rank to entity search and retrieve better entities from knowledge bases. In the document representation part, this thesis research also moves one step forward with a bag-of-entities model, in which documents are represented by their automatic entity annotations, and the ranking is performed in the entity space.
This proposal includes plans to improve the quality of relevant entities with a co-learning framework that learns from both entity labels and document labels. We also plan to develop a hybrid ranking system that combines word based and entity based representations together with their uncertainties considered. At last, we plan to enrich the text representations with connections between entities. We propose several ways to infer entity graph representations for texts, and to rank documents using their structure representations. This dissertation overcomes the limitation of word based representations with external and carefully curated information from knowledge bases. We believe this thesis research is a solid start towards the new generation of intelligent, semantic, and structured information retrieval.

Content

Submitted in partial fulfillment of the requirements for the degree of Doctor of Philosophy in Language and Information Technologies. Vgl.: https%3A%2F%2Fwww.cs.cmu.edu%2F~cx%2Fpapers%2Fknowledge_based_text_representation.pdf&usg=AOvVaw0SaTSvhWLTh__Uz_HtOtl3.

0.20046751 = product of:
  0.30070126 = sum of:
    0.040713027 = product of:
      0.122139074 = sum of:
        0.122139074 = weight(_text_:3a in 701) [ClassicSimilarity], result of:
          0.122139074 = score(doc=701,freq=2.0), product of:
            0.3259835 = queryWeight, product of:
              8.478011 = idf(docFreq=24, maxDocs=44218)
              0.03845047 = queryNorm
            0.3746787 = fieldWeight in 701, product of:
              1.4142135 = tf(freq=2.0), with freq of:
                2.0 = termFreq=2.0
              8.478011 = idf(docFreq=24, maxDocs=44218)
              0.03125 = fieldNorm(doc=701)
      0.33333334 = coord(1/3)
    0.122139074 = weight(_text_:2f in 701) [ClassicSimilarity], result of:
      0.122139074 = score(doc=701,freq=2.0), product of:
        0.3259835 = queryWeight, product of:
          8.478011 = idf(docFreq=24, maxDocs=44218)
          0.03845047 = queryNorm
        0.3746787 = fieldWeight in 701, product of:
          1.4142135 = tf(freq=2.0), with freq of:
            2.0 = termFreq=2.0
          8.478011 = idf(docFreq=24, maxDocs=44218)
          0.03125 = fieldNorm(doc=701)
    0.015710087 = weight(_text_:information in 701) [ClassicSimilarity], result of:
      0.015710087 = score(doc=701,freq=18.0), product of:
        0.067498945 = queryWeight, product of:
          1.7554779 = idf(docFreq=20772, maxDocs=44218)
          0.03845047 = queryNorm
        0.23274568 = fieldWeight in 701, product of:
          4.2426405 = tf(freq=18.0), with freq of:
            18.0 = termFreq=18.0
          1.7554779 = idf(docFreq=20772, maxDocs=44218)
          0.03125 = fieldNorm(doc=701)
    0.122139074 = weight(_text_:2f in 701) [ClassicSimilarity], result of:
      0.122139074 = score(doc=701,freq=2.0), product of:
        0.3259835 = queryWeight, product of:
          8.478011 = idf(docFreq=24, maxDocs=44218)
          0.03845047 = queryNorm
        0.3746787 = fieldWeight in 701, product of:
          1.4142135 = tf(freq=2.0), with freq of:
            2.0 = termFreq=2.0
          8.478011 = idf(docFreq=24, maxDocs=44218)
          0.03125 = fieldNorm(doc=701)
  0.6666667 = coord(4/6)

Abstract

By the explosion of possibilities for a ubiquitous content production, the information overload problem reaches the level of complexity which cannot be managed by traditional modelling approaches anymore. Due to their pure syntactical nature traditional information retrieval approaches did not succeed in treating content itself (i.e. its meaning, and not its representation). This leads to a very low usefulness of the results of a retrieval process for a user's task at hand. In the last ten years ontologies have been emerged from an interesting conceptualisation paradigm to a very promising (semantic) modelling technology, especially in the context of the Semantic Web. From the information retrieval point of view, ontologies enable a machine-understandable form of content description, such that the retrieval process can be driven by the meaning of the content. However, the very ambiguous nature of the retrieval process in which a user, due to the unfamiliarity with the underlying repository and/or query syntax, just approximates his information need in a query, implies a necessity to include the user in the retrieval process more actively in order to close the gap between the meaning of the content and the meaning of a user's query (i.e. his information need). This thesis lays foundation for such an ontology-based interactive retrieval process, in which the retrieval system interacts with a user in order to conceptually interpret the meaning of his query, whereas the underlying domain ontology drives the conceptualisation process. In that way the retrieval process evolves from a query evaluation process into a highly interactive cooperation between a user and the retrieval system, in which the system tries to anticipate the user's information need and to deliver the relevant content proactively. Moreover, the notion of content relevance for a user's query evolves from a content dependent artefact to the multidimensional context-dependent structure, strongly influenced by the user's preferences. This cooperation process is realized as the so-called Librarian Agent Query Refinement Process. In order to clarify the impact of an ontology on the retrieval process (regarding its complexity and quality), a set of methods and tools for different levels of content and query formalisation is developed, ranging from pure ontology-based inferencing to keyword-based querying in which semantics automatically emerges from the results. Our evaluation studies have shown that the possibilities to conceptualize a user's information need in the right manner and to interpret the retrieval results accordingly are key issues for realizing much more meaningful information retrieval systems.

Content

Vgl.: http%3A%2F%2Fdigbib.ubka.uni-karlsruhe.de%2Fvolltexte%2Fdocuments%2F1627&ei=tAtYUYrBNoHKtQb3l4GYBw&usg=AFQjCNHeaxKkKU3-u54LWxMNYGXaaDLCGw&sig2=8WykXWQoDKjDSdGtAakH2Q&bvm=bv.44442042,d.Yms.

0.06328891 = product of:
  0.12657782 = sum of:
    0.01309174 = weight(_text_:information in 4607) [ClassicSimilarity], result of:
      0.01309174 = score(doc=4607,freq=2.0), product of:
        0.067498945 = queryWeight, product of:
          1.7554779 = idf(docFreq=20772, maxDocs=44218)
          0.03845047 = queryNorm
        0.19395474 = fieldWeight in 4607, product of:
          1.4142135 = tf(freq=2.0), with freq of:
            2.0 = termFreq=2.0
          1.7554779 = idf(docFreq=20772, maxDocs=44218)
          0.078125 = fieldNorm(doc=4607)
    0.095963426 = weight(_text_:geschichte in 4607) [ClassicSimilarity], result of:
      0.095963426 = score(doc=4607,freq=2.0), product of:
        0.18274738 = queryWeight, product of:
          4.7528 = idf(docFreq=1036, maxDocs=44218)
          0.03845047 = queryNorm
        0.5251152 = fieldWeight in 4607, product of:
          1.4142135 = tf(freq=2.0), with freq of:
            2.0 = termFreq=2.0
          4.7528 = idf(docFreq=1036, maxDocs=44218)
          0.078125 = fieldNorm(doc=4607)
    0.017522654 = product of:
      0.05256796 = sum of:
        0.05256796 = weight(_text_:29 in 4607) [ClassicSimilarity], result of:
          0.05256796 = score(doc=4607,freq=2.0), product of:
            0.13525672 = queryWeight, product of:
              3.5176873 = idf(docFreq=3565, maxDocs=44218)
              0.03845047 = queryNorm
            0.38865322 = fieldWeight in 4607, product of:
              1.4142135 = tf(freq=2.0), with freq of:
                2.0 = termFreq=2.0
              3.5176873 = idf(docFreq=3565, maxDocs=44218)
              0.078125 = fieldNorm(doc=4607)
      0.33333334 = coord(1/3)
  0.5 = coord(3/6)

Date

20.12.2018 12:39:29

Series

Philosophie und Geschichte der Wissenschaften; Bd.18

Theme

Information

0.029760903 = product of:
  0.08928271 = sum of:
    0.007855045 = weight(_text_:information in 4024) [ClassicSimilarity], result of:
      0.007855045 = score(doc=4024,freq=2.0), product of:
        0.067498945 = queryWeight, product of:
          1.7554779 = idf(docFreq=20772, maxDocs=44218)
          0.03845047 = queryNorm
        0.116372846 = fieldWeight in 4024, product of:
          1.4142135 = tf(freq=2.0), with freq of:
            2.0 = termFreq=2.0
          1.7554779 = idf(docFreq=20772, maxDocs=44218)
          0.046875 = fieldNorm(doc=4024)
    0.08142766 = weight(_text_:geschichte in 4024) [ClassicSimilarity], result of:
      0.08142766 = score(doc=4024,freq=4.0), product of:
        0.18274738 = queryWeight, product of:
          4.7528 = idf(docFreq=1036, maxDocs=44218)
          0.03845047 = queryNorm
        0.445575 = fieldWeight in 4024, product of:
          2.0 = tf(freq=4.0), with freq of:
            4.0 = termFreq=4.0
          4.7528 = idf(docFreq=1036, maxDocs=44218)
          0.046875 = fieldNorm(doc=4024)
  0.33333334 = coord(2/6)

Abstract

Semantische Netze unterstützen den Suchvorgang im Information Retrieval. Über ihre vielfältigen Relationen und Inferenzen unterstützen sie den Anwender und helfen Daten im Kontext zu präsentieren und zu erfassen. Die Relationen ermöglichen Suchanfragen die große Treffermengen produzieren zu verfeinern und so Treffermengen zu erreichen die möglichst genau das enthalten was gesucht wurde. Es wird, anhand eines Ausschnitts des Datenbestands des Haus der Geschichte der Bundesrepublik Deutschland in Bonn, aufgezeigt wie bestehende Datenbestände in semantische Netze überführt werden können und wie diese anschließend für das Retrieval eingesetzt werden können. Für die Modellierung des semantischen Netz wird die Open Source Software Protégé in den Versionen 3.4.4. und 4.1_beta eingesetzt, die Möglichkeiten des Retrieval werden anhand der Abfragesprachen DL Query und SPARQL sowie anhand der Software Ontology Browser und OntoGraf erläutert.

0.019335657 = product of:
  0.05800697 = sum of:
    0.009164219 = weight(_text_:information in 4792) [ClassicSimilarity], result of:
      0.009164219 = score(doc=4792,freq=2.0), product of:
        0.067498945 = queryWeight, product of:
          1.7554779 = idf(docFreq=20772, maxDocs=44218)
          0.03845047 = queryNorm
        0.13576832 = fieldWeight in 4792, product of:
          1.4142135 = tf(freq=2.0), with freq of:
            2.0 = termFreq=2.0
          1.7554779 = idf(docFreq=20772, maxDocs=44218)
          0.0546875 = fieldNorm(doc=4792)
    0.04884275 = product of:
      0.07326412 = sum of:
        0.03679757 = weight(_text_:29 in 4792) [ClassicSimilarity], result of:
          0.03679757 = score(doc=4792,freq=2.0), product of:
            0.13525672 = queryWeight, product of:
              3.5176873 = idf(docFreq=3565, maxDocs=44218)
              0.03845047 = queryNorm
            0.27205724 = fieldWeight in 4792, product of:
              1.4142135 = tf(freq=2.0), with freq of:
                2.0 = termFreq=2.0
              3.5176873 = idf(docFreq=3565, maxDocs=44218)
              0.0546875 = fieldNorm(doc=4792)
        0.03646655 = weight(_text_:22 in 4792) [ClassicSimilarity], result of:
          0.03646655 = score(doc=4792,freq=2.0), product of:
            0.13464698 = queryWeight, product of:
              3.5018296 = idf(docFreq=3622, maxDocs=44218)
              0.03845047 = queryNorm
            0.2708308 = fieldWeight in 4792, 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=4792)
      0.6666667 = coord(2/3)
  0.33333334 = coord(2/6)

Abstract

Moderne Verfahren des Information Retrieval verlangen nach aussagekräftigen und detailliert relationierten Dokumentationssprachen. Der selektive Transfer einzelner Modellierungsstrategien aus dem Bereich semantischer Technologien für die Gestaltung und Relationierung bestehender Dokumentationssprachen wird diskutiert. In Form einer Taxonomie wird ein hierarchisch strukturiertes Relationeninventar definiert, welches sowohl hinreichend allgemeine als auch zahlreiche spezifische Relationstypen enthält, die eine detaillierte und damit aussagekräftige Relationierung des Vokabulars ermöglichen. Das bringt einen Zugewinn an Übersichtlichkeit und Funktionalität. Im Gegensatz zu anderen Ansätzen und Überlegungen zur Schaffung von Relationeninventaren entwickelt der vorgestellte Vorschlag das Relationeninventar aus der Begriffsmenge eines bestehenden Gegenstandsbereichs heraus.

Date

2. 3.2013 12:29:05

Source

Wissensspeicher in digitalen Räumen: Nachhaltigkeit - Verfügbarkeit - semantische Interoperabilität. Proceedings der 11. Tagung der Deutschen Sektion der Internationalen Gesellschaft für Wissensorganisation, Konstanz, 20. bis 22. Februar 2008. Hrsg.: J. Sieglerschmidt u. H.P.Ohly

0.019192684 = product of:
  0.11515611 = sum of:
    0.11515611 = weight(_text_:geschichte in 2071) [ClassicSimilarity], result of:
      0.11515611 = score(doc=2071,freq=2.0), product of:
        0.18274738 = queryWeight, product of:
          4.7528 = idf(docFreq=1036, maxDocs=44218)
          0.03845047 = queryNorm
        0.6301382 = fieldWeight in 2071, product of:
          1.4142135 = tf(freq=2.0), with freq of:
            2.0 = termFreq=2.0
          4.7528 = idf(docFreq=1036, maxDocs=44218)
          0.09375 = fieldNorm(doc=2071)
  0.16666667 = coord(1/6)

Series

Philosophie und Geschichte der Wissenschaften; Bd.18

0.019192684 = product of:
  0.11515611 = sum of:
    0.11515611 = weight(_text_:geschichte in 4608) [ClassicSimilarity], result of:
      0.11515611 = score(doc=4608,freq=2.0), product of:
        0.18274738 = queryWeight, product of:
          4.7528 = idf(docFreq=1036, maxDocs=44218)
          0.03845047 = queryNorm
        0.6301382 = fieldWeight in 4608, product of:
          1.4142135 = tf(freq=2.0), with freq of:
            2.0 = termFreq=2.0
          4.7528 = idf(docFreq=1036, maxDocs=44218)
          0.09375 = fieldNorm(doc=4608)
  0.16666667 = coord(1/6)

Series

Philosophie und Geschichte der Wissenschaften; Bd.18

0.019192684 = product of:
  0.11515611 = sum of:
    0.11515611 = weight(_text_:geschichte in 4612) [ClassicSimilarity], result of:
      0.11515611 = score(doc=4612,freq=2.0), product of:
        0.18274738 = queryWeight, product of:
          4.7528 = idf(docFreq=1036, maxDocs=44218)
          0.03845047 = queryNorm
        0.6301382 = fieldWeight in 4612, product of:
          1.4142135 = tf(freq=2.0), with freq of:
            2.0 = termFreq=2.0
          4.7528 = idf(docFreq=1036, maxDocs=44218)
          0.09375 = fieldNorm(doc=4612)
  0.16666667 = coord(1/6)

Series

Philosophie und Geschichte der Wissenschaften; Bd.18

0.018175863 = product of:
  0.054527584 = sum of:
    0.00654587 = weight(_text_:information in 592) [ClassicSimilarity], result of:
      0.00654587 = score(doc=592,freq=2.0), product of:
        0.067498945 = queryWeight, product of:
          1.7554779 = idf(docFreq=20772, maxDocs=44218)
          0.03845047 = queryNorm
        0.09697737 = fieldWeight in 592, product of:
          1.4142135 = tf(freq=2.0), with freq of:
            2.0 = termFreq=2.0
          1.7554779 = idf(docFreq=20772, maxDocs=44218)
          0.0390625 = fieldNorm(doc=592)
    0.047981713 = weight(_text_:geschichte in 592) [ClassicSimilarity], result of:
      0.047981713 = score(doc=592,freq=2.0), product of:
        0.18274738 = queryWeight, product of:
          4.7528 = idf(docFreq=1036, maxDocs=44218)
          0.03845047 = queryNorm
        0.2625576 = fieldWeight in 592, product of:
          1.4142135 = tf(freq=2.0), with freq of:
            2.0 = termFreq=2.0
          4.7528 = idf(docFreq=1036, maxDocs=44218)
          0.0390625 = fieldNorm(doc=592)
  0.33333334 = coord(2/6)

Abstract

The purpose of this article is to identify the most important factors and features in the evolution of thesauri and ontologies through a dialectic model. This model relies on a dialectic process or idea which could be discovered via a dialectic method. This method has focused on identifying the logical relationship between a beginning proposition, or an idea called a thesis, a negation of that idea called the antithesis, and the result of the conflict between the two ideas, called a synthesis. During the creation of knowl­edge organization systems (KOSs), the identification of logical relations between different ideas has been made possible through the consideration and use of the most influential methods and tools such as dictionaries, Roget's Thesaurus, thesaurus, micro-, macro- and metathesauri, ontology, lower, middle and upper level ontologies. The analysis process has adapted a historical methodology, more specifically a dialectic method and documentary method as the reasoning process. This supports our arguments and synthesizes a method for the analysis of research results. Confirmed by the research results, the principle of unity has shown to be the most important factor in the development and evolution of the structure of knowl­edge organization systems and their types. There are various types of unity when considering the analysis of logical relations. These include the principle of unity of alphabetical order, unity of science, semantic unity, structural unity and conceptual unity. The results have clearly demonstrated a movement from plurality to unity in the assembling of the complex structure of knowl­edge organization systems to increase information and knowl­edge storage and retrieval performance.

Theme

Geschichte der Sacherschließung

0.015993904 = product of:
  0.095963426 = sum of:
    0.095963426 = weight(_text_:geschichte in 1663) [ClassicSimilarity], result of:
      0.095963426 = score(doc=1663,freq=2.0), product of:
        0.18274738 = queryWeight, product of:
          4.7528 = idf(docFreq=1036, maxDocs=44218)
          0.03845047 = queryNorm
        0.5251152 = fieldWeight in 1663, product of:
          1.4142135 = tf(freq=2.0), with freq of:
            2.0 = termFreq=2.0
          4.7528 = idf(docFreq=1036, maxDocs=44218)
          0.078125 = fieldNorm(doc=1663)
  0.16666667 = coord(1/6)

Series

Philosophie und Geschichte der Wissenschaften; Bd.18

0.012543229 = product of:
  0.037629686 = sum of:
    0.027210671 = weight(_text_:information in 987) [ClassicSimilarity], result of:
      0.027210671 = score(doc=987,freq=24.0), product of:
        0.067498945 = queryWeight, product of:
          1.7554779 = idf(docFreq=20772, maxDocs=44218)
          0.03845047 = queryNorm
        0.40312737 = fieldWeight in 987, product of:
          4.8989797 = tf(freq=24.0), with freq of:
            24.0 = termFreq=24.0
          1.7554779 = idf(docFreq=20772, maxDocs=44218)
          0.046875 = fieldNorm(doc=987)
    0.010419015 = product of:
      0.031257045 = sum of:
        0.031257045 = weight(_text_:22 in 987) [ClassicSimilarity], result of:
          0.031257045 = score(doc=987,freq=2.0), product of:
            0.13464698 = queryWeight, product of:
              3.5018296 = idf(docFreq=3622, maxDocs=44218)
              0.03845047 = queryNorm
            0.23214069 = fieldWeight in 987, product of:
              1.4142135 = tf(freq=2.0), with freq of:
                2.0 = termFreq=2.0
              3.5018296 = idf(docFreq=3622, maxDocs=44218)
              0.046875 = fieldNorm(doc=987)
      0.33333334 = coord(1/3)
  0.33333334 = coord(2/6)

Abstract

This book covers the basics of semantic web technologies and indexing languages, and describes their contribution to improve languages as a tool for subject queries and knowledge exploration. The book is relevant to information scientists, knowledge workers and indexers. It provides a suitable combination of theoretical foundations and practical applications.

Content

Introduction: envisioning semantic information spacesIndexing and knowledge organization -- Semantic technologies for knowledge representation -- Information retrieval and knowledge exploration -- Approaches to handle heterogeneity -- Problems with establishing semantic interoperability -- Formalization in indexing languages -- Typification of semantic relations -- Inferences in retrieval processes -- Semantic interoperability and inferences -- Remaining research questions.

Date

23. 7.2017 13:49:22

LCSH

Information retrieval
Knowledge representation (Information theory)
Information organization

RSWK

Information Retrieval

Subject

Information retrieval
Knowledge representation (Information theory)
Information organization
Information Retrieval

0.010905517 = product of:
  0.03271655 = sum of:
    0.0039275223 = weight(_text_:information in 585) [ClassicSimilarity], result of:
      0.0039275223 = score(doc=585,freq=2.0), product of:
        0.067498945 = queryWeight, product of:
          1.7554779 = idf(docFreq=20772, maxDocs=44218)
          0.03845047 = queryNorm
        0.058186423 = fieldWeight in 585, product of:
          1.4142135 = tf(freq=2.0), with freq of:
            2.0 = termFreq=2.0
          1.7554779 = idf(docFreq=20772, maxDocs=44218)
          0.0234375 = fieldNorm(doc=585)
    0.028789027 = weight(_text_:geschichte in 585) [ClassicSimilarity], result of:
      0.028789027 = score(doc=585,freq=2.0), product of:
        0.18274738 = queryWeight, product of:
          4.7528 = idf(docFreq=1036, maxDocs=44218)
          0.03845047 = queryNorm
        0.15753455 = fieldWeight in 585, product of:
          1.4142135 = tf(freq=2.0), with freq of:
            2.0 = termFreq=2.0
          4.7528 = idf(docFreq=1036, maxDocs=44218)
          0.0234375 = fieldNorm(doc=585)
  0.33333334 = coord(2/6)

Abstract

Die vorliegende Arbeit versucht, das Thema "Topic Maps" von verschiedenen Perspektiven zu betrachten. "Topic Maps" sind geordnete Wissensnetze. Sie stellen ein Hilfsmittel dar, um sich in der immer größer werdenden Informationsvielfalt zurechtzufinden und beim Navigieren trotz einer möglichen Informationsüberflutung die Übersicht zu behalten. Wie ein Stichwortverzeichnis in einem guten Fachbuch, helfen sie, die genau gesuchte Information zu finden. Die Tatsache, dass elektronische Informationen in größerem Umfang als die Seiten eines Buches vorliegen und auf heterogenen Plattformen gespeichert sind, zieht die Konsequenz mit sich, dass Topic Maps nicht nur aus einer Liste alphabetisch sortierter Stichworte bestehen. Vielmehr werden mit Hilfe von Topic Maps logische Konzepte entworfen, die Wissensnetze semantisch modellieren. In Zusammenhang mit Topic Maps spricht Tim Berner-Lee von der dritten Revolution des Internets. Die XTM-Arbeitsgruppe wirbt sogar mit dem Slogan "Das GPS des Web". So wie eine Landkarte eine schematische Sicht auf eine reale Landschaft ermöglicht und bestimmte Merkmale der Landschaft (z.B. Städte, Straßen, Flüsse) markiert, sind Topic Map in der Lage wichtige Merkmale eines Informationsbestandes festzuhalten und in Bezug zueinander zu setzen. So wie ein GPS-Empfänger die eigene Position auf der Karte feststellt, kann eine Topic Map die Orientierung in einer virtuellen Welt vernetzter Dokumente herstellen. Das klingt etwas exotisch, hat jedoch durchaus praktische und sehr weit gefächerte Anwendungen.
In dieser Arbeit wurde zuerst der Übergang von Suchmaschinen zu einem semantischen Web beschrieben. Im zweiten Kapitel wurden die Topic Maps ausführlicher behandelt. Angefangen bei der Geschichte von Topic Maps, über die Entwurfsziele bis hin zu einem XTM-Tutorial . In diesem Tutorial wurden verschiedene Beispiele durchgeführt und die Lineare Topic Map von Ontopia vorgestellt. Abschließend wurde anhand eines Beispiels eine mögliche Realisierung von Topic Maps mit HTML. Das dritte Kapitel wurde den TopicMaps-Tools und Anfragesprachen gewidmet. Es wurden kommerzielle sowie freiverfügbare Tools vorgestellt und miteinander verglichen. Danach wurden die beiden Anfragesprachen Tolog und TMQL eingeführt. Im vierten Kapitel wurden die beiden Einsatzgebiete von Topic Maps behandelt. Das sind zum einen die Webkataloge und die Suchmaschinen. Zum anderen ist es möglich, auch im Rahmen vom E-Learning von dem Konzept der Topic Maps zu profitieren. In diesem Zusammenhang wurde erst der Omnigator von Ontopia vorgestellt. Dann wurde das im Laufe dieser Arbeit entwickelte Topic Maps Tool E-Learning -Tracker ausgeführt und erklärt.

0.010719523 = product of:
  0.03215857 = sum of:
    0.018140448 = weight(_text_:information in 1488) [ClassicSimilarity], result of:
      0.018140448 = score(doc=1488,freq=6.0), product of:
        0.067498945 = queryWeight, product of:
          1.7554779 = idf(docFreq=20772, maxDocs=44218)
          0.03845047 = queryNorm
        0.2687516 = fieldWeight in 1488, product of:
          2.4494898 = tf(freq=6.0), with freq of:
            6.0 = termFreq=6.0
          1.7554779 = idf(docFreq=20772, maxDocs=44218)
          0.0625 = fieldNorm(doc=1488)
    0.014018122 = product of:
      0.042054366 = sum of:
        0.042054366 = weight(_text_:29 in 1488) [ClassicSimilarity], result of:
          0.042054366 = score(doc=1488,freq=2.0), product of:
            0.13525672 = queryWeight, product of:
              3.5176873 = idf(docFreq=3565, maxDocs=44218)
              0.03845047 = queryNorm
            0.31092256 = fieldWeight in 1488, product of:
              1.4142135 = tf(freq=2.0), with freq of:
                2.0 = termFreq=2.0
              3.5176873 = idf(docFreq=3565, maxDocs=44218)
              0.0625 = fieldNorm(doc=1488)
      0.33333334 = coord(1/3)
  0.33333334 = coord(2/6)

Abstract

Ontologies have become an important issue in research communities across several disciplines. This paper discusses some of the innovative techniques involving automatic terminology resources acquisition are briefly discussed. Suggests that NLP-based ontologies are useful in reducing the cost of ontology engineering. Emphasizes that linguistic ontologies covering both ontological and lexical information can offer solutions since they can be more easily updated by the resources of NLP products.

Date

29. 2.2008 16:25:23

Source

Knowledge organization, information systems and other essays: Professor A. Neelameghan Festschrift. Ed. by K.S. Raghavan and K.N. Prasad

0.010198098 = product of:
  0.030594293 = sum of:
    0.018328438 = weight(_text_:information in 4121) [ClassicSimilarity], result of:
      0.018328438 = score(doc=4121,freq=8.0), product of:
        0.067498945 = queryWeight, product of:
          1.7554779 = idf(docFreq=20772, maxDocs=44218)
          0.03845047 = queryNorm
        0.27153665 = fieldWeight in 4121, product of:
          2.828427 = tf(freq=8.0), with freq of:
            8.0 = termFreq=8.0
          1.7554779 = idf(docFreq=20772, maxDocs=44218)
          0.0546875 = fieldNorm(doc=4121)
    0.012265856 = product of:
      0.03679757 = sum of:
        0.03679757 = weight(_text_:29 in 4121) [ClassicSimilarity], result of:
          0.03679757 = score(doc=4121,freq=2.0), product of:
            0.13525672 = queryWeight, product of:
              3.5176873 = idf(docFreq=3565, maxDocs=44218)
              0.03845047 = queryNorm
            0.27205724 = fieldWeight in 4121, product of:
              1.4142135 = tf(freq=2.0), with freq of:
                2.0 = termFreq=2.0
              3.5176873 = idf(docFreq=3565, maxDocs=44218)
              0.0546875 = fieldNorm(doc=4121)
      0.33333334 = coord(1/3)
  0.33333334 = coord(2/6)

Abstract

Intuition suggests that one way to enhance the information retrieval process would be the use of phrases to characterize the contents of text. A number of researchers, however, have noted that phrases alone do not improve retrieval effectiveness. In this paper we briefly review the use of phrases in information retrieval and then suggest extensions to this paradigm using semantic information. We claim that semantic processing, which can be viewed as expressing relations between the concepts represented by phrases, will in fact enhance retrieval effectiveness. The availability of the UMLS® domain model, which we exploit extensively, significantly contributes to the feasibility of this processing.

Date

29. 6.2015 14:51:28

0.010198098 = product of:
  0.030594293 = sum of:
    0.018328438 = weight(_text_:information in 4471) [ClassicSimilarity], result of:
      0.018328438 = score(doc=4471,freq=8.0), product of:
        0.067498945 = queryWeight, product of:
          1.7554779 = idf(docFreq=20772, maxDocs=44218)
          0.03845047 = queryNorm
        0.27153665 = fieldWeight in 4471, product of:
          2.828427 = tf(freq=8.0), with freq of:
            8.0 = termFreq=8.0
          1.7554779 = idf(docFreq=20772, maxDocs=44218)
          0.0546875 = fieldNorm(doc=4471)
    0.012265856 = product of:
      0.03679757 = sum of:
        0.03679757 = weight(_text_:29 in 4471) [ClassicSimilarity], result of:
          0.03679757 = score(doc=4471,freq=2.0), product of:
            0.13525672 = queryWeight, product of:
              3.5176873 = idf(docFreq=3565, maxDocs=44218)
              0.03845047 = queryNorm
            0.27205724 = fieldWeight in 4471, product of:
              1.4142135 = tf(freq=2.0), with freq of:
                2.0 = termFreq=2.0
              3.5176873 = idf(docFreq=3565, maxDocs=44218)
              0.0546875 = fieldNorm(doc=4471)
      0.33333334 = coord(1/3)
  0.33333334 = coord(2/6)

Abstract

We present an Information Retrieval System for scientific publications that provides the possibility to filter results according to semantic facets. We use sentence-level semantic annotations that identify specific semantic relations in texts, such as methods, definitions, hypotheses, that correspond to common information needs related to scientific literature. The semantic annotations are obtained using a rule-based method that identifies linguistic clues organized into a linguistic ontology. The system is implemented using Solr Search Server and offers efficient search and navigation in scientific papers.

Series

Communications in computer and information science; vol.475

Source

Semantic Web Evaluation Challenge. SemWebEval 2014 at ESWC 2014, Anissaras, Crete, Greece, May 25-29, 2014, Revised Selected Papers. Eds.: V. Presutti et al

0.009596342 = product of:
  0.057578053 = sum of:
    0.057578053 = weight(_text_:geschichte in 1101) [ClassicSimilarity], result of:
      0.057578053 = score(doc=1101,freq=2.0), product of:
        0.18274738 = queryWeight, product of:
          4.7528 = idf(docFreq=1036, maxDocs=44218)
          0.03845047 = queryNorm
        0.3150691 = fieldWeight in 1101, product of:
          1.4142135 = tf(freq=2.0), with freq of:
            2.0 = termFreq=2.0
          4.7528 = idf(docFreq=1036, maxDocs=44218)
          0.046875 = fieldNorm(doc=1101)
  0.16666667 = coord(1/6)

Abstract

Graphendatenbanken sind darauf optimiert, stark miteinander vernetzte Informationen effizient zu speichern und greifbar zu machen. Welchen Ansprüchen müssen Abfragesprachen genügen, damit sie für die Arbeit mit diesen Datenbanken geeignet sind? Bei der Aufarbeitung realer Informationen zeigt sich, dass ein hoher, aber unterschätzter Wert in den Beziehungen zwischen Elementen steckt. Seien es Ereignisse aus Geschichte und Politik, Personen in realen und virtuellen sozialen Netzen, Proteine und Gene, Abhängigkeiten in Märkten und Ökonomien oder Rechnernetze, Computer, Software und Anwender - alles ist miteinander verbunden. Der Graph ist ein Datenmodell, das solche Verbindungsgeflechte abbilden kann. Leider lässt sich das Modell mit relationalen und Aggregat-orientierten NoSQL-Datenbanken ab einer gewissen Komplexität jedoch schwer handhaben. Graphendatenbanken sind dagegen darauf optimiert, solche stark miteinander vernetzten Informationen effizient zu speichern und greifbar zu machen. Auch komplexe Fragen lassen sich durch ausgefeilte Abfragen schnell beantworten. Hierbei kommt es auf die geeignete Abfragesprache an.

0.009379583 = product of:
  0.02813875 = sum of:
    0.015872892 = weight(_text_:information in 1565) [ClassicSimilarity], result of:
      0.015872892 = score(doc=1565,freq=6.0), product of:
        0.067498945 = queryWeight, product of:
          1.7554779 = idf(docFreq=20772, maxDocs=44218)
          0.03845047 = queryNorm
        0.23515764 = fieldWeight in 1565, product of:
          2.4494898 = tf(freq=6.0), with freq of:
            6.0 = termFreq=6.0
          1.7554779 = idf(docFreq=20772, maxDocs=44218)
          0.0546875 = fieldNorm(doc=1565)
    0.012265856 = product of:
      0.03679757 = sum of:
        0.03679757 = weight(_text_:29 in 1565) [ClassicSimilarity], result of:
          0.03679757 = score(doc=1565,freq=2.0), product of:
            0.13525672 = queryWeight, product of:
              3.5176873 = idf(docFreq=3565, maxDocs=44218)
              0.03845047 = queryNorm
            0.27205724 = fieldWeight in 1565, product of:
              1.4142135 = tf(freq=2.0), with freq of:
                2.0 = termFreq=2.0
              3.5176873 = idf(docFreq=3565, maxDocs=44218)
              0.0546875 = fieldNorm(doc=1565)
      0.33333334 = coord(1/3)
  0.33333334 = coord(2/6)

Abstract

Faceted arrangement of entities and typed relations for representing different associations between the entities are established tools in knowledge representation. In this paper, a proposal is being discussed combining both tools to draw inferences along relational paths. This approach may yield new benefit for information retrieval processes, especially when modeled for heterogeneous environments in the Semantic Web. Faceted arrangement can be used as a selection tool for the semantic knowledge modeled within the knowledge representation. Typed relations between the entities of different facets can be used as restrictions for selecting them across the facets.

Series

Communications in computer and information science; 478

Source

Metadata and semantics research: 8th Research Conference, MTSR 2014, Karlsruhe, Germany, November 27-29, 2014, Proceedings. Eds.: S. Closs et al

0.0093593355 = product of:
  0.028078005 = sum of:
    0.017564414 = weight(_text_:information in 4332) [ClassicSimilarity], result of:
      0.017564414 = score(doc=4332,freq=10.0), product of:
        0.067498945 = queryWeight, product of:
          1.7554779 = idf(docFreq=20772, maxDocs=44218)
          0.03845047 = queryNorm
        0.2602176 = fieldWeight in 4332, product of:
          3.1622777 = tf(freq=10.0), with freq of:
            10.0 = termFreq=10.0
          1.7554779 = idf(docFreq=20772, maxDocs=44218)
          0.046875 = fieldNorm(doc=4332)
    0.010513592 = product of:
      0.031540774 = sum of:
        0.031540774 = weight(_text_:29 in 4332) [ClassicSimilarity], result of:
          0.031540774 = score(doc=4332,freq=2.0), product of:
            0.13525672 = queryWeight, product of:
              3.5176873 = idf(docFreq=3565, maxDocs=44218)
              0.03845047 = queryNorm
            0.23319192 = fieldWeight in 4332, product of:
              1.4142135 = tf(freq=2.0), with freq of:
                2.0 = termFreq=2.0
              3.5176873 = idf(docFreq=3565, maxDocs=44218)
              0.046875 = fieldNorm(doc=4332)
      0.33333334 = coord(1/3)
  0.33333334 = coord(2/6)

Abstract

Das Semantic Web bezeichnet ein erweitertes World Wide Web (WWW), das die Bedeutung von präsentierten Inhalten in neuen standardisierten Sprachen wie RDF Schema und OWL modelliert. Diese Arbeit befasst sich mit dem Aspekt des Information Retrieval, d.h. es wird untersucht, in wie weit Methoden der Informationssuche sich auf modelliertes Wissen übertragen lassen. Die kennzeichnenden Merkmale von IR-Systemen wie vage Anfragen sowie die Unterstützung unsicheren Wissens werden im Kontext des Semantic Web behandelt. Im Fokus steht die Suche nach Fakten innerhalb einer Wissensdomäne, die entweder explizit modelliert sind oder implizit durch die Anwendung von Inferenz abgeleitet werden können. Aufbauend auf der an der Universität Duisburg-Essen entwickelten Retrievalmaschine PIRE wird die Anwendung unsicherer Inferenz mit probabilistischer Prädikatenlogik (pDatalog) implementiert.

Date

12. 2.2011 17:29:27

Footnote

Zugl.: Dortmund, Univ., Dipl.-Arb., 2006 u.d.T.: Hüsken, Peter: Information-Retrieval im Semantic-Web.

RSWK

Information Retrieval / Semantic Web

Subject

Information Retrieval / Semantic Web

0.0093593355 = product of:
  0.028078005 = sum of:
    0.017564414 = weight(_text_:information in 439) [ClassicSimilarity], result of:
      0.017564414 = score(doc=439,freq=10.0), product of:
        0.067498945 = queryWeight, product of:
          1.7554779 = idf(docFreq=20772, maxDocs=44218)
          0.03845047 = queryNorm
        0.2602176 = fieldWeight in 439, product of:
          3.1622777 = tf(freq=10.0), with freq of:
            10.0 = termFreq=10.0
          1.7554779 = idf(docFreq=20772, maxDocs=44218)
          0.046875 = fieldNorm(doc=439)
    0.010513592 = product of:
      0.031540774 = sum of:
        0.031540774 = weight(_text_:29 in 439) [ClassicSimilarity], result of:
          0.031540774 = score(doc=439,freq=2.0), product of:
            0.13525672 = queryWeight, product of:
              3.5176873 = idf(docFreq=3565, maxDocs=44218)
              0.03845047 = queryNorm
            0.23319192 = fieldWeight in 439, product of:
              1.4142135 = tf(freq=2.0), with freq of:
                2.0 = termFreq=2.0
              3.5176873 = idf(docFreq=3565, maxDocs=44218)
              0.046875 = fieldNorm(doc=439)
      0.33333334 = coord(1/3)
  0.33333334 = coord(2/6)

Abstract

This book constitutes the refereed proceedings of the Second European Semantic Web Conference, ESWC 2005, heldin Heraklion, Crete, Greece in May/June 2005. The 48 revised full papers presented were carefully reviewed and selected from 148 submissions. The papers are organized in topical sections on semantic Web services, languages, ontologies, reasoning and querying, search and information retrieval, user and communities, natural language for the semantic Web, annotation tools, and semantic Web applications.

LCSH

Information storage and retrieval systems
Information systems

Subject

Information storage and retrieval systems
Information systems