Search (54 results, page 1 of 3)

  • × theme_ss:"Semantisches Umfeld in Indexierung u. Retrieval"
  1. Gillitzer, B.: Yewno (2017) 0.05 
    0.04529343 = product of:
  0.09058686 = sum of:
    0.041721575 = weight(_text_:open in 3447) [ClassicSimilarity], result of:
      0.041721575 = score(doc=3447,freq=2.0), product of:
        0.20964009 = queryWeight, product of:
          4.5032015 = idf(docFreq=1330, maxDocs=44218)
          0.046553567 = queryNorm
        0.19901526 = fieldWeight in 3447, product of:
          1.4142135 = tf(freq=2.0), with freq of:
            2.0 = termFreq=2.0
          4.5032015 = idf(docFreq=1330, maxDocs=44218)
          0.03125 = fieldNorm(doc=3447)
    0.04886529 = sum of:
      0.023635827 = weight(_text_:access in 3447) [ClassicSimilarity], result of:
        0.023635827 = score(doc=3447,freq=2.0), product of:
          0.15778996 = queryWeight, product of:
            3.389428 = idf(docFreq=4053, maxDocs=44218)
            0.046553567 = queryNorm
          0.14979297 = fieldWeight in 3447, product of:
            1.4142135 = tf(freq=2.0), with freq of:
              2.0 = termFreq=2.0
            3.389428 = idf(docFreq=4053, maxDocs=44218)
            0.03125 = fieldNorm(doc=3447)
      0.025229463 = weight(_text_:22 in 3447) [ClassicSimilarity], result of:
        0.025229463 = score(doc=3447,freq=2.0), product of:
          0.16302267 = queryWeight, product of:
            3.5018296 = idf(docFreq=3622, maxDocs=44218)
            0.046553567 = 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.5 = coord(2/4)
    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
  2. Mlodzka-Stybel, A.: Towards continuous improvement of users' access to a library catalogue (2014) 0.03 
    0.025661811 = product of:
  0.102647245 = sum of:
    0.102647245 = sum of:
      0.058495685 = weight(_text_:access in 1466) [ClassicSimilarity], result of:
        0.058495685 = score(doc=1466,freq=4.0), product of:
          0.15778996 = queryWeight, product of:
            3.389428 = idf(docFreq=4053, maxDocs=44218)
            0.046553567 = queryNorm
          0.3707187 = fieldWeight in 1466, product of:
            2.0 = tf(freq=4.0), with freq of:
              4.0 = termFreq=4.0
            3.389428 = idf(docFreq=4053, maxDocs=44218)
            0.0546875 = fieldNorm(doc=1466)
      0.04415156 = weight(_text_:22 in 1466) [ClassicSimilarity], result of:
        0.04415156 = score(doc=1466,freq=2.0), product of:
          0.16302267 = queryWeight, product of:
            3.5018296 = idf(docFreq=3622, maxDocs=44218)
            0.046553567 = queryNorm
          0.2708308 = fieldWeight in 1466, 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=1466)
  0.25 = coord(1/4)
    Abstract
    The paper discusses the issue of increasing users' access to library records by their publication in Google. Data from the records, converted into html format, have been indexed by Google. The process covered basic formal description fields of the records, description of the content, supported with a thesaurus, as well as an abstract, if present in the record. In addition to monitoring the end users' statistics, the pilot testing covered visibility of library records in Google search results.
    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
  3. Zeng, M.L.; Gracy, K.F.; Zumer, M.: Using a semantic analysis tool to generate subject access points : a study using Panofsky's theory and two research samples (2014) 0.02 
    0.02481297 = product of:
  0.09925188 = sum of:
    0.09925188 = sum of:
      0.06140768 = weight(_text_:access in 1464) [ClassicSimilarity], result of:
        0.06140768 = score(doc=1464,freq=6.0), product of:
          0.15778996 = queryWeight, product of:
            3.389428 = idf(docFreq=4053, maxDocs=44218)
            0.046553567 = queryNorm
          0.38917357 = fieldWeight in 1464, product of:
            2.4494898 = tf(freq=6.0), with freq of:
              6.0 = termFreq=6.0
            3.389428 = idf(docFreq=4053, maxDocs=44218)
            0.046875 = fieldNorm(doc=1464)
      0.037844196 = weight(_text_:22 in 1464) [ClassicSimilarity], result of:
        0.037844196 = score(doc=1464,freq=2.0), product of:
          0.16302267 = queryWeight, product of:
            3.5018296 = idf(docFreq=3622, maxDocs=44218)
            0.046553567 = queryNorm
          0.23214069 = fieldWeight in 1464, 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=1464)
  0.25 = coord(1/4)
    Abstract
    This paper attempts to explore an approach of using an automatic semantic analysis tool to enhance the "subject" access to materials that are not included in the usual library subject cataloging process. Using two research samples the authors analyzed the access points supplied by OpenCalais, a semantic analysis tool. As an aid in understanding how computerized subject analysis might be approached, this paper suggests using the three-layer framework that has been accepted and applied in image analysis, developed by Erwin Panofsky.
    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
  4. Mandalka, M.: Open semantic search zum unabhängigen und datenschutzfreundlichen Erschliessen von Dokumenten (2015) 0.02 
    0.022126209 = product of:
  0.088504836 = sum of:
    0.088504836 = weight(_text_:open in 2133) [ClassicSimilarity], result of:
      0.088504836 = score(doc=2133,freq=16.0), product of:
        0.20964009 = queryWeight, product of:
          4.5032015 = idf(docFreq=1330, maxDocs=44218)
          0.046553567 = queryNorm
        0.42217514 = fieldWeight in 2133, product of:
          4.0 = tf(freq=16.0), with freq of:
            16.0 = termFreq=16.0
          4.5032015 = idf(docFreq=1330, maxDocs=44218)
          0.0234375 = fieldNorm(doc=2133)
  0.25 = coord(1/4)
    Content
    "Open Semantic Desktop Search Zur Tagung des Netzwerk Recherche ist die Desktop Suchmaschine Open Semantic Desktop Search zum unabhängigen und datenschutzfreundlichen Erschliessen und Analysieren von Dokumentenbergen nun erstmals auch als deutschsprachige Version verfügbar. Dank mächtiger Open Source Basis kann die auf Debian GNU/Linux und Apache Solr basierende freie Software als unter Linux, Windows oder Mac lauffähige virtuelle Maschine kostenlos heruntergeladen, genutzt, weitergegeben und weiterentwickelt werden. Dokumentenberge erschliessen Ob grösserer Leak oder Zusammenwürfeln oder (wieder) Erschliessen umfangreicherer (kollaborativer) Recherche(n) oder Archive: Hin und wieder müssen größere Datenberge bzw. Dokumentenberge erschlossen werden, die so viele Dokumente enthalten, dass Mensch diese Masse an Dokumenten nicht mehr alle nacheinander durchschauen und einordnen kann. Auch bei kontinuierlicher Recherche zu Fachthemen sammeln sich mit der Zeit größere Mengen digitalisierter oder digitaler Dokumente zu grösseren Datenbergen an, die immer weiter wachsen und deren Informationen mit einer Suchmaschine für das Archiv leichter auffindbar bleiben. Moderne Tools zur Datenanalyse in Verbindung mit Enterprise Search Suchlösungen und darauf aufbauender Recherche-Tools helfen (halb)automatisch.
    Virtuelle Maschine für mehr Plattformunabhängigkeit Die nun auch deutschsprachig verfügbare und mit deutschen Daten wie Ortsnamen oder Bundestagsabgeordneten vorkonfigurierte virtuelle Maschine Open Semantic Desktop Search ermöglicht nun auch auf einzelnen Desktop Computern oder Notebooks mit Windows oder iOS (Mac) die Suche und Analyse von Dokumenten mit der Suchmaschine Open Semantic Search. Als virtuelle Maschine (VM) lässt sich die Suchmaschine Open Semantic Search nicht nur für besonders sensible Dokumente mit dem verschlüsselten Live-System InvestigateIX als abgeschottetes System auf verschlüsselten externen Datenträgern installieren, sondern als virtuelle Maschine für den Desktop auch einfach unter Windows oder auf einem Mac in eine bzgl. weiterer Software und Daten bereits existierende Systemumgebung integrieren, ohne hierzu auf einen (für gemeinsame Recherchen im Team oder für die Redaktion auch möglichen) Suchmaschinen Server angewiesen zu sein. Datenschutz & Unabhängigkeit: Grössere Unabhängigkeit von zentralen IT-Infrastrukturen für unabhängigen investigativen Datenjournalismus Damit ist investigative Recherche weitmöglichst unabhängig möglich: ohne teure, zentrale und von Administratoren abhängige Server, ohne von der Dokumentenanzahl abhängige teure Software-Lizenzen, ohne Internet und ohne spionierende Cloud-Dienste. Datenanalyse und Suche finden auf dem eigenen Computer statt, nicht wie bei vielen anderen Lösungen in der sogenannten Cloud."
    Source
    http://www.linux-community.de/Internal/Nachrichten/Open-Semantic-Search-zum-unabhaengigen-und-datenschutzfreundlichen-Erschliessen-von-Dokumenten
  5. Hoppe, T.: Semantische Filterung : ein Werkzeug zur Steigerung der Effizienz im Wissensmanagement (2013) 0.02 
    0.020860787 = product of:
  0.08344315 = sum of:
    0.08344315 = weight(_text_:open in 2245) [ClassicSimilarity], result of:
      0.08344315 = score(doc=2245,freq=2.0), product of:
        0.20964009 = queryWeight, product of:
          4.5032015 = idf(docFreq=1330, maxDocs=44218)
          0.046553567 = queryNorm
        0.39803052 = fieldWeight in 2245, product of:
          1.4142135 = tf(freq=2.0), with freq of:
            2.0 = termFreq=2.0
          4.5032015 = idf(docFreq=1330, maxDocs=44218)
          0.0625 = fieldNorm(doc=2245)
  0.25 = coord(1/4)
    Source
    Open journal of knowledge management. 2013, Ausgabe VII = http://www.community-of-knowledge.de/beitrag/semantische-filterung-ein-werkzeug-zur-steigerung-der-effizienz-im-wissensmanagement/
  6. Klas, C.-P.; Fuhr, N.; Schaefer, A.: Evaluating strategic support for information access in the DAFFODIL system (2004) 0.02 
    0.018324483 = product of:
  0.07329793 = sum of:
    0.07329793 = sum of:
      0.03545374 = weight(_text_:access in 2419) [ClassicSimilarity], result of:
        0.03545374 = score(doc=2419,freq=2.0), product of:
          0.15778996 = queryWeight, product of:
            3.389428 = idf(docFreq=4053, maxDocs=44218)
            0.046553567 = queryNorm
          0.22468945 = fieldWeight in 2419, product of:
            1.4142135 = tf(freq=2.0), with freq of:
              2.0 = termFreq=2.0
            3.389428 = idf(docFreq=4053, maxDocs=44218)
            0.046875 = fieldNorm(doc=2419)
      0.037844196 = weight(_text_:22 in 2419) [ClassicSimilarity], result of:
        0.037844196 = score(doc=2419,freq=2.0), product of:
          0.16302267 = queryWeight, product of:
            3.5018296 = idf(docFreq=3622, maxDocs=44218)
            0.046553567 = queryNorm
          0.23214069 = fieldWeight in 2419, 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=2419)
  0.25 = coord(1/4)
    Date
    16.11.2008 16:22:48
  7. Narock, T.; Zhou, L.; Yoon, V.: Semantic similarity of ontology instances using polarity mining (2013) 0.02 
    0.015645592 = product of:
  0.062582366 = sum of:
    0.062582366 = weight(_text_:open in 620) [ClassicSimilarity], result of:
      0.062582366 = score(doc=620,freq=2.0), product of:
        0.20964009 = queryWeight, product of:
          4.5032015 = idf(docFreq=1330, maxDocs=44218)
          0.046553567 = queryNorm
        0.2985229 = fieldWeight in 620, product of:
          1.4142135 = tf(freq=2.0), with freq of:
            2.0 = termFreq=2.0
          4.5032015 = idf(docFreq=1330, maxDocs=44218)
          0.046875 = fieldNorm(doc=620)
  0.25 = coord(1/4)
    Abstract
    Semantic similarity is vital to many areas, such as information retrieval. Various methods have been proposed with a focus on comparing unstructured text documents. Several of these have been enhanced with ontology; however, they have not been applied to ontology instances. With the growth in ontology instance data published online through, for example, Linked Open Data, there is an increasing need to apply semantic similarity to ontology instances. Drawing on ontology-supported polarity mining (OSPM), we propose an algorithm that enhances the computation of semantic similarity with polarity mining techniques. The algorithm is evaluated with online customer review data. The experimental results show that the proposed algorithm outperforms the baseline algorithm in multiple settings.
  8. Mayr, P.; Schaer, P.; Mutschke, P.: ¬A science model driven retrieval prototype (2011) 0.02 
    0.015645592 = product of:
  0.062582366 = sum of:
    0.062582366 = weight(_text_:open in 649) [ClassicSimilarity], result of:
      0.062582366 = score(doc=649,freq=2.0), product of:
        0.20964009 = queryWeight, product of:
          4.5032015 = idf(docFreq=1330, maxDocs=44218)
          0.046553567 = queryNorm
        0.2985229 = fieldWeight in 649, product of:
          1.4142135 = tf(freq=2.0), with freq of:
            2.0 = termFreq=2.0
          4.5032015 = idf(docFreq=1330, maxDocs=44218)
          0.046875 = fieldNorm(doc=649)
  0.25 = coord(1/4)
    Abstract
    This paper is about a better understanding of the structure and dynamics of science and the usage of these insights for compensating the typical problems that arises in metadata-driven Digital Libraries. Three science model driven retrieval services are presented: co-word analysis based query expansion, re-ranking via Bradfordizing and author centrality. The services are evaluated with relevance assessments from which two important implications emerge: (1) precision values of the retrieval services are the same or better than the tf-idf retrieval baseline and (2) each service retrieved a disjoint set of documents. The different services each favor quite other - but still relevant - documents than pure term-frequency based rankings. The proposed models and derived retrieval services therefore open up new viewpoints on the scientific knowledge space and provide an alternative framework to structure scholarly information systems.
  9. Hazrina, S.; Sharef, N.M.; Ibrahim, H.; Murad, M.A.A.; Noah, S.A.M.: Review on the advancements of disambiguation in semantic question answering system (2017) 0.01 
    0.014750806 = product of:
  0.059003223 = sum of:
    0.059003223 = weight(_text_:open in 3292) [ClassicSimilarity], result of:
      0.059003223 = score(doc=3292,freq=4.0), product of:
        0.20964009 = queryWeight, product of:
          4.5032015 = idf(docFreq=1330, maxDocs=44218)
          0.046553567 = queryNorm
        0.2814501 = fieldWeight in 3292, product of:
          2.0 = tf(freq=4.0), with freq of:
            4.0 = termFreq=4.0
          4.5032015 = idf(docFreq=1330, maxDocs=44218)
          0.03125 = fieldNorm(doc=3292)
  0.25 = coord(1/4)
    Abstract
    Ambiguity is a potential problem in any semantic question answering (SQA) system due to the nature of idiosyncrasy in composing natural language (NL) question and semantic resources. Thus, disambiguation of SQA systems is a field of ongoing research. Ambiguity occurs in SQA because a word or a sentence can have more than one meaning or multiple words in the same language can share the same meaning. Therefore, an SQA system needs disambiguation solutions to select the correct meaning when the linguistic triples matched with multiple KB concepts, and enumerate similar words especially when linguistic triples do not match with any KB concept. The latest development in this field is a solution for SQA systems that is able to process a complex NL question while accessing open-domain data from linked open data (LOD). The contributions in this paper include (1) formulating an SQA conceptual framework based on an in-depth study of existing SQA processes; (2) identifying the ambiguity types, specifically in English based on an interdisciplinary literature review; (3) highlighting the ambiguity types that had been resolved by the previous SQA studies; and (4) analysing the results of the existing SQA disambiguation solutions, the complexity of NL question processing, and the complexity of data retrieval from KB(s) or LOD. The results of this review demonstrated that out of thirteen types of ambiguity identified in the literature, only six types had been successfully resolved by the previous studies. Efforts to improve the disambiguation are in progress for the remaining unresolved ambiguity types to improve the accuracy of the formulated answers by the SQA system. The remaining ambiguity types are potentially resolved in the identified SQA process based on ambiguity scenarios elaborated in this paper. The results of this review also demonstrated that most existing research on SQA systems have treated the processing of the NL question complexity separate from the processing of the KB structure complexity.
  10. Xamena, E.; Brignole, N.B.; Maguitman, A.G.: ¬A study of relevance propagation in large topic ontologies (2013) 0.01 
    0.013037993 = product of:
  0.05215197 = sum of:
    0.05215197 = weight(_text_:open in 1105) [ClassicSimilarity], result of:
      0.05215197 = score(doc=1105,freq=2.0), product of:
        0.20964009 = queryWeight, product of:
          4.5032015 = idf(docFreq=1330, maxDocs=44218)
          0.046553567 = queryNorm
        0.24876907 = fieldWeight in 1105, product of:
          1.4142135 = tf(freq=2.0), with freq of:
            2.0 = termFreq=2.0
          4.5032015 = idf(docFreq=1330, maxDocs=44218)
          0.0390625 = fieldNorm(doc=1105)
  0.25 = coord(1/4)
    Abstract
    Topic ontologies or web directories consist of large collections of links to websites, arranged by topic in different categories. The structure of these ontologies is typically not flat because there are hierarchical and nonhierarchical relationships among topics. As a consequence, websites classified under a certain topic may be relevant to other topics. Although some of these relevance relations are explicit, most of them must be discovered by an analysis of the structure of the ontologies. This article proposes a family of models of relevance propagation in topic ontologies. An efficient computational framework is described and used to compute nine different models for a portion of the Open Directory Project graph consisting of more than half a million nodes and approximately 1.5 million edges of different types. After performing a quantitative analysis, a user study was carried out to compare the most promising models. It was found that some general difficulties rule out the possibility of defining flawless models of relevance propagation that only take into account structural aspects of an ontology. However, there is a clear indication that including transitive relations induced by the nonhierarchical components of the ontology results in relevance propagation models that are superior to more basic approaches.
  11. Ma, N.; Zheng, H.T.; Xiao, X.: ¬An ontology-based latent semantic indexing approach using long short-term memory networks (2017) 0.01 
    0.013037993 = product of:
  0.05215197 = sum of:
    0.05215197 = weight(_text_:open in 3810) [ClassicSimilarity], result of:
      0.05215197 = score(doc=3810,freq=2.0), product of:
        0.20964009 = queryWeight, product of:
          4.5032015 = idf(docFreq=1330, maxDocs=44218)
          0.046553567 = queryNorm
        0.24876907 = fieldWeight in 3810, product of:
          1.4142135 = tf(freq=2.0), with freq of:
            2.0 = termFreq=2.0
          4.5032015 = idf(docFreq=1330, maxDocs=44218)
          0.0390625 = fieldNorm(doc=3810)
  0.25 = coord(1/4)
    Abstract
    Nowadays, online data shows an astonishing increase and the issue of semantic indexing remains an open question. Ontologies and knowledge bases have been widely used to optimize performance. However, researchers are placing increased emphasis on internal relations of ontologies but neglect latent semantic relations between ontologies and documents. They generally annotate instances mentioned in documents, which are related to concepts in ontologies. In this paper, we propose an Ontology-based Latent Semantic Indexing approach utilizing Long Short-Term Memory networks (LSTM-OLSI). We utilize an importance-aware topic model to extract document-level semantic features and leverage ontologies to extract word-level contextual features. Then we encode the above two levels of features and match their embedding vectors utilizing LSTM networks. Finally, the experimental results reveal that LSTM-OLSI outperforms existing techniques and demonstrates deep comprehension of instances and articles.
  12. Kasprzik, A.; Kett, J.: Vorschläge für eine Weiterentwicklung der Sacherschließung und Schritte zur fortgesetzten strukturellen Aufwertung der GND (2018) 0.01 
    0.013037993 = product of:
  0.05215197 = sum of:
    0.05215197 = weight(_text_:open in 4599) [ClassicSimilarity], result of:
      0.05215197 = score(doc=4599,freq=2.0), product of:
        0.20964009 = queryWeight, product of:
          4.5032015 = idf(docFreq=1330, maxDocs=44218)
          0.046553567 = queryNorm
        0.24876907 = fieldWeight in 4599, product of:
          1.4142135 = tf(freq=2.0), with freq of:
            2.0 = termFreq=2.0
          4.5032015 = idf(docFreq=1330, maxDocs=44218)
          0.0390625 = fieldNorm(doc=4599)
  0.25 = coord(1/4)
    Abstract
    Aufgrund der fortgesetzten Publikationsflut stellt sich immer dringender die Frage, wie die Schwellen für die Titel- und Normdatenpflege gesenkt werden können - sowohl für die intellektuelle als auch die automatisierte Sacherschließung. Zu einer Verbesserung der Daten- und Arbeitsqualität in der Sacherschließung kann beigetragen werden a) durch eine flexible Visualisierung der Gemeinsamen Normdatei (GND) und anderer Wissensorganisationssysteme, so dass deren Graphstruktur intuitiv erfassbar wird, und b) durch eine investigative Analyse ihrer aktuellen Struktur und die Entwicklung angepasster automatisierter Methoden zur Ermittlung und Korrektur fehlerhafter Muster. Die Deutsche Nationalbibliothek (DNB) prüft im Rahmen des GND-Entwicklungsprogramms 2017-2021, welche Bedingungen für eine fruchtbare community-getriebene Open-Source-Entwicklung entsprechender Werkzeuge gegeben sein müssen. Weiteres Potential steckt in einem langfristigen Übergang zu einer Darstellung von Titel- und Normdaten in Beschreibungssprachen im Sinne des Semantic Web (RDF; OWL, SKOS). So profitiert die GND von der Interoperabilität mit anderen kontrollierten Vokabularen und von einer erleichterten Interaktion mit anderen Fach-Communities und kann umgekehrt auch außerhalb des Bibliothekswesens zu einem noch attraktiveren Wissensorganisationssystem werden. Darüber hinaus bieten die Ansätze aus dem Semantic Web die Möglichkeit, stärker formalisierte, strukturierende Satellitenvokabulare rund um die GND zu entwickeln. Daraus ergeben sich nicht zuletzt auch neue Perspektiven für die automatisierte Sacherschließung. Es wäre lohnend, näher auszuloten, wie und inwieweit semantisch-logische Verfahren den bestehenden Methodenmix bereichern können.
  13. Fernández-Reyes, F.C.; Hermosillo-Valadez, J.; Montes-y-Gómez, M.: ¬A prospect-guided global query expansion strategy using word embeddings (2018) 0.01 
    0.013037993 = product of:
  0.05215197 = sum of:
    0.05215197 = weight(_text_:open in 5090) [ClassicSimilarity], result of:
      0.05215197 = score(doc=5090,freq=2.0), product of:
        0.20964009 = queryWeight, product of:
          4.5032015 = idf(docFreq=1330, maxDocs=44218)
          0.046553567 = queryNorm
        0.24876907 = fieldWeight in 5090, product of:
          1.4142135 = tf(freq=2.0), with freq of:
            2.0 = termFreq=2.0
          4.5032015 = idf(docFreq=1330, maxDocs=44218)
          0.0390625 = fieldNorm(doc=5090)
  0.25 = coord(1/4)
    Abstract
    The effectiveness of query expansion methods depends essentially on identifying good candidates, or prospects, semantically related to query terms. Word embeddings have been used recently in an attempt to address this problem. Nevertheless query disambiguation is still necessary as the semantic relatedness of each word in the corpus is modeled, but choosing the right terms for expansion from the standpoint of the un-modeled query semantics remains an open issue. In this paper we propose a novel query expansion method using word embeddings that models the global query semantics from the standpoint of prospect vocabulary terms. The proposed method allows to explore query-vocabulary semantic closeness in such a way that new terms, semantically related to more relevant topics, are elicited and added in function of the query as a whole. The method includes candidates pooling strategies that address disambiguation issues without using exogenous resources. We tested our method with three topic sets over CLEF corpora and compared it across different Information Retrieval models and against another expansion technique using word embeddings as well. Our experiments indicate that our method achieves significant results that outperform the baselines, improving both recall and precision metrics without relevance feedback.
  14. Boyack, K.W.; Wylie,B.N.; Davidson, G.S.: Information Visualization, Human-Computer Interaction, and Cognitive Psychology : Domain Visualizations (2002) 0.01 
    0.011149953 = product of:
  0.044599812 = sum of:
    0.044599812 = product of:
      0.089199625 = sum of:
        0.089199625 = weight(_text_:22 in 1352) [ClassicSimilarity], result of:
          0.089199625 = score(doc=1352,freq=4.0), product of:
            0.16302267 = queryWeight, product of:
              3.5018296 = idf(docFreq=3622, maxDocs=44218)
              0.046553567 = 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.5 = coord(1/2)
  0.25 = coord(1/4)
    Date
    22. 2.2003 17:25:39
    22. 2.2003 18:17:40
  15. Smeaton, A.F.; Rijsbergen, C.J. van: ¬The retrieval effects of query expansion on a feedback document retrieval system (1983) 0.01 
    0.01103789 = product of:
  0.04415156 = sum of:
    0.04415156 = product of:
      0.08830312 = sum of:
        0.08830312 = weight(_text_:22 in 2134) [ClassicSimilarity], result of:
          0.08830312 = score(doc=2134,freq=2.0), product of:
            0.16302267 = queryWeight, product of:
              3.5018296 = idf(docFreq=3622, maxDocs=44218)
              0.046553567 = 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.5 = coord(1/2)
  0.25 = coord(1/4)
    Date
    30. 3.2001 13:32:22
  16. Shah, C.: Collaborative information seeking : the art and science of making the whole greater than the sum of all (2012) 0.01 
    0.010430394 = product of:
  0.041721575 = sum of:
    0.041721575 = weight(_text_:open in 360) [ClassicSimilarity], result of:
      0.041721575 = score(doc=360,freq=2.0), product of:
        0.20964009 = queryWeight, product of:
          4.5032015 = idf(docFreq=1330, maxDocs=44218)
          0.046553567 = queryNorm
        0.19901526 = fieldWeight in 360, product of:
          1.4142135 = tf(freq=2.0), with freq of:
            2.0 = termFreq=2.0
          4.5032015 = idf(docFreq=1330, maxDocs=44218)
          0.03125 = fieldNorm(doc=360)
  0.25 = coord(1/4)
    Abstract
    Today's complex, information-intensive problems often require people to work together. Mostly these tasks go far beyond simply searching together; they include information lookup, sharing, synthesis, and decision-making. In addition, they all have an end-goal that is mutually beneficial to all parties involved. Such "collaborative information seeking" (CIS) projects typically last several sessions and the participants all share an intention to contribute and benefit. Not surprisingly, these processes are highly interactive. Shah focuses on two individually well-understood notions: collaboration and information seeking, with the goal of bringing them together to show how it is a natural tendency for humans to work together on complex tasks. The first part of his book introduces the general notions of collaboration and information seeking, as well as related concepts, terminology, and frameworks; and thus provides the reader with a comprehensive treatment of the concepts underlying CIS. The second part of the book details CIS as a standalone domain. A series of frameworks, theories, and models are introduced to provide a conceptual basis for CIS. The final part describes several systems and applications of CIS, along with their broader implications on other fields such as computer-supported cooperative work (CSCW) and human-computer interaction (HCI). With this first comprehensive overview of an exciting new research field, Shah delivers to graduate students and researchers in academia and industry an encompassing description of the technologies involved, state-of-the-art results, and open challenges as well as research opportunities.
  17. Vo, D.-T.; Bagheri, E.: Feature-enriched matrix factorization for relation extraction (2019) 0.01 
    0.010430394 = product of:
  0.041721575 = sum of:
    0.041721575 = weight(_text_:open in 5105) [ClassicSimilarity], result of:
      0.041721575 = score(doc=5105,freq=2.0), product of:
        0.20964009 = queryWeight, product of:
          4.5032015 = idf(docFreq=1330, maxDocs=44218)
          0.046553567 = queryNorm
        0.19901526 = fieldWeight in 5105, product of:
          1.4142135 = tf(freq=2.0), with freq of:
            2.0 = termFreq=2.0
          4.5032015 = idf(docFreq=1330, maxDocs=44218)
          0.03125 = fieldNorm(doc=5105)
  0.25 = coord(1/4)
    Abstract
    Relation extraction aims at finding meaningful relationships between two named entities from within unstructured textual content. In this paper, we define the problem of information extraction as a matrix completion problem where we employ the notion of universal schemas formed as a collection of patterns derived from open information extraction systems as well as additional features derived from grammatical clause patterns and statistical topic models. One of the challenges with earlier work that employ matrix completion methods is that such approaches require a sufficient number of observed relation instances to be able to make predictions. However, in practice there is often insufficient number of explicit evidence supporting each relation type that could be used within the matrix model. Hence, existing work suffer from a low recall. In our work, we extend the work in the state of the art by proposing novel ways of integrating two sets of features, i.e., topic models and grammatical clause structures, for alleviating the low recall problem. More specifically, we propose that it is possible to (1) employ grammatical clause information from textual sentences to serve as an implicit indication of relation type and argument similarity. The basis for this is that it is likely that similar relation types and arguments are observed within similar grammatical structures, and (2) benefit from statistical topic models to determine similarity between relation types and arguments. We employ statistical topic models to determine relation type and argument similarity based on their co-occurrence within the same topics. We have performed extensive experiments based on both gold standard and silver standard datasets. The experiments show that our approach has been able to address the low recall problem in existing methods, by showing an improvement of 21% on recall and 8% on f-measure over the state of the art baseline.
  18. Walker, S.: Subject access in online catalogues (1991) 0.01 
    0.010234613 = product of:
  0.040938452 = sum of:
    0.040938452 = product of:
      0.081876904 = sum of:
        0.081876904 = weight(_text_:access in 5690) [ClassicSimilarity], result of:
          0.081876904 = score(doc=5690,freq=6.0), product of:
            0.15778996 = queryWeight, product of:
              3.389428 = idf(docFreq=4053, maxDocs=44218)
              0.046553567 = queryNorm
            0.51889807 = fieldWeight in 5690, product of:
              2.4494898 = tf(freq=6.0), with freq of:
                6.0 = termFreq=6.0
              3.389428 = idf(docFreq=4053, maxDocs=44218)
              0.0625 = fieldNorm(doc=5690)
      0.5 = coord(1/2)
  0.25 = coord(1/4)
    Abstract
    Discusses some of the methods of subject access to on-line catalohues (OPACs) and argues that none are entirley satisfactory. Describes 2 methods for improving subject access: best match searching; and automatic query expansion application and discusses their feasibility. Mentions emerging application standards for information retrieval and concludes that existing standards are incompatible with most methods for improving standards
  19. Rekabsaz, N. et al.: Toward optimized multimodal concept indexing (2016) 0.01 
    0.007884207 = product of:
  0.03153683 = sum of:
    0.03153683 = product of:
      0.06307366 = sum of:
        0.06307366 = weight(_text_:22 in 2751) [ClassicSimilarity], result of:
          0.06307366 = score(doc=2751,freq=2.0), product of:
            0.16302267 = queryWeight, product of:
              3.5018296 = idf(docFreq=3622, maxDocs=44218)
              0.046553567 = 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.5 = coord(1/2)
  0.25 = coord(1/4)
    Date
    1. 2.2016 18:25:22
  20. Kozikowski, P. et al.: Support of part-whole relations in query answering (2016) 0.01 
    0.007884207 = product of:
  0.03153683 = sum of:
    0.03153683 = product of:
      0.06307366 = sum of:
        0.06307366 = weight(_text_:22 in 2754) [ClassicSimilarity], result of:
          0.06307366 = score(doc=2754,freq=2.0), product of:
            0.16302267 = queryWeight, product of:
              3.5018296 = idf(docFreq=3622, maxDocs=44218)
              0.046553567 = 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.5 = coord(1/2)
  0.25 = coord(1/4)
    Date
    1. 2.2016 18:25:22

Authors

Years

Languages

  • e 45
  • d 8
  • f 1
  • More… Less…

Types

  • a 44
  • el 10
  • m 4
  • r 2
  • x 1
  • More… Less…

Themes