Search (204 results, page 1 of 11)

0.094771475 = sum of:
  0.055276908 = product of:
    0.16583072 = sum of:
      0.16583072 = weight(_text_:3a in 701) [ClassicSimilarity], result of:
        0.16583072 = score(doc=701,freq=2.0), product of:
          0.44259444 = queryWeight, product of:
            8.478011 = idf(docFreq=24, maxDocs=44218)
            0.052204985 = 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.039494567 = product of:
    0.07898913 = sum of:
      0.07898913 = weight(_text_:retrieval in 701) [ClassicSimilarity], result of:
        0.07898913 = score(doc=701,freq=28.0), product of:
          0.15791564 = queryWeight, product of:
            3.024915 = idf(docFreq=5836, maxDocs=44218)
            0.052204985 = queryNorm
          0.5001983 = fieldWeight in 701, product of:
            5.2915025 = tf(freq=28.0), with freq of:
              28.0 = termFreq=28.0
            3.024915 = idf(docFreq=5836, maxDocs=44218)
            0.03125 = fieldNorm(doc=701)
    0.5 = coord(1/2)

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.076387644 = sum of:
  0.055276908 = product of:
    0.16583072 = sum of:
      0.16583072 = weight(_text_:3a in 5820) [ClassicSimilarity], result of:
        0.16583072 = score(doc=5820,freq=2.0), product of:
          0.44259444 = queryWeight, product of:
            8.478011 = idf(docFreq=24, maxDocs=44218)
            0.052204985 = 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.021110734 = product of:
    0.042221468 = sum of:
      0.042221468 = weight(_text_:retrieval in 5820) [ClassicSimilarity], result of:
        0.042221468 = score(doc=5820,freq=8.0), product of:
          0.15791564 = queryWeight, product of:
            3.024915 = idf(docFreq=5836, maxDocs=44218)
            0.052204985 = queryNorm
          0.26736724 = fieldWeight in 5820, product of:
            2.828427 = tf(freq=8.0), with freq of:
              8.0 = termFreq=8.0
            3.024915 = idf(docFreq=5836, maxDocs=44218)
            0.03125 = fieldNorm(doc=5820)
    0.5 = coord(1/2)

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.066060096 = product of:
  0.13212019 = sum of:
    0.13212019 = sum of:
      0.08260882 = weight(_text_:retrieval in 4330) [ClassicSimilarity], result of:
        0.08260882 = score(doc=4330,freq=10.0), product of:
          0.15791564 = queryWeight, product of:
            3.024915 = idf(docFreq=5836, maxDocs=44218)
            0.052204985 = queryNorm
          0.5231199 = fieldWeight in 4330, product of:
            3.1622777 = tf(freq=10.0), with freq of:
              10.0 = termFreq=10.0
            3.024915 = idf(docFreq=5836, maxDocs=44218)
            0.0546875 = fieldNorm(doc=4330)
      0.04951138 = weight(_text_:22 in 4330) [ClassicSimilarity], result of:
        0.04951138 = score(doc=4330,freq=2.0), product of:
          0.18281296 = queryWeight, product of:
            3.5018296 = idf(docFreq=3622, maxDocs=44218)
            0.052204985 = queryNorm
          0.2708308 = fieldWeight in 4330, 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=4330)
  0.5 = coord(1/2)

Abstract

One vision of the Semantic Web is that it will be much like the Web we know today, except that documents will be enriched by annotations in machine understandable markup. These annotations will provide metadata about the documents as well as machine interpretable statements capturing some of the meaning of document content. We discuss how the information retrieval paradigm might be recast in such an environment. We suggest that retrieval can be tightly bound to inference. Doing so makes today's Web search engines useful to Semantic Web inference engines, and causes improvements in either retrieval or inference to lead directly to improvements in the other.

Date

12. 2.2011 17:35:22

0.06310947 = product of:
  0.12621894 = sum of:
    0.12621894 = sum of:
      0.083780624 = weight(_text_:retrieval in 987) [ClassicSimilarity], result of:
        0.083780624 = score(doc=987,freq=14.0), product of:
          0.15791564 = queryWeight, product of:
            3.024915 = idf(docFreq=5836, maxDocs=44218)
            0.052204985 = queryNorm
          0.5305404 = fieldWeight in 987, product of:
            3.7416575 = tf(freq=14.0), with freq of:
              14.0 = termFreq=14.0
            3.024915 = idf(docFreq=5836, maxDocs=44218)
            0.046875 = fieldNorm(doc=987)
      0.04243833 = weight(_text_:22 in 987) [ClassicSimilarity], result of:
        0.04243833 = score(doc=987,freq=2.0), product of:
          0.18281296 = queryWeight, product of:
            3.5018296 = idf(docFreq=3622, maxDocs=44218)
            0.052204985 = 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.5 = coord(1/2)

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

RSWK

Information Retrieval

Subject

Information retrieval
Information Retrieval

0.05087889 = product of:
  0.10175778 = sum of:
    0.10175778 = sum of:
      0.0522464 = weight(_text_:retrieval in 4324) [ClassicSimilarity], result of:
        0.0522464 = score(doc=4324,freq=4.0), product of:
          0.15791564 = queryWeight, product of:
            3.024915 = idf(docFreq=5836, maxDocs=44218)
            0.052204985 = queryNorm
          0.33085006 = fieldWeight in 4324, product of:
            2.0 = tf(freq=4.0), with freq of:
              4.0 = termFreq=4.0
            3.024915 = idf(docFreq=5836, maxDocs=44218)
            0.0546875 = fieldNorm(doc=4324)
      0.04951138 = weight(_text_:22 in 4324) [ClassicSimilarity], result of:
        0.04951138 = score(doc=4324,freq=2.0), product of:
          0.18281296 = queryWeight, product of:
            3.5018296 = idf(docFreq=3622, maxDocs=44218)
            0.052204985 = queryNorm
          0.2708308 = fieldWeight in 4324, 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=4324)
  0.5 = coord(1/2)

Date

11. 2.2011 18:22:25

Theme

Semantisches Umfeld in Indexierung u. Retrieval

0.048642814 = product of:
  0.09728563 = sum of:
    0.09728563 = sum of:
      0.0548473 = weight(_text_:retrieval in 3261) [ClassicSimilarity], result of:
        0.0548473 = score(doc=3261,freq=6.0), product of:
          0.15791564 = queryWeight, product of:
            3.024915 = idf(docFreq=5836, maxDocs=44218)
            0.052204985 = queryNorm
          0.34732026 = fieldWeight in 3261, product of:
            2.4494898 = tf(freq=6.0), with freq of:
              6.0 = termFreq=6.0
            3.024915 = idf(docFreq=5836, maxDocs=44218)
            0.046875 = fieldNorm(doc=3261)
      0.04243833 = weight(_text_:22 in 3261) [ClassicSimilarity], result of:
        0.04243833 = score(doc=3261,freq=2.0), product of:
          0.18281296 = queryWeight, product of:
            3.5018296 = idf(docFreq=3622, maxDocs=44218)
            0.052204985 = queryNorm
          0.23214069 = fieldWeight in 3261, 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=3261)
  0.5 = coord(1/2)

Abstract

Ontologies improve IR systems regarding its retrieval and presentation of information, which make the task of finding information more effective, efficient, and interactive. In this paper we argue that ontologies also greatly improve the engineering of such systems. We created a framework that uses ontology to drive the process of engineering an IR system. We developed a prototype that shows how a domain specialist without knowledge in the IR field can build an IR system with interactive components. The resulting system provides support for users not only to find their information needs but also to extend their state of knowledge. This way, our approach to ontology-enabled information retrieval addresses both the engineering aspect described here and also the usability aspect described elsewhere.

Date

28.11.2016 12:43:22

0.04361048 = product of:
  0.08722096 = sum of:
    0.08722096 = sum of:
      0.04478263 = weight(_text_:retrieval in 2623) [ClassicSimilarity], result of:
        0.04478263 = score(doc=2623,freq=4.0), product of:
          0.15791564 = queryWeight, product of:
            3.024915 = idf(docFreq=5836, maxDocs=44218)
            0.052204985 = queryNorm
          0.2835858 = fieldWeight in 2623, product of:
            2.0 = tf(freq=4.0), with freq of:
              4.0 = termFreq=4.0
            3.024915 = idf(docFreq=5836, maxDocs=44218)
            0.046875 = fieldNorm(doc=2623)
      0.04243833 = weight(_text_:22 in 2623) [ClassicSimilarity], result of:
        0.04243833 = score(doc=2623,freq=2.0), product of:
          0.18281296 = queryWeight, product of:
            3.5018296 = idf(docFreq=3622, maxDocs=44218)
            0.052204985 = queryNorm
          0.23214069 = fieldWeight in 2623, 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=2623)
  0.5 = coord(1/2)

Abstract

Contemporary retrieval systems, which search across collections, usually ignore collection-level metadata. Alternative approaches, exploiting collection-level information, will require an understanding of the various kinds of relationships that can obtain between collection-level and item-level metadata. This paper outlines the problem and describes a project that is developing a logic-based framework for classifying collection/item metadata relationships. This framework will support (i) metadata specification developers defining metadata elements, (ii) metadata creators describing objects, and (iii) system designers implementing systems that take advantage of collection-level metadata. We present three examples of collection/item metadata relationship categories, attribute/value-propagation, value-propagation, and value-constraint and show that even in these simple cases a precise formulation requires modal notions in addition to first-order logic. These formulations are related to recent work in information retrieval and ontology evaluation.

Source

Metadata for semantic and social applications : proceedings of the International Conference on Dublin Core and Metadata Applications, Berlin, 22 - 26 September 2008, DC 2008: Berlin, Germany / ed. by Jane Greenberg and Wolfgang Klas

0.04361048 = product of:
  0.08722096 = sum of:
    0.08722096 = sum of:
      0.04478263 = weight(_text_:retrieval in 2230) [ClassicSimilarity], result of:
        0.04478263 = score(doc=2230,freq=4.0), product of:
          0.15791564 = queryWeight, product of:
            3.024915 = idf(docFreq=5836, maxDocs=44218)
            0.052204985 = queryNorm
          0.2835858 = fieldWeight in 2230, product of:
            2.0 = tf(freq=4.0), with freq of:
              4.0 = termFreq=4.0
            3.024915 = idf(docFreq=5836, maxDocs=44218)
            0.046875 = fieldNorm(doc=2230)
      0.04243833 = weight(_text_:22 in 2230) [ClassicSimilarity], result of:
        0.04243833 = score(doc=2230,freq=2.0), product of:
          0.18281296 = queryWeight, product of:
            3.5018296 = idf(docFreq=3622, maxDocs=44218)
            0.052204985 = queryNorm
          0.23214069 = fieldWeight in 2230, 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=2230)
  0.5 = coord(1/2)

Source

Proceedings of the 19th Annual International ACM SIGIR Conference on Research and Development in Information Retrieval (ACM SIGIR '96), Zürich, Switzerland, August 18-22, 1996. Eds.: H.P. Frei et al

Theme

Semantisches Umfeld in Indexierung u. Retrieval

0.043227583 = product of:
  0.08645517 = sum of:
    0.08645517 = sum of:
      0.036943786 = weight(_text_:retrieval in 5095) [ClassicSimilarity], result of:
        0.036943786 = score(doc=5095,freq=2.0), product of:
          0.15791564 = queryWeight, product of:
            3.024915 = idf(docFreq=5836, maxDocs=44218)
            0.052204985 = queryNorm
          0.23394634 = fieldWeight in 5095, product of:
            1.4142135 = tf(freq=2.0), with freq of:
              2.0 = termFreq=2.0
            3.024915 = idf(docFreq=5836, maxDocs=44218)
            0.0546875 = fieldNorm(doc=5095)
      0.04951138 = weight(_text_:22 in 5095) [ClassicSimilarity], result of:
        0.04951138 = score(doc=5095,freq=2.0), product of:
          0.18281296 = queryWeight, product of:
            3.5018296 = idf(docFreq=3622, maxDocs=44218)
            0.052204985 = queryNorm
          0.2708308 = fieldWeight in 5095, 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=5095)
  0.5 = coord(1/2)

Abstract

This paper presents an abstract formalization of the notion of "facets". Facets are relational structures of units, relations and other facets selected for a certain purpose. Facets can be used to structure large knowledge representation systems into a hierarchical arrangement of consistent and independent subsystems (facets) that facilitate flexibility and combinations of different viewpoints or aspects. This paper describes the basic notions, facet characteristics and construction mechanisms. It then explicates the theory in an example of a faceted information retrieval system (FaIR)

Date

22. 1.2016 17:47:06

0.043227583 = product of:
  0.08645517 = sum of:
    0.08645517 = sum of:
      0.036943786 = weight(_text_:retrieval in 1852) [ClassicSimilarity], result of:
        0.036943786 = score(doc=1852,freq=2.0), product of:
          0.15791564 = queryWeight, product of:
            3.024915 = idf(docFreq=5836, maxDocs=44218)
            0.052204985 = queryNorm
          0.23394634 = fieldWeight in 1852, product of:
            1.4142135 = tf(freq=2.0), with freq of:
              2.0 = termFreq=2.0
            3.024915 = idf(docFreq=5836, maxDocs=44218)
            0.0546875 = fieldNorm(doc=1852)
      0.04951138 = weight(_text_:22 in 1852) [ClassicSimilarity], result of:
        0.04951138 = score(doc=1852,freq=2.0), product of:
          0.18281296 = queryWeight, product of:
            3.5018296 = idf(docFreq=3622, maxDocs=44218)
            0.052204985 = 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.5 = coord(1/2)

Date

11. 2.2011 18:22:58

Theme

Semantisches Umfeld in Indexierung u. Retrieval

0.043227583 = product of:
  0.08645517 = sum of:
    0.08645517 = sum of:
      0.036943786 = weight(_text_:retrieval in 4792) [ClassicSimilarity], result of:
        0.036943786 = score(doc=4792,freq=2.0), product of:
          0.15791564 = queryWeight, product of:
            3.024915 = idf(docFreq=5836, maxDocs=44218)
            0.052204985 = queryNorm
          0.23394634 = fieldWeight in 4792, product of:
            1.4142135 = tf(freq=2.0), with freq of:
              2.0 = termFreq=2.0
            3.024915 = idf(docFreq=5836, maxDocs=44218)
            0.0546875 = fieldNorm(doc=4792)
      0.04951138 = weight(_text_:22 in 4792) [ClassicSimilarity], result of:
        0.04951138 = score(doc=4792,freq=2.0), product of:
          0.18281296 = queryWeight, product of:
            3.5018296 = idf(docFreq=3622, maxDocs=44218)
            0.052204985 = 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.5 = coord(1/2)

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.

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.043227583 = product of:
  0.08645517 = sum of:
    0.08645517 = sum of:
      0.036943786 = weight(_text_:retrieval in 2654) [ClassicSimilarity], result of:
        0.036943786 = score(doc=2654,freq=2.0), product of:
          0.15791564 = queryWeight, product of:
            3.024915 = idf(docFreq=5836, maxDocs=44218)
            0.052204985 = queryNorm
          0.23394634 = fieldWeight in 2654, product of:
            1.4142135 = tf(freq=2.0), with freq of:
              2.0 = termFreq=2.0
            3.024915 = idf(docFreq=5836, maxDocs=44218)
            0.0546875 = fieldNorm(doc=2654)
      0.04951138 = weight(_text_:22 in 2654) [ClassicSimilarity], result of:
        0.04951138 = score(doc=2654,freq=2.0), product of:
          0.18281296 = queryWeight, product of:
            3.5018296 = idf(docFreq=3622, maxDocs=44218)
            0.052204985 = queryNorm
          0.2708308 = fieldWeight in 2654, 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=2654)
  0.5 = coord(1/2)

Abstract

Faceted Knowledge Representation provides a formalism for implementing knowledge systems. The basic notions of faceted knowledge representation are "unit", "relation", "facet" and "interpretation". Units are atomic elements and can be abstract elements or refer to external objects in an application. Relations are sequences or matrices of 0 and 1's (binary matrices). Facets are relational structures that combine units and relations. Each facet represents an aspect or viewpoint of a knowledge system. Interpretations are mappings that can be used to translate between different representations. This paper introduces the basic notions of faceted knowledge representation. The formalism is applied here to an abstract modeling of a faceted thesaurus as used in information retrieval.

Date

22. 1.2016 17:30:31

0.041457675 = product of:
  0.08291535 = sum of:
    0.08291535 = product of:
      0.24874605 = sum of:
        0.24874605 = weight(_text_:3a in 400) [ClassicSimilarity], result of:
          0.24874605 = score(doc=400,freq=2.0), product of:
            0.44259444 = queryWeight, product of:
              8.478011 = idf(docFreq=24, maxDocs=44218)
              0.052204985 = 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.5 = coord(1/2)

Content

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

0.037748627 = product of:
  0.075497255 = sum of:
    0.075497255 = sum of:
      0.04720504 = weight(_text_:retrieval in 4399) [ClassicSimilarity], result of:
        0.04720504 = score(doc=4399,freq=10.0), product of:
          0.15791564 = queryWeight, product of:
            3.024915 = idf(docFreq=5836, maxDocs=44218)
            0.052204985 = queryNorm
          0.29892567 = fieldWeight in 4399, product of:
            3.1622777 = tf(freq=10.0), with freq of:
              10.0 = termFreq=10.0
            3.024915 = idf(docFreq=5836, maxDocs=44218)
            0.03125 = fieldNorm(doc=4399)
      0.028292218 = weight(_text_:22 in 4399) [ClassicSimilarity], result of:
        0.028292218 = score(doc=4399,freq=2.0), product of:
          0.18281296 = queryWeight, product of:
            3.5018296 = idf(docFreq=3622, maxDocs=44218)
            0.052204985 = queryNorm
          0.15476047 = fieldWeight in 4399, 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=4399)
  0.5 = coord(1/2)

Abstract

Indexing plays a vital role in Information Retrieval. With the availability of huge volume of information, it has become necessary to index the information in such a way to make easier for the end users to find the information they want efficiently and accurately. Keyword-based indexing uses words as indexing terms. It is not capable of capturing the implicit relation among terms or the semantics of the words in the document. To eliminate this limitation, ontology-based indexing came into existence, which allows semantic based indexing to solve complex and indirect user queries. Ontologies are used for document indexing which allows semantic based information retrieval. Existing ontologies or the ones constructed from scratch are used presently for indexing. Constructing ontologies from scratch is a labor-intensive task and requires extensive domain knowledge whereas use of an existing ontology may leave some important concepts in documents un-annotated. Using multiple ontologies can overcome the problem of missing out concepts to a great extent, but it is difficult to manage (changes in ontologies over time by their developers) multiple ontologies and ontology heterogeneity also arises due to ontologies constructed by different ontology developers. One possible solution to managing multiple ontologies and build from scratch is to use modular ontologies for indexing.
Modular ontologies are built in modular manner by combining modules from multiple relevant ontologies. Ontology heterogeneity also arises during modular ontology construction because multiple ontologies are being dealt with, during this process. Ontologies need to be aligned before using them for modular ontology construction. The existing approaches for ontology alignment compare all the concepts of each ontology to be aligned, hence not optimized in terms of time and search space utilization. A new indexing technique is proposed based on modular ontology. An efficient ontology alignment technique is proposed to solve the heterogeneity problem during the construction of modular ontology. Results are satisfactory as Precision and Recall are improved by (8%) and (10%) respectively. The value of Pearsons Correlation Coefficient for degree of similarity, time, search space requirement, precision and recall are close to 1 which shows that the results are significant. Further research can be carried out for using modular ontology based indexing technique for Multimedia Information Retrieval and Bio-Medical information retrieval.

Date

20. 1.2015 18:30:22

0.037052214 = product of:
  0.07410443 = sum of:
    0.07410443 = sum of:
      0.0316661 = weight(_text_:retrieval in 2655) [ClassicSimilarity], result of:
        0.0316661 = score(doc=2655,freq=2.0), product of:
          0.15791564 = queryWeight, product of:
            3.024915 = idf(docFreq=5836, maxDocs=44218)
            0.052204985 = queryNorm
          0.20052543 = fieldWeight in 2655, product of:
            1.4142135 = tf(freq=2.0), with freq of:
              2.0 = termFreq=2.0
            3.024915 = idf(docFreq=5836, maxDocs=44218)
            0.046875 = fieldNorm(doc=2655)
      0.04243833 = weight(_text_:22 in 2655) [ClassicSimilarity], result of:
        0.04243833 = score(doc=2655,freq=2.0), product of:
          0.18281296 = queryWeight, product of:
            3.5018296 = idf(docFreq=3622, maxDocs=44218)
            0.052204985 = queryNorm
          0.23214069 = fieldWeight in 2655, 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=2655)
  0.5 = coord(1/2)

Abstract

The term "facet" was introduced into the field of library classification systems by Ranganathan in the 1930's [Ranganathan, 1962]. A facet is a viewpoint or aspect. In contrast to traditional classification systems, faceted systems are modular in that a domain is analyzed in terms of baseline facets which are then synthesized. In this paper, the term "facet" is used in a broader meaning. Facets can describe different aspects on the same level of abstraction or the same aspect on different levels of abstraction. The notion of facets is related to database views, multicontexts and conceptual scaling in formal concept analysis [Ganter and Wille, 1999], polymorphism in object-oriented design, aspect-oriented programming, views and contexts in description logic and semantic networks. This paper presents a definition of facets in terms of faceted knowledge representation that incorporates the traditional narrower notion of facets and potentially facilitates translation between different knowledge representation formalisms. A goal of this approach is a modular, machine-aided knowledge base design mechanism. A possible application is faceted thesaurus construction for information retrieval and data mining. Reasoning complexity depends on the size of the modules (facets). A more general analysis of complexity will be left for future research.

Date

22. 1.2016 17:30:31

0.030876845 = product of:
  0.06175369 = sum of:
    0.06175369 = sum of:
      0.026388418 = weight(_text_:retrieval in 1670) [ClassicSimilarity], result of:
        0.026388418 = score(doc=1670,freq=2.0), product of:
          0.15791564 = queryWeight, product of:
            3.024915 = idf(docFreq=5836, maxDocs=44218)
            0.052204985 = queryNorm
          0.16710453 = fieldWeight in 1670, product of:
            1.4142135 = tf(freq=2.0), with freq of:
              2.0 = termFreq=2.0
            3.024915 = idf(docFreq=5836, maxDocs=44218)
            0.0390625 = fieldNorm(doc=1670)
      0.035365272 = weight(_text_:22 in 1670) [ClassicSimilarity], result of:
        0.035365272 = score(doc=1670,freq=2.0), product of:
          0.18281296 = queryWeight, product of:
            3.5018296 = idf(docFreq=3622, maxDocs=44218)
            0.052204985 = queryNorm
          0.19345059 = fieldWeight in 1670, 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=1670)
  0.5 = coord(1/2)

Abstract

Es ist ein semantisches Netz für den Gegenstandsbereich Luftfahrt modelliert worden, welches Unternehmensinformationen, Organisationen, Fluglinien, Flughäfen, etc. enthält, Diese sind 10 Hauptkategorien zugeordnet worden, die untergliedert nach Facetten sind. Die Begriffe des Gegenstandsbereiches sind mit 23 unterschiedlichen Relationen verknüpft worden (Z. B.: 'hat Standort in', bietet an, 'ist Homebase von', etc). Der Schwerpunkt der Betrachtung liegt auf dem Unterschied zwischen den drei klassischen Standardrelationen und den zusätzlich eingerichteten Relationen, bezüglich ihrem Nutzen für ein effizientes Retrieval. Die angelegten Kategorien und Relationen sind sowohl für eine kognitive als auch für eine maschinelle Verarbeitung geeignet.

Date

26. 9.2006 21:00:22

0.030876845 = product of:
  0.06175369 = sum of:
    0.06175369 = sum of:
      0.026388418 = weight(_text_:retrieval in 633) [ClassicSimilarity], result of:
        0.026388418 = score(doc=633,freq=2.0), product of:
          0.15791564 = queryWeight, product of:
            3.024915 = idf(docFreq=5836, maxDocs=44218)
            0.052204985 = queryNorm
          0.16710453 = fieldWeight in 633, product of:
            1.4142135 = tf(freq=2.0), with freq of:
              2.0 = termFreq=2.0
            3.024915 = idf(docFreq=5836, maxDocs=44218)
            0.0390625 = fieldNorm(doc=633)
      0.035365272 = weight(_text_:22 in 633) [ClassicSimilarity], result of:
        0.035365272 = score(doc=633,freq=2.0), product of:
          0.18281296 = queryWeight, product of:
            3.5018296 = idf(docFreq=3622, maxDocs=44218)
            0.052204985 = queryNorm
          0.19345059 = fieldWeight in 633, 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=633)
  0.5 = coord(1/2)

Abstract

Considering the characteristics of hypertext systems and problems such as cognitive overload and the disorientation of users, this project studies subject hypertext documents that have undergone conceptual structuring using facets for content representation and improvement of information retrieval during navigation. The main objective was to assess the possibility of the application of topic map technology for automating the compatibilization process of these structures. For this purpose, two dissertations from the UFMG Information Science Post-Graduation Program were adopted as samples. Both dissertations had been duly analyzed and structured on the MHTX (Hypertextual Map) prototype database. The faceted structures of both dissertations, which had been represented in conceptual maps, were then converted into topic maps. It was then possible to use the merge property of the topic maps to promote the semantic interrelationship between the maps and, consequently, between the hypertextual information resources proper. The merge results were then analyzed in the light of theories dealing with the compatibilization of languages developed within the realm of information technology and librarianship from the 1960s on. The main goals accomplished were: (a) the detailed conceptualization of the merge process of the topic maps, considering the possible compatibilization levels and the applicability of this technology in the integration of faceted structures; and (b) the production of a detailed sequence of steps that may be used in the implementation of topic maps based on faceted structures.

Date

22. 2.2013 11:39:23

0.030876845 = product of:
  0.06175369 = sum of:
    0.06175369 = sum of:
      0.026388418 = weight(_text_:retrieval in 1434) [ClassicSimilarity], result of:
        0.026388418 = score(doc=1434,freq=2.0), product of:
          0.15791564 = queryWeight, product of:
            3.024915 = idf(docFreq=5836, maxDocs=44218)
            0.052204985 = queryNorm
          0.16710453 = fieldWeight in 1434, product of:
            1.4142135 = tf(freq=2.0), with freq of:
              2.0 = termFreq=2.0
            3.024915 = idf(docFreq=5836, maxDocs=44218)
            0.0390625 = fieldNorm(doc=1434)
      0.035365272 = weight(_text_:22 in 1434) [ClassicSimilarity], result of:
        0.035365272 = score(doc=1434,freq=2.0), product of:
          0.18281296 = queryWeight, product of:
            3.5018296 = idf(docFreq=3622, maxDocs=44218)
            0.052204985 = queryNorm
          0.19345059 = fieldWeight in 1434, 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=1434)
  0.5 = coord(1/2)

Abstract

Knowledge organization of large-scale content on the Web requires substantial amounts of semantic metadata that is expensive to generate manually. Recent developments in Web technologies have enabled any user to tag documents and other forms of content thereby generating metadata that could help organize knowledge. However, merely adding one or more tags to a document is highly inadequate to capture the aboutness of the document and thereby to support powerful semantic functions such as automatic classification, question answering or true semantic search and retrieval. This is true even when the tags used are labels from a well-designed classification system such as a thesaurus or taxonomy. There is a strong need to develop a semantic tagging mechanism with sufficient expressive power to capture the aboutness of each part of a document or dataset or multimedia content in order to enable applications that can benefit from knowledge organization on the Web. This article proposes a highly expressive mechanism of using ontology snippets as semantic tags that map portions of a document or a part of a dataset or a segment of a multimedia content to concepts and relations in an ontology of the domain(s) of interest.

Source

Knowledge organization in the 21st century: between historical patterns and future prospects. Proceedings of the Thirteenth International ISKO Conference 19-22 May 2014, Kraków, Poland. Ed.: Wieslaw Babik

0.030876845 = product of:
  0.06175369 = sum of:
    0.06175369 = sum of:
      0.026388418 = weight(_text_:retrieval in 2829) [ClassicSimilarity], result of:
        0.026388418 = score(doc=2829,freq=2.0), product of:
          0.15791564 = queryWeight, product of:
            3.024915 = idf(docFreq=5836, maxDocs=44218)
            0.052204985 = queryNorm
          0.16710453 = fieldWeight in 2829, product of:
            1.4142135 = tf(freq=2.0), with freq of:
              2.0 = termFreq=2.0
            3.024915 = idf(docFreq=5836, maxDocs=44218)
            0.0390625 = fieldNorm(doc=2829)
      0.035365272 = weight(_text_:22 in 2829) [ClassicSimilarity], result of:
        0.035365272 = score(doc=2829,freq=2.0), product of:
          0.18281296 = queryWeight, product of:
            3.5018296 = idf(docFreq=3622, maxDocs=44218)
            0.052204985 = queryNorm
          0.19345059 = fieldWeight in 2829, 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=2829)
  0.5 = coord(1/2)

Abstract

Knowledge organization faces the challenge of managing the amount of knowledge available on the Web. Published literature in biomedical sciences is a huge source of knowledge, which can only efficiently be managed through automatic methods. The conventional channel for reporting scientific results is Web electronic publishing. Despite its advances, scientific articles are still published in print formats such as portable document format (PDF). Semantic Web and Linked Data technologies provides new opportunities for communicating, sharing, and integrating scientific knowledge that can overcome the limitations of the current print format. Here is proposed a semantic model of scholarly electronic articles in biomedical sciences that can overcome the limitations of traditional flat records formats. Scientific knowledge consists of claims made throughout article texts, especially when semantic elements such as questions, hypotheses and conclusions are stated. These elements, although having different roles, express relationships between phenomena. Once such knowledge units are extracted and represented with technologies such as RDF (Resource Description Framework) and linked data, they may be integrated in reasoning chains. Thereby, the results of scientific research can be published and shared in structured formats, enabling crawling by software agents, semantic retrieval, knowledge reuse, validation of scientific results, and identification of traces of scientific discoveries.

Date

12. 3.2016 13:17:22

0.030876845 = product of:
  0.06175369 = sum of:
    0.06175369 = sum of:
      0.026388418 = weight(_text_:retrieval in 2831) [ClassicSimilarity], result of:
        0.026388418 = score(doc=2831,freq=2.0), product of:
          0.15791564 = queryWeight, product of:
            3.024915 = idf(docFreq=5836, maxDocs=44218)
            0.052204985 = queryNorm
          0.16710453 = fieldWeight in 2831, product of:
            1.4142135 = tf(freq=2.0), with freq of:
              2.0 = termFreq=2.0
            3.024915 = idf(docFreq=5836, maxDocs=44218)
            0.0390625 = fieldNorm(doc=2831)
      0.035365272 = weight(_text_:22 in 2831) [ClassicSimilarity], result of:
        0.035365272 = score(doc=2831,freq=2.0), product of:
          0.18281296 = queryWeight, product of:
            3.5018296 = idf(docFreq=3622, maxDocs=44218)
            0.052204985 = queryNorm
          0.19345059 = fieldWeight in 2831, 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=2831)
  0.5 = coord(1/2)

Abstract

The purpose of this work is to develop an ontology-based framework for developing an information retrieval system to cater to specific queries of users. For creating such an ontology, information was obtained from a wide range of information sources involved with brain tumour study and research. The information thus obtained was compiled and analysed to provide a standard, reliable and relevant information base to aid our proposed system. Facet-based methodology has been used for ontology formalization for quite some time. Ontology formalization involves different steps such as identification of the terminology, analysis, synthesis, standardization and ordering. A vast majority of the ontologies being developed nowadays lack flexibility. This becomes a formidable constraint when it comes to interoperability. We found that a facet-based method provides a distinct guideline for the development of a robust and flexible model concerning the domain of brain tumours. Our attempt has been to bridge library and information science and computer science, which itself involved an experimental approach. It was discovered that a faceted approach is really enduring, as it helps in the achievement of properties like navigation, exploration and faceted browsing. Computer-based brain tumour ontology supports the work of researchers towards gathering information on brain tumour research and allows users across the world to intelligently access new scientific information quickly and efficiently.

Date

12. 3.2016 13:21:22