Search (4 results, page 1 of 1)

  • × author_ss:"Mayr, P."
  • × language_ss:"e"
  • × type_ss:"a"
  • × year_i:[2000 TO 2010}
  1. Mayr, P.; Petras, V.: Building a Terminology Network for Search : the KoMoHe project (2008) 0.02 
    0.023882624 = product of:
  0.047765248 = sum of:
    0.047765248 = sum of:
      0.008511645 = weight(_text_:a in 2618) [ClassicSimilarity], result of:
        0.008511645 = score(doc=2618,freq=8.0), product of:
          0.04772363 = queryWeight, product of:
            1.153047 = idf(docFreq=37942, maxDocs=44218)
            0.041389145 = queryNorm
          0.17835285 = fieldWeight in 2618, product of:
            2.828427 = tf(freq=8.0), with freq of:
              8.0 = termFreq=8.0
            1.153047 = idf(docFreq=37942, maxDocs=44218)
            0.0546875 = fieldNorm(doc=2618)
      0.039253604 = weight(_text_:22 in 2618) [ClassicSimilarity], result of:
        0.039253604 = score(doc=2618,freq=2.0), product of:
          0.14493774 = queryWeight, product of:
            3.5018296 = idf(docFreq=3622, maxDocs=44218)
            0.041389145 = queryNorm
          0.2708308 = fieldWeight in 2618, 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=2618)
  0.5 = coord(1/2)
    Abstract
    The paper reports about results on the GESIS-IZ project "Competence Center Modeling and Treatment of Semantic Heterogeneity" (KoMoHe). KoMoHe supervised a terminology mapping effort, in which 'cross-concordances' between major controlled vocabularies were organized, created and managed. In this paper we describe the establishment and implementation of crossconcordances for search in a digital library (DL).
    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
    Type
    a
  2. Lauser, B.; Johannsen, G.; Caracciolo, C.; Hage, W.R. van; Keizer, J.; Mayr, P.: Comparing human and automatic thesaurus mapping approaches in the agricultural domain (2008) 0.02 
    0.016168661 = product of:
  0.032337323 = sum of:
    0.032337323 = sum of:
      0.00429903 = weight(_text_:a in 2627) [ClassicSimilarity], result of:
        0.00429903 = score(doc=2627,freq=4.0), product of:
          0.04772363 = queryWeight, product of:
            1.153047 = idf(docFreq=37942, maxDocs=44218)
            0.041389145 = queryNorm
          0.090081796 = fieldWeight in 2627, product of:
            2.0 = tf(freq=4.0), with freq of:
              4.0 = termFreq=4.0
            1.153047 = idf(docFreq=37942, maxDocs=44218)
            0.0390625 = fieldNorm(doc=2627)
      0.028038291 = weight(_text_:22 in 2627) [ClassicSimilarity], result of:
        0.028038291 = score(doc=2627,freq=2.0), product of:
          0.14493774 = queryWeight, product of:
            3.5018296 = idf(docFreq=3622, maxDocs=44218)
            0.041389145 = queryNorm
          0.19345059 = fieldWeight in 2627, 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=2627)
  0.5 = coord(1/2)
    Abstract
    Knowledge organization systems (KOS), like thesauri and other controlled vocabularies, are used to provide subject access to information systems across the web. Due to the heterogeneity of these systems, mapping between vocabularies becomes crucial for retrieving relevant information. However, mapping thesauri is a laborious task, and thus big efforts are being made to automate the mapping process. This paper examines two mapping approaches involving the agricultural thesaurus AGROVOC, one machine-created and one human created. We are addressing the basic question "What are the pros and cons of human and automatic mapping and how can they complement each other?" By pointing out the difficulties in specific cases or groups of cases and grouping the sample into simple and difficult types of mappings, we show the limitations of current automatic methods and come up with some basic recommendations on what approach to use when.
    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
    Type
    a
  3. Lewandowski, D.; Mayr, P.: Exploring the academic invisible Web (2006) 0.00 
    0.0016993409 = product of:
  0.0033986818 = sum of:
    0.0033986818 = product of:
      0.0067973635 = sum of:
        0.0067973635 = weight(_text_:a in 2580) [ClassicSimilarity], result of:
          0.0067973635 = score(doc=2580,freq=10.0), product of:
            0.04772363 = queryWeight, product of:
              1.153047 = idf(docFreq=37942, maxDocs=44218)
              0.041389145 = queryNorm
            0.14243183 = fieldWeight in 2580, product of:
              3.1622777 = tf(freq=10.0), with freq of:
                10.0 = termFreq=10.0
              1.153047 = idf(docFreq=37942, maxDocs=44218)
              0.0390625 = fieldNorm(doc=2580)
      0.5 = coord(1/2)
  0.5 = coord(1/2)
    Abstract
    Purpose: To provide a critical review of Bergman's 2001 study on the deep web. In addition, we bring a new concept into the discussion, the academic invisible web (AIW). We define the academic invisible web as consisting of all databases and collections relevant to academia but not searchable by the general-purpose internet search engines. Indexing this part of the invisible web is central to scientific search engines. We provide an overview of approaches followed thus far. Design/methodology/approach: Discussion of measures and calculations, estimation based on informetric laws. Literature review on approaches for uncovering information from the invisible web. Findings: Bergman's size estimate of the invisible web is highly questionable. We demonstrate some major errors in the conceptual design of the Bergman paper. A new (raw) size estimate is given. Research limitations/implications: The precision of our estimate is limited due to a small sample size and lack of reliable data. Practical implications: We can show that no single library alone will be able to index the academic invisible web. We suggest collaboration to accomplish this task. Originality/value: Provides library managers and those interested in developing academic search engines with data on the size and attributes of the academic invisible web.
    Type
    a
  4. Mayr, P.; Mutschke, P.; Petras, V.: Reducing semantic complexity in distributed digital libraries : Treatment of term vagueness and document re-ranking (2008) 0.00 
    0.0015199365 = product of:
  0.003039873 = sum of:
    0.003039873 = product of:
      0.006079746 = sum of:
        0.006079746 = weight(_text_:a in 1909) [ClassicSimilarity], result of:
          0.006079746 = score(doc=1909,freq=8.0), product of:
            0.04772363 = queryWeight, product of:
              1.153047 = idf(docFreq=37942, maxDocs=44218)
              0.041389145 = queryNorm
            0.12739488 = fieldWeight in 1909, product of:
              2.828427 = tf(freq=8.0), with freq of:
                8.0 = termFreq=8.0
              1.153047 = idf(docFreq=37942, maxDocs=44218)
              0.0390625 = fieldNorm(doc=1909)
      0.5 = coord(1/2)
  0.5 = coord(1/2)
    Abstract
    Purpose - The general science portal "vascoda" merges structured, high-quality information collections from more than 40 providers on the basis of search engine technology (FAST) and a concept which treats semantic heterogeneity between different controlled vocabularies. First experiences with the portal show some weaknesses of this approach which come out in most metadata-driven Digital Libraries (DLs) or subject specific portals. The purpose of the paper is to propose models to reduce the semantic complexity in heterogeneous DLs. The aim is to introduce value-added services (treatment of term vagueness and document re-ranking) that gain a certain quality in DLs if they are combined with heterogeneity components established in the project "Competence Center Modeling and Treatment of Semantic Heterogeneity". Design/methodology/approach - Two methods, which are derived from scientometrics and network analysis, will be implemented with the objective to re-rank result sets by the following structural properties: the ranking of the results by core journals (so-called Bradfordizing) and ranking by centrality of authors in co-authorship networks. Findings - The methods, which will be implemented, focus on the query and on the result side of a search and are designed to positively influence each other. Conceptually, they will improve the search quality and guarantee that the most relevant documents in result sets will be ranked higher. Originality/value - The central impact of the paper focuses on the integration of three structural value-adding methods, which aim at reducing the semantic complexity represented in distributed DLs at several stages in the information retrieval process: query construction, search and ranking and re-ranking.
    Type
    a

Authors

Themes